./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_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_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/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_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/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_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/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 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-12-02 07:27:35,166 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-12-02 07:27:35,218 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-12-02 07:27:35,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-12-02 07:27:35,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-12-02 07:27:35,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-12-02 07:27:35,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-12-02 07:27:35,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-12-02 07:27:35,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-12-02 07:27:35,245 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-12-02 07:27:35,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-12-02 07:27:35,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-12-02 07:27:35,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-12-02 07:27:35,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-12-02 07:27:35,246 INFO L153 SettingsManager]: * Use SBE=true
[2024-12-02 07:27:35,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-12-02 07:27:35,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-12-02 07:27:35,246 INFO L153 SettingsManager]: * sizeof long=4
[2024-12-02 07:27:35,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-12-02 07:27:35,247 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-12-02 07:27:35,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-12-02 07:27:35,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-12-02 07:27:35,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-12-02 07:27:35,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-12-02 07:27:35,247 INFO L153 SettingsManager]: * sizeof long double=12
[2024-12-02 07:27:35,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-12-02 07:27:35,247 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-12-02 07:27:35,247 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-12-02 07:27:35,248 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-12-02 07:27:35,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 07:27:35,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 07:27:35,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 07:27:35,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 07:27:35,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-12-02 07:27:35,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 07:27:35,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 07:27:35,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 07:27:35,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 07:27:35,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-12-02 07:27:35,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-12-02 07:27:35,249 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-12-02 07:27:35,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-12-02 07:27:35,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-12-02 07:27:35,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-12-02 07:27:35,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-12-02 07:27:35,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-12-02 07:27:35,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-12-02 07:27:35,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-12-02 07:27:35,250 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_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae
[2024-12-02 07:27:35,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-12-02 07:27:35,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-12-02 07:27:35,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-12-02 07:27:35,488 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-12-02 07:27:35,488 INFO L274 PluginConnector]: CDTParser initialized
[2024-12-02 07:27:35,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-12-02 07:27:38,169 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/data/a89d7fccc/ee5f622670c740159eb6c120c1842344/FLAG914861ddf
[2024-12-02 07:27:38,421 INFO L384 CDTParser]: Found 1 translation units.
[2024-12-02 07:27:38,422 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-12-02 07:27:38,436 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/data/a89d7fccc/ee5f622670c740159eb6c120c1842344/FLAG914861ddf
[2024-12-02 07:27:38,452 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/data/a89d7fccc/ee5f622670c740159eb6c120c1842344
[2024-12-02 07:27:38,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-12-02 07:27:38,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-12-02 07:27:38,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-12-02 07:27:38,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-12-02 07:27:38,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-12-02 07:27:38,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c936be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38, skipping insertion in model container
[2024-12-02 07:27:38,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,498 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-12-02 07:27:38,650 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_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051]
[2024-12-02 07:27:38,801 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 07:27:38,808 INFO L200 MainTranslator]: Completed pre-run
[2024-12-02 07:27:38,817 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_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051]
[2024-12-02 07:27:38,862 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 07:27:38,891 INFO L204 MainTranslator]: Completed translation
[2024-12-02 07:27:38,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38 WrapperNode
[2024-12-02 07:27:38,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-12-02 07:27:38,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-12-02 07:27:38,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-12-02 07:27:38,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-12-02 07:27:38,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,929 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111
[2024-12-02 07:27:38,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-12-02 07:27:38,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-12-02 07:27:38,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-12-02 07:27:38,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-12-02 07:27:38,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,956 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-02 07:27:38,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,963 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-12-02 07:27:38,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-12-02 07:27:38,973 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-12-02 07:27:38,973 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-12-02 07:27:38,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (1/1) ...
[2024-12-02 07:27:38,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 07:27:38,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 07:27:39,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-12-02 07:27:39,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-12-02 07:27:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-12-02 07:27:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-12-02 07:27:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-12-02 07:27:39,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-12-02 07:27:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-12-02 07:27:39,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-12-02 07:27:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-12-02 07:27:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-12-02 07:27:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-12-02 07:27:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-12-02 07:27:39,044 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-12-02 07:27:39,167 INFO L234 CfgBuilder]: Building ICFG
[2024-12-02 07:27:39,169 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-12-02 07:27:39,452 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-12-02 07:27:39,452 INFO L283 CfgBuilder]: Performing block encoding
[2024-12-02 07:27:39,633 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-12-02 07:27:39,633 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-12-02 07:27:39,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:27:39 BoogieIcfgContainer
[2024-12-02 07:27:39,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-12-02 07:27:39,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-12-02 07:27:39,636 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-12-02 07:27:39,641 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-12-02 07:27:39,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:27:38" (1/3) ...
[2024-12-02 07:27:39,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f40fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:27:39, skipping insertion in model container
[2024-12-02 07:27:39,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:27:38" (2/3) ...
[2024-12-02 07:27:39,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f40fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:27:39, skipping insertion in model container
[2024-12-02 07:27:39,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:27:39" (3/3) ...
[2024-12-02 07:27:39,643 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-12-02 07:27:39,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-12-02 07:27:39,660 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 33 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2024-12-02 07:27:39,661 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-12-02 07:27:39,704 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-12-02 07:27:39,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 74 flow
[2024-12-02 07:27:39,761 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events.
[2024-12-02 07:27:39,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 07:27:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place.
[2024-12-02 07:27:39,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 74 flow
[2024-12-02 07:27:39,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 68 flow
[2024-12-02 07:27:39,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-12-02 07:27:39,788 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;@5e468ce3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-02 07:27:39,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-12-02 07:27:39,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-12-02 07:27:39,795 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events.
[2024-12-02 07:27:39,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 07:27:39,795 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:27:39,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-12-02 07:27:39,796 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-12-02 07:27:39,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:27:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash 628297124, now seen corresponding path program 1 times
[2024-12-02 07:27:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:27:39,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065678849]
[2024-12-02 07:27:39,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:27:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:27:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:27:40,200 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-02 07:27:40,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:27:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065678849]
[2024-12-02 07:27:40,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065678849] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:27:40,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:27:40,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 07:27:40,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895194994]
[2024-12-02 07:27:40,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:27:40,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 07:27:40,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:27:40,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 07:27:40,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 07:27:40,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 33
[2024-12-02 07:27:40,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02 07:27:40,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:27:40,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 33
[2024-12-02 07:27:40,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:27:40,458 INFO L124 PetriNetUnfolderBase]: 95/269 cut-off events.
[2024-12-02 07:27:40,458 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 07:27:40,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 269 events. 95/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1446 event pairs, 14 based on Foata normal form. 12/271 useless extension candidates. Maximal degree in co-relation 445. Up to 136 conditions per place.
[2024-12-02 07:27:40,462 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 17 selfloop transitions, 2 changer transitions 2/36 dead transitions.
[2024-12-02 07:27:40,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 120 flow
[2024-12-02 07:27:40,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 07:27:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 07:27:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions.
[2024-12-02 07:27:40,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576
[2024-12-02 07:27:40,477 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 75 transitions.
[2024-12-02 07:27:40,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 120 flow
[2024-12-02 07:27:40,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 07:27:40,485 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow
[2024-12-02 07:27:40,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28}
[2024-12-02 07:27:40,491 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places.
[2024-12-02 07:27:40,491 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow
[2024-12-02 07:27:40,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02 07:27:40,492 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:27:40,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:27:40,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-12-02 07:27:40,492 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-12-02 07:27:40,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:27:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1205208459, now seen corresponding path program 1 times
[2024-12-02 07:27:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:27:40,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236211213]
[2024-12-02 07:27:40,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:27:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:27:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:27:40,734 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-02 07:27:40,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:27:40,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236211213]
[2024-12-02 07:27:40,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236211213] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:27:40,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:27:40,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-02 07:27:40,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143818546]
[2024-12-02 07:27:40,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:27:40,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-12-02 07:27:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:27:40,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-12-02 07:27:40,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-12-02 07:27:40,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33
[2024-12-02 07:27:40,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-02 07:27:40,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:27:40,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33
[2024-12-02 07:27:40,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:27:40,953 INFO L124 PetriNetUnfolderBase]: 142/335 cut-off events.
[2024-12-02 07:27:40,953 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES.
[2024-12-02 07:27:40,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 335 events. 142/335 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1694 event pairs, 24 based on Foata normal form. 20/330 useless extension candidates. Maximal degree in co-relation 626. Up to 133 conditions per place.
[2024-12-02 07:27:40,957 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 27 selfloop transitions, 4 changer transitions 1/44 dead transitions.
[2024-12-02 07:27:40,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 166 flow
[2024-12-02 07:27:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-12-02 07:27:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-12-02 07:27:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions.
[2024-12-02 07:27:40,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818
[2024-12-02 07:27:40,960 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 4 states and 90 transitions.
[2024-12-02 07:27:40,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 166 flow
[2024-12-02 07:27:40,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 07:27:40,963 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 86 flow
[2024-12-02 07:27:40,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, 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=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=38, PETRI_TRANSITIONS=30}
[2024-12-02 07:27:40,964 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places.
[2024-12-02 07:27:40,964 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 86 flow
[2024-12-02 07:27:40,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-02 07:27:40,964 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:27:40,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 07:27:40,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-12-02 07:27:40,965 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-12-02 07:27:40,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:27:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash -647757866, now seen corresponding path program 1 times
[2024-12-02 07:27:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:27:40,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618391945]
[2024-12-02 07:27:40,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:27:40,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:27:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:27:41,278 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-02 07:27:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:27:41,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618391945]
[2024-12-02 07:27:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618391945] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:27:41,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:27:41,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 07:27:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454483367]
[2024-12-02 07:27:41,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:27:41,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 07:27:41,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:27:41,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 07:27:41,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-12-02 07:27:41,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33
[2024-12-02 07:27:41,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-02 07:27:41,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:27:41,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33
[2024-12-02 07:27:41,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:27:41,423 INFO L124 PetriNetUnfolderBase]: 80/187 cut-off events.
[2024-12-02 07:27:41,424 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES.
[2024-12-02 07:27:41,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 187 events. 80/187 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 680 event pairs, 16 based on Foata normal form. 14/188 useless extension candidates. Maximal degree in co-relation 422. Up to 71 conditions per place.
[2024-12-02 07:27:41,426 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 6 changer transitions 1/42 dead transitions.
[2024-12-02 07:27:41,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 175 flow
[2024-12-02 07:27:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-12-02 07:27:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-12-02 07:27:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions.
[2024-12-02 07:27:41,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182
[2024-12-02 07:27:41,428 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 86 flow. Second operand 5 states and 102 transitions.
[2024-12-02 07:27:41,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 175 flow
[2024-12-02 07:27:41,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-12-02 07:27:41,431 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 102 flow
[2024-12-02 07:27:41,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=30}
[2024-12-02 07:27:41,431 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places.
[2024-12-02 07:27:41,432 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 102 flow
[2024-12-02 07:27:41,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-02 07:27:41,432 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:27:41,432 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, 1, 1]
[2024-12-02 07:27:41,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-12-02 07:27:41,432 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-12-02 07:27:41,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:27:41,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1102790500, now seen corresponding path program 1 times
[2024-12-02 07:27:41,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:27:41,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625353888]
[2024-12-02 07:27:41,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 07:27:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:27:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 07:27:41,738 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-02 07:27:41,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:27:41,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625353888]
[2024-12-02 07:27:41,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625353888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:27:41,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:27:41,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-12-02 07:27:41,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456152023]
[2024-12-02 07:27:41,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:27:41,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-12-02 07:27:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:27:41,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-12-02 07:27:41,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-12-02 07:27:41,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33
[2024-12-02 07:27:41,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 102 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02 07:27:41,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:27:41,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33
[2024-12-02 07:27:41,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:27:42,060 INFO L124 PetriNetUnfolderBase]: 183/449 cut-off events.
[2024-12-02 07:27:42,060 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES.
[2024-12-02 07:27:42,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 449 events. 183/449 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2167 event pairs, 44 based on Foata normal form. 8/448 useless extension candidates. Maximal degree in co-relation 977. Up to 145 conditions per place.
[2024-12-02 07:27:42,063 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 23 selfloop transitions, 6 changer transitions 24/64 dead transitions.
[2024-12-02 07:27:42,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 290 flow
[2024-12-02 07:27:42,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-12-02 07:27:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-12-02 07:27:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-12-02 07:27:42,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-12-02 07:27:42,065 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 102 flow. Second operand 8 states and 143 transitions.
[2024-12-02 07:27:42,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 290 flow
[2024-12-02 07:27:42,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 250 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-12-02 07:27:42,069 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 122 flow
[2024-12-02 07:27:42,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=50, PETRI_TRANSITIONS=33}
[2024-12-02 07:27:42,070 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places.
[2024-12-02 07:27:42,070 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 122 flow
[2024-12-02 07:27:42,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02 07:27:42,070 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:27:42,070 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, 1, 1]
[2024-12-02 07:27:42,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-12-02 07:27:42,070 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-12-02 07:27:42,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:27:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash -57267226, now seen corresponding path program 2 times
[2024-12-02 07:27:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:27:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040709456]
[2024-12-02 07:27:42,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-02 07:27:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:27:42,139 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-12-02 07:27:42,140 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-02 07:27:42,956 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-02 07:27:42,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 07:27:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040709456]
[2024-12-02 07:27:42,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040709456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 07:27:42,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 07:27:42,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-12-02 07:27:42,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272056584]
[2024-12-02 07:27:42,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 07:27:42,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-12-02 07:27:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 07:27:42,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-12-02 07:27:42,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-12-02 07:27:43,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33
[2024-12-02 07:27:43,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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-02 07:27:43,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 07:27:43,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33
[2024-12-02 07:27:43,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 07:27:43,375 INFO L124 PetriNetUnfolderBase]: 128/312 cut-off events.
[2024-12-02 07:27:43,376 INFO L125 PetriNetUnfolderBase]: For 92/96 co-relation queries the response was YES.
[2024-12-02 07:27:43,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 312 events. 128/312 cut-off events. For 92/96 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1325 event pairs, 18 based on Foata normal form. 8/307 useless extension candidates. Maximal degree in co-relation 715. Up to 70 conditions per place.
[2024-12-02 07:27:43,378 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 20 selfloop transitions, 8 changer transitions 18/57 dead transitions.
[2024-12-02 07:27:43,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 280 flow
[2024-12-02 07:27:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-12-02 07:27:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-12-02 07:27:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions.
[2024-12-02 07:27:43,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47575757575757577
[2024-12-02 07:27:43,380 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 122 flow. Second operand 10 states and 157 transitions.
[2024-12-02 07:27:43,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 280 flow
[2024-12-02 07:27:43,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 261 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-12-02 07:27:43,383 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 138 flow
[2024-12-02 07:27:43,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=138, PETRI_PLACES=54, PETRI_TRANSITIONS=33}
[2024-12-02 07:27:43,384 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places.
[2024-12-02 07:27:43,384 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 138 flow
[2024-12-02 07:27:43,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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-02 07:27:43,385 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 07:27:43,385 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, 1, 1]
[2024-12-02 07:27:43,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-12-02 07:27:43,385 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-12-02 07:27:43,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 07:27:43,386 INFO L85 PathProgramCache]: Analyzing trace with hash -234910746, now seen corresponding path program 3 times
[2024-12-02 07:27:43,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 07:27:43,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3963379]
[2024-12-02 07:27:43,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-12-02 07:27:43,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 07:27:43,444 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-12-02 07:27:43,445 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-12-02 07:27:43,445 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-12-02 07:27:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-12-02 07:27:43,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-12-02 07:27:43,526 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-12-02 07:27:43,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-12-02 07:27:43,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2024-12-02 07:27:43,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-12-02 07:27:43,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-12-02 07:27:43,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2024-12-02 07:27:43,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-12-02 07:27:43,530 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1]
[2024-12-02 07:27:43,592 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-12-02 07:27:43,592 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-12-02 07:27:43,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:27:43 BasicIcfg
[2024-12-02 07:27:43,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-12-02 07:27:43,599 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-12-02 07:27:43,599 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-12-02 07:27:43,599 INFO L274 PluginConnector]: Witness Printer initialized
[2024-12-02 07:27:43,600 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:27:39" (3/4) ...
[2024-12-02 07:27:43,601 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample
[2024-12-02 07:27:43,678 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9.
[2024-12-02 07:27:43,733 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml
[2024-12-02 07:27:43,733 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/bin/uautomizer-verify-84ZbGMXZE1/witness.yml
[2024-12-02 07:27:43,733 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-12-02 07:27:43,734 INFO L158 Benchmark]: Toolchain (without parser) took 5277.83ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 91.2MB in the beginning and 140.9MB in the end (delta: -49.7MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB.
[2024-12-02 07:27:43,734 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 07:27:43,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.79ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 68.6MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-12-02 07:27:43,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.10ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 66.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 07:27:43,735 INFO L158 Benchmark]: Boogie Preprocessor took 42.84ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 63.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 07:27:43,736 INFO L158 Benchmark]: RCFGBuilder took 661.16ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 77.2MB in the end (delta: -13.3MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB.
[2024-12-02 07:27:43,736 INFO L158 Benchmark]: TraceAbstraction took 3962.20ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 76.6MB in the beginning and 153.7MB in the end (delta: -77.1MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB.
[2024-12-02 07:27:43,736 INFO L158 Benchmark]: Witness Printer took 134.41ms. Allocated memory is still 184.5MB. Free memory was 153.7MB in the beginning and 140.9MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-12-02 07:27:43,738 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 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 433.79ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 68.6MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 37.10ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 66.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 42.84ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 63.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 661.16ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 77.2MB in the end (delta: -13.3MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 3962.20ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 76.6MB in the beginning and 153.7MB in the end (delta: -77.1MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB.
* Witness Printer took 134.41ms. Allocated memory is still 184.5MB. Free memory was 153.7MB in the beginning and 140.9MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p1_EAX = 0;
[L715] 0 int __unbuffered_p1_EBX = 0;
[L716] 0 _Bool main$tmp_guard0;
[L717] 0 _Bool main$tmp_guard1;
[L719] 0 int x = 0;
[L720] 0 _Bool x$flush_delayed;
[L721] 0 int x$mem_tmp;
[L722] 0 _Bool x$r_buff0_thd0;
[L723] 0 _Bool x$r_buff0_thd1;
[L724] 0 _Bool x$r_buff0_thd2;
[L725] 0 _Bool x$r_buff1_thd0;
[L726] 0 _Bool x$r_buff1_thd1;
[L727] 0 _Bool x$r_buff1_thd2;
[L728] 0 _Bool x$read_delayed;
[L729] 0 int *x$read_delayed_var;
[L730] 0 int x$w_buff0;
[L731] 0 _Bool x$w_buff0_used;
[L732] 0 int x$w_buff1;
[L733] 0 _Bool x$w_buff1_used;
[L735] 0 int y = 0;
[L736] 0 _Bool weak$$choice0;
[L737] 0 _Bool weak$$choice2;
[L813] 0 pthread_t t1633;
[L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L815] 0 pthread_t t1634;
[L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L771] 2 x$w_buff1 = x$w_buff0
[L772] 2 x$w_buff0 = 1
[L773] 2 x$w_buff1_used = x$w_buff0_used
[L774] 2 x$w_buff0_used = (_Bool)1
[L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L779] 2 x$r_buff0_thd2 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L782] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L785] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L788] 2 __unbuffered_p1_EBX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L741] 1 y = 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L746] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L747] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L748] 1 x$flush_delayed = weak$$choice2
[L749] 1 x$mem_tmp = x
[L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757] 1 __unbuffered_p0_EAX = x
[L758] 1 x = x$flush_delayed ? x$mem_tmp : x
[L759] 1 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2]
[L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L820] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L820] RET 0 assume_abort_if_not(main$tmp_guard0)
[L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L831] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
[L19] 0 reach_error()
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2]
- UnprovableResult [Line: 19]: 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: 816]: 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: 814]: 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, 53 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: 3.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 12 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=5, InterpolantAutomatonStates: 30, 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, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 569 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, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-12-02 07:27:43,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd7438e7-e31c-40ed-ad2f-4c860aa6b113/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