./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version d790fecc
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1 --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 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-12-01 13:20:15,516 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-12-01 13:20:15,572 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-12-01 13:20:15,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-12-01 13:20:15,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-12-01 13:20:15,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-12-01 13:20:15,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-12-01 13:20:15,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-12-01 13:20:15,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-12-01 13:20:15,600 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-12-01 13:20:15,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-12-01 13:20:15,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-12-01 13:20:15,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-12-01 13:20:15,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-12-01 13:20:15,601 INFO L153 SettingsManager]: * Use SBE=true
[2024-12-01 13:20:15,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-12-01 13:20:15,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-12-01 13:20:15,601 INFO L153 SettingsManager]: * sizeof long=4
[2024-12-01 13:20:15,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-12-01 13:20:15,601 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-12-01 13:20:15,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-12-01 13:20:15,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-12-01 13:20:15,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-12-01 13:20:15,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-12-01 13:20:15,602 INFO L153 SettingsManager]: * sizeof long double=12
[2024-12-01 13:20:15,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-12-01 13:20:15,602 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-12-01 13:20:15,602 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-12-01 13:20:15,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-12-01 13:20:15,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-01 13:20:15,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-01 13:20:15,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-01 13:20:15,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-01 13:20:15,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-12-01 13:20:15,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-01 13:20:15,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-01 13:20:15,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-01 13:20:15,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-01 13:20:15,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-12-01 13:20:15,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-12-01 13:20:15,604 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-12-01 13:20:15,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-12-01 13:20:15,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-12-01 13:20:15,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-12-01 13:20:15,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-12-01 13:20:15,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-12-01 13:20:15,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-12-01 13:20:15,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-12-01 13:20:15,605 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1
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 -> 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca
[2024-12-01 13:20:15,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-12-01 13:20:15,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-12-01 13:20:15,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-12-01 13:20:15,850 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-12-01 13:20:15,850 INFO L274 PluginConnector]: CDTParser initialized
[2024-12-01 13:20:15,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-12-01 13:20:18,642 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/data/6cd0aefe3/bb97beb43494499199692e8a23945987/FLAG27003d8bf
[2024-12-01 13:20:18,923 INFO L384 CDTParser]: Found 1 translation units.
[2024-12-01 13:20:18,924 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-12-01 13:20:18,938 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/data/6cd0aefe3/bb97beb43494499199692e8a23945987/FLAG27003d8bf
[2024-12-01 13:20:19,198 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/data/6cd0aefe3/bb97beb43494499199692e8a23945987
[2024-12-01 13:20:19,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-12-01 13:20:19,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-12-01 13:20:19,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-12-01 13:20:19,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-12-01 13:20:19,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-12-01 13:20:19,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a5aab56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19, skipping insertion in model container
[2024-12-01 13:20:19,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,245 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-12-01 13:20:19,408 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_060cf381-e9c4-4d64-8655-24601394e369/sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008]
[2024-12-01 13:20:19,556 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-01 13:20:19,565 INFO L200 MainTranslator]: Completed pre-run
[2024-12-01 13:20:19,577 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_060cf381-e9c4-4d64-8655-24601394e369/sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008]
[2024-12-01 13:20:19,623 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-01 13:20:19,657 INFO L204 MainTranslator]: Completed translation
[2024-12-01 13:20:19,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19 WrapperNode
[2024-12-01 13:20:19,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-12-01 13:20:19,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-12-01 13:20:19,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-12-01 13:20:19,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-12-01 13:20:19,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,700 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 104
[2024-12-01 13:20:19,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-12-01 13:20:19,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-12-01 13:20:19,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-12-01 13:20:19,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-12-01 13:20:19,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,726 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-12-01 13:20:19,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-12-01 13:20:19,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-12-01 13:20:19,743 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-12-01 13:20:19,743 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-12-01 13:20:19,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (1/1) ...
[2024-12-01 13:20:19,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-01 13:20:19,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-01 13:20:19,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-12-01 13:20:19,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-12-01 13:20:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-12-01 13:20:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-12-01 13:20:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-12-01 13:20:19,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-12-01 13:20:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-12-01 13:20:19,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-12-01 13:20:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-12-01 13:20:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-12-01 13:20:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-12-01 13:20:19,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-12-01 13:20:19,806 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-12-01 13:20:19,911 INFO L234 CfgBuilder]: Building ICFG
[2024-12-01 13:20:19,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-12-01 13:20:20,163 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-12-01 13:20:20,164 INFO L283 CfgBuilder]: Performing block encoding
[2024-12-01 13:20:20,332 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-12-01 13:20:20,332 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-12-01 13:20:20,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:20:20 BoogieIcfgContainer
[2024-12-01 13:20:20,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-12-01 13:20:20,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-12-01 13:20:20,335 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-12-01 13:20:20,340 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-12-01 13:20:20,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 01:20:19" (1/3) ...
[2024-12-01 13:20:20,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ab02a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:20:20, skipping insertion in model container
[2024-12-01 13:20:20,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:20:19" (2/3) ...
[2024-12-01 13:20:20,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ab02a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:20:20, skipping insertion in model container
[2024-12-01 13:20:20,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:20:20" (3/3) ...
[2024-12-01 13:20:20,342 INFO L128 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-12-01 13:20:20,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-12-01 13:20:20,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 31 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2024-12-01 13:20:20,360 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-12-01 13:20:20,411 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-12-01 13:20:20,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 70 flow
[2024-12-01 13:20:20,470 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events.
[2024-12-01 13:20:20,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-01 13:20:20,475 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 43 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-12-01 13:20:20,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 70 flow
[2024-12-01 13:20:20,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 64 flow
[2024-12-01 13:20:20,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-12-01 13:20:20,498 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;@3e1e118b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-01 13:20:20,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-12-01 13:20:20,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-12-01 13:20:20,502 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-12-01 13:20:20,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-01 13:20:20,502 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-01 13:20:20,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-12-01 13:20:20,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-01 13:20:20,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-01 13:20:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash 9622997, now seen corresponding path program 1 times
[2024-12-01 13:20:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-01 13:20:20,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114879792]
[2024-12-01 13:20:20,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-01 13:20:20,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-01 13:20:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-01 13:20:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-01 13:20:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-01 13:20:20,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114879792]
[2024-12-01 13:20:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114879792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-01 13:20:20,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-01 13:20:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-01 13:20:20,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064255942]
[2024-12-01 13:20:20,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-01 13:20:20,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-01 13:20:20,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-01 13:20:20,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-01 13:20:20,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-01 13:20:20,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 31
[2024-12-01 13:20:20,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-01 13:20:20,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-01 13:20:20,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 31
[2024-12-01 13:20:20,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-01 13:20:21,170 INFO L124 PetriNetUnfolderBase]: 135/295 cut-off events.
[2024-12-01 13:20:21,170 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-12-01 13:20:21,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 295 events. 135/295 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1381 event pairs, 51 based on Foata normal form. 15/304 useless extension candidates. Maximal degree in co-relation 539. Up to 199 conditions per place.
[2024-12-01 13:20:21,174 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 21 selfloop transitions, 2 changer transitions 2/37 dead transitions.
[2024-12-01 13:20:21,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 133 flow
[2024-12-01 13:20:21,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-01 13:20:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-01 13:20:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions.
[2024-12-01 13:20:21,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7526881720430108
[2024-12-01 13:20:21,189 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 70 transitions.
[2024-12-01 13:20:21,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 133 flow
[2024-12-01 13:20:21,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-01 13:20:21,197 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 60 flow
[2024-12-01 13:20:21,199 INFO L262 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-12-01 13:20:21,202 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places.
[2024-12-01 13:20:21,202 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 60 flow
[2024-12-01 13:20:21,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-01 13:20:21,202 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-01 13:20:21,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-01 13:20:21,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-12-01 13:20:21,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-01 13:20:21,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-01 13:20:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1409716125, now seen corresponding path program 1 times
[2024-12-01 13:20:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-01 13:20:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020827446]
[2024-12-01 13:20:21,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-01 13:20:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-01 13:20:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-01 13:20:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-01 13:20:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-01 13:20:21,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020827446]
[2024-12-01 13:20:21,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020827446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-01 13:20:21,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-01 13:20:21,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-01 13:20:21,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712503500]
[2024-12-01 13:20:21,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-01 13:20:21,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-12-01 13:20:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-01 13:20:21,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-12-01 13:20:21,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-12-01 13:20:21,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31
[2024-12-01 13:20:21,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-01 13:20:21,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-01 13:20:21,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31
[2024-12-01 13:20:21,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-01 13:20:21,693 INFO L124 PetriNetUnfolderBase]: 345/756 cut-off events.
[2024-12-01 13:20:21,694 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-12-01 13:20:21,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 756 events. 345/756 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4208 event pairs, 49 based on Foata normal form. 36/758 useless extension candidates. Maximal degree in co-relation 1406. Up to 361 conditions per place.
[2024-12-01 13:20:21,700 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 31 selfloop transitions, 4 changer transitions 1/43 dead transitions.
[2024-12-01 13:20:21,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 172 flow
[2024-12-01 13:20:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-12-01 13:20:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-12-01 13:20:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions.
[2024-12-01 13:20:21,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871
[2024-12-01 13:20:21,702 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 60 flow. Second operand 4 states and 74 transitions.
[2024-12-01 13:20:21,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 172 flow
[2024-12-01 13:20:21,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-01 13:20:21,704 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 82 flow
[2024-12-01 13:20:21,704 INFO L262 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-12-01 13:20:21,705 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places.
[2024-12-01 13:20:21,705 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 82 flow
[2024-12-01 13:20:21,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-01 13:20:21,705 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-01 13:20:21,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-01 13:20:21,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-12-01 13:20:21,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-01 13:20:21,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-01 13:20:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2143591972, now seen corresponding path program 1 times
[2024-12-01 13:20:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-01 13:20:21,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076217562]
[2024-12-01 13:20:21,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-01 13:20:21,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-01 13:20:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-01 13:20:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-01 13:20:21,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-01 13:20:21,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076217562]
[2024-12-01 13:20:21,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076217562] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-01 13:20:21,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-01 13:20:21,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-01 13:20:21,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503935965]
[2024-12-01 13:20:21,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-01 13:20:21,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-12-01 13:20:21,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-01 13:20:21,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-12-01 13:20:21,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-12-01 13:20:21,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31
[2024-12-01 13:20:21,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-12-01 13:20:21,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-01 13:20:21,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31
[2024-12-01 13:20:21,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-01 13:20:22,120 INFO L124 PetriNetUnfolderBase]: 300/684 cut-off events.
[2024-12-01 13:20:22,120 INFO L125 PetriNetUnfolderBase]: For 139/141 co-relation queries the response was YES.
[2024-12-01 13:20:22,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 684 events. 300/684 cut-off events. For 139/141 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3778 event pairs, 25 based on Foata normal form. 36/679 useless extension candidates. Maximal degree in co-relation 1385. Up to 319 conditions per place.
[2024-12-01 13:20:22,125 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions.
[2024-12-01 13:20:22,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 191 flow
[2024-12-01 13:20:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-12-01 13:20:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-12-01 13:20:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions.
[2024-12-01 13:20:22,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6209677419354839
[2024-12-01 13:20:22,126 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 82 flow. Second operand 4 states and 77 transitions.
[2024-12-01 13:20:22,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 191 flow
[2024-12-01 13:20:22,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 182 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-12-01 13:20:22,128 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 106 flow
[2024-12-01 13:20:22,128 INFO L262 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=39, PETRI_TRANSITIONS=31}
[2024-12-01 13:20:22,129 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places.
[2024-12-01 13:20:22,129 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 106 flow
[2024-12-01 13:20:22,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-12-01 13:20:22,129 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-01 13:20:22,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-01 13:20:22,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-12-01 13:20:22,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-01 13:20:22,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-01 13:20:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2130345477, now seen corresponding path program 1 times
[2024-12-01 13:20:22,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-01 13:20:22,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544856461]
[2024-12-01 13:20:22,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-01 13:20:22,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-01 13:20:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-01 13:20:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-01 13:20:22,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-01 13:20:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544856461]
[2024-12-01 13:20:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544856461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-01 13:20:22,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-01 13:20:22,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-01 13:20:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505680667]
[2024-12-01 13:20:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-01 13:20:22,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-12-01 13:20:22,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-01 13:20:22,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-12-01 13:20:22,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-12-01 13:20:22,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31
[2024-12-01 13:20:22,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-12-01 13:20:22,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-01 13:20:22,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31
[2024-12-01 13:20:22,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-01 13:20:22,498 INFO L124 PetriNetUnfolderBase]: 214/511 cut-off events.
[2024-12-01 13:20:22,498 INFO L125 PetriNetUnfolderBase]: For 290/304 co-relation queries the response was YES.
[2024-12-01 13:20:22,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 511 events. 214/511 cut-off events. For 290/304 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2652 event pairs, 60 based on Foata normal form. 31/509 useless extension candidates. Maximal degree in co-relation 1131. Up to 169 conditions per place.
[2024-12-01 13:20:22,502 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 32 selfloop transitions, 5 changer transitions 0/49 dead transitions.
[2024-12-01 13:20:22,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 226 flow
[2024-12-01 13:20:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-12-01 13:20:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-12-01 13:20:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions.
[2024-12-01 13:20:22,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6532258064516129
[2024-12-01 13:20:22,504 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 106 flow. Second operand 4 states and 81 transitions.
[2024-12-01 13:20:22,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 226 flow
[2024-12-01 13:20:22,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 223 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-12-01 13:20:22,506 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 143 flow
[2024-12-01 13:20:22,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=43, PETRI_TRANSITIONS=34}
[2024-12-01 13:20:22,507 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places.
[2024-12-01 13:20:22,507 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 143 flow
[2024-12-01 13:20:22,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-12-01 13:20:22,507 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-01 13:20:22,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-01 13:20:22,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-12-01 13:20:22,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-01 13:20:22,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-01 13:20:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1101925945, now seen corresponding path program 1 times
[2024-12-01 13:20:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-01 13:20:22,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249379879]
[2024-12-01 13:20:22,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-01 13:20:22,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-01 13:20:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-01 13:20:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-01 13:20:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-01 13:20:22,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249379879]
[2024-12-01 13:20:22,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249379879] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-01 13:20:22,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-01 13:20:22,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-01 13:20:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537734337]
[2024-12-01 13:20:22,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-01 13:20:22,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-01 13:20:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-01 13:20:22,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-01 13:20:22,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-12-01 13:20:22,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31
[2024-12-01 13:20:22,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-12-01 13:20:22,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-01 13:20:22,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31
[2024-12-01 13:20:22,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-01 13:20:22,988 INFO L124 PetriNetUnfolderBase]: 151/350 cut-off events.
[2024-12-01 13:20:22,989 INFO L125 PetriNetUnfolderBase]: For 524/540 co-relation queries the response was YES.
[2024-12-01 13:20:22,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 350 events. 151/350 cut-off events. For 524/540 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1532 event pairs, 59 based on Foata normal form. 19/354 useless extension candidates. Maximal degree in co-relation 917. Up to 142 conditions per place.
[2024-12-01 13:20:22,991 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 28 selfloop transitions, 7 changer transitions 0/47 dead transitions.
[2024-12-01 13:20:22,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 247 flow
[2024-12-01 13:20:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-12-01 13:20:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-12-01 13:20:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions.
[2024-12-01 13:20:22,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226
[2024-12-01 13:20:22,993 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 143 flow. Second operand 5 states and 90 transitions.
[2024-12-01 13:20:22,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 247 flow
[2024-12-01 13:20:22,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-12-01 13:20:22,997 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 176 flow
[2024-12-01 13:20:22,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=35}
[2024-12-01 13:20:22,998 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places.
[2024-12-01 13:20:22,998 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 176 flow
[2024-12-01 13:20:22,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-12-01 13:20:22,998 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-01 13:20:22,998 INFO L206 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-12-01 13:20:22,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-12-01 13:20:22,999 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-01 13:20:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-01 13:20:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 283806980, now seen corresponding path program 1 times
[2024-12-01 13:20:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-01 13:20:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713875835]
[2024-12-01 13:20:22,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-01 13:20:23,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-01 13:20:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-01 13:20:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-01 13:20:23,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-01 13:20:23,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713875835]
[2024-12-01 13:20:23,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713875835] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-01 13:20:23,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-01 13:20:23,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-12-01 13:20:23,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521883556]
[2024-12-01 13:20:23,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-01 13:20:23,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-12-01 13:20:23,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-01 13:20:23,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-12-01 13:20:23,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-12-01 13:20:23,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31
[2024-12-01 13:20:23,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 176 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-12-01 13:20:23,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-01 13:20:23,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31
[2024-12-01 13:20:23,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-01 13:20:24,334 INFO L124 PetriNetUnfolderBase]: 135/371 cut-off events.
[2024-12-01 13:20:24,334 INFO L125 PetriNetUnfolderBase]: For 525/528 co-relation queries the response was YES.
[2024-12-01 13:20:24,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 371 events. 135/371 cut-off events. For 525/528 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1882 event pairs, 13 based on Foata normal form. 6/359 useless extension candidates. Maximal degree in co-relation 980. Up to 75 conditions per place.
[2024-12-01 13:20:24,336 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 22 selfloop transitions, 4 changer transitions 19/62 dead transitions.
[2024-12-01 13:20:24,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 334 flow
[2024-12-01 13:20:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-12-01 13:20:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-12-01 13:20:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-12-01 13:20:24,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5448028673835126
[2024-12-01 13:20:24,338 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 176 flow. Second operand 9 states and 152 transitions.
[2024-12-01 13:20:24,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 334 flow
[2024-12-01 13:20:24,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 324 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-12-01 13:20:24,344 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 168 flow
[2024-12-01 13:20:24,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=168, PETRI_PLACES=58, PETRI_TRANSITIONS=33}
[2024-12-01 13:20:24,345 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places.
[2024-12-01 13:20:24,345 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 168 flow
[2024-12-01 13:20:24,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-12-01 13:20:24,345 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-01 13:20:24,345 INFO L206 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-12-01 13:20:24,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-12-01 13:20:24,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-01 13:20:24,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-01 13:20:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1061151274, now seen corresponding path program 2 times
[2024-12-01 13:20:24,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-01 13:20:24,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828163091]
[2024-12-01 13:20:24,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-01 13:20:24,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-01 13:20:24,428 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-12-01 13:20:24,428 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-12-01 13:20:24,428 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-12-01 13:20:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-12-01 13:20:24,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-12-01 13:20:24,537 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-12-01 13:20:24,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-12-01 13:20:24,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2024-12-01 13:20:24,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-12-01 13:20:24,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-12-01 13:20:24,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2024-12-01 13:20:24,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-12-01 13:20:24,541 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1]
[2024-12-01 13:20:24,591 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-12-01 13:20:24,591 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-12-01 13:20:24,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 01:20:24 BasicIcfg
[2024-12-01 13:20:24,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-12-01 13:20:24,597 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-12-01 13:20:24,598 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-12-01 13:20:24,598 INFO L274 PluginConnector]: Witness Printer initialized
[2024-12-01 13:20:24,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:20:20" (3/4) ...
[2024-12-01 13:20:24,599 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample
[2024-12-01 13:20:24,676 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9.
[2024-12-01 13:20:24,728 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml
[2024-12-01 13:20:24,728 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/witness.yml
[2024-12-01 13:20:24,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-12-01 13:20:24,729 INFO L158 Benchmark]: Toolchain (without parser) took 5528.10ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 114.8MB in the beginning and 184.1MB in the end (delta: -69.3MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB.
[2024-12-01 13:20:24,730 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-12-01 13:20:24,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.42ms. Allocated memory is still 142.6MB. Free memory was 114.8MB in the beginning and 92.2MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-12-01 13:20:24,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.56ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-01 13:20:24,730 INFO L158 Benchmark]: Boogie Preprocessor took 40.95ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 87.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-01 13:20:24,731 INFO L158 Benchmark]: RCFGBuilder took 589.76ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 103.2MB in the end (delta: -16.1MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB.
[2024-12-01 13:20:24,731 INFO L158 Benchmark]: TraceAbstraction took 4261.92ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 102.5MB in the beginning and 192.5MB in the end (delta: -89.9MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB.
[2024-12-01 13:20:24,731 INFO L158 Benchmark]: Witness Printer took 131.01ms. Allocated memory is still 302.0MB. Free memory was 192.5MB in the beginning and 184.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-12-01 13:20:24,733 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.30ms. Allocated memory is still 142.6MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 455.42ms. Allocated memory is still 142.6MB. Free memory was 114.8MB in the beginning and 92.2MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 42.56ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 40.95ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 87.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 589.76ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 103.2MB in the end (delta: -16.1MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 4261.92ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 102.5MB in the beginning and 192.5MB in the end (delta: -89.9MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB.
* Witness Printer took 131.01ms. Allocated memory is still 302.0MB. Free memory was 192.5MB in the beginning and 184.1MB 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;
[L733] 0 _Bool weak$$choice0;
[L734] 0 _Bool weak$$choice2;
[L810] 0 pthread_t t585;
[L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=-2, 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]
[L812] 0 pthread_t t586;
[L813] FCALL, FORK 0 pthread_create(&t586, ((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, t585=-2, t586=-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]
[L738] 1 y$w_buff1 = y$w_buff0
[L739] 1 y$w_buff0 = 1
[L740] 1 y$w_buff1_used = y$w_buff0_used
[L741] 1 y$w_buff0_used = (_Bool)1
[L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0
[L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1
[L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2
[L746] 1 y$r_buff0_thd1 = (_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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L749] 1 x = 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L766] 2 x = 2
VAL [\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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L769] 2 __unbuffered_p1_EAX = x
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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L772] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L773] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L774] 2 y$flush_delayed = weak$$choice2
[L775] 2 y$mem_tmp = y
[L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L783] 2 __unbuffered_p1_EBX = y
[L784] 2 y = y$flush_delayed ? y$mem_tmp : y
[L785] 2 y$flush_delayed = (_Bool)0
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=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L788] 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)
[L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L790] 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
[L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L792] 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}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L795] 2 __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=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L752] 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)
[L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L754] 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
[L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L756] 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}, \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=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L759] 1 __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=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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, t585=-2, t586=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L821] 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
[L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L823] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=-2, t586=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 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, t585=-2, t586=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L828] 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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 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.
- 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.
- 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.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 423 IncrementalHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 14 mSDtfsCounter, 423 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=5, InterpolantAutomatonStates: 29, 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.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-12-01 13:20:24,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_060cf381-e9c4-4d64-8655-24601394e369/bin/uautomizer-verify-84ZbGMXZE1/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