./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe020_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:36:28,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:36:29,077 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:36:29,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:36:29,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:36:29,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:36:29,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:36:29,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:36:29,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:36:29,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:36:29,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:36:29,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:36:29,131 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:36:29,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:36:29,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:36:29,134 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:36:29,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:36:29,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:36:29,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:36:29,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:36:29,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:36:29,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:36:29,137 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:36:29,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:36:29,139 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:36:29,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:36:29,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:36:29,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:36:29,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:36:29,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:36:29,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:36:29,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:36:29,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:36:29,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:36:29,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:36:29,144 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:36:29,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:36:29,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:36:29,145 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:36:29,145 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf [2023-11-06 22:36:29,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:36:29,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:36:29,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:36:29,503 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:36:29,504 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:36:29,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2023-11-06 22:36:32,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:36:32,962 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:36:32,963 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2023-11-06 22:36:32,984 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/data/403bbd444/ce9a1ee262ce4749a86ea9d16fc26dc3/FLAG1d8def695 [2023-11-06 22:36:33,000 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/data/403bbd444/ce9a1ee262ce4749a86ea9d16fc26dc3 [2023-11-06 22:36:33,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:36:33,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:36:33,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:36:33,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:36:33,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:36:33,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:33,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292aecfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33, skipping insertion in model container [2023-11-06 22:36:33,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:33,101 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:36:33,362 WARN L240 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_680414b0-dc68-4fd6-95ae-a574bdd5eda7/sv-benchmarks/c/pthread-wmm/safe020_rmo.i[988,1001] [2023-11-06 22:36:33,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:36:33,750 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:36:33,765 WARN L240 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_680414b0-dc68-4fd6-95ae-a574bdd5eda7/sv-benchmarks/c/pthread-wmm/safe020_rmo.i[988,1001] [2023-11-06 22:36:33,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:36:33,917 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:36:33,917 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:36:33,926 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:36:33,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33 WrapperNode [2023-11-06 22:36:33,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:36:33,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:36:33,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:36:33,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:36:33,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,051 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2023-11-06 22:36:34,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:36:34,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:36:34,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:36:34,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:36:34,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:36:34,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:36:34,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:36:34,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:36:34,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (1/1) ... [2023-11-06 22:36:34,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:36:34,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:36:34,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:36:34,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:36:34,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:36:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:36:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:36:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:36:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:36:34,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:36:34,237 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:36:34,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:36:34,237 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:36:34,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:36:34,239 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:36:34,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:36:34,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:36:34,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:36:34,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:36:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:36:34,242 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:36:34,507 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:36:34,509 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:36:35,036 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:36:35,346 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:36:35,347 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:36:35,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:36:35 BoogieIcfgContainer [2023-11-06 22:36:35,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:36:35,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:36:35,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:36:35,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:36:35,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:36:33" (1/3) ... [2023-11-06 22:36:35,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307718ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:36:35, skipping insertion in model container [2023-11-06 22:36:35,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:33" (2/3) ... [2023-11-06 22:36:35,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307718ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:36:35, skipping insertion in model container [2023-11-06 22:36:35,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:36:35" (3/3) ... [2023-11-06 22:36:35,366 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2023-11-06 22:36:35,376 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:36:35,424 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:36:35,424 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:36:35,424 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:36:35,504 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:36:35,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 264 flow [2023-11-06 22:36:35,639 INFO L124 PetriNetUnfolderBase]: 2/123 cut-off events. [2023-11-06 22:36:35,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:36:35,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-11-06 22:36:35,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 264 flow [2023-11-06 22:36:35,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2023-11-06 22:36:35,658 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:36:35,673 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2023-11-06 22:36:35,676 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2023-11-06 22:36:35,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2023-11-06 22:36:35,725 INFO L124 PetriNetUnfolderBase]: 1/108 cut-off events. [2023-11-06 22:36:35,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:36:35,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-11-06 22:36:35,728 INFO L119 LiptonReduction]: Number of co-enabled transitions 1176 [2023-11-06 22:36:43,484 INFO L134 LiptonReduction]: Checked pairs total: 3337 [2023-11-06 22:36:43,485 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-11-06 22:36:43,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:36:43,508 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7f9d4a60, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:36:43,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 22:36:43,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:36:43,532 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-06 22:36:43,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:36:43,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:43,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:43,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:36:43,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash 502854789, now seen corresponding path program 1 times [2023-11-06 22:36:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067911895] [2023-11-06 22:36:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:36:43,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:43,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067911895] [2023-11-06 22:36:43,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067911895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:43,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:43,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:36:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833457582] [2023-11-06 22:36:43,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:43,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:36:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:36:43,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:36:43,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 217 [2023-11-06 22:36:43,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 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) [2023-11-06 22:36:43,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:43,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 217 [2023-11-06 22:36:43,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:44,386 INFO L124 PetriNetUnfolderBase]: 855/1292 cut-off events. [2023-11-06 22:36:44,387 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 22:36:44,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2619 conditions, 1292 events. 855/1292 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5368 event pairs, 855 based on Foata normal form. 64/1264 useless extension candidates. Maximal degree in co-relation 2608. Up to 1281 conditions per place. [2023-11-06 22:36:44,407 INFO L140 encePairwiseOnDemand]: 216/217 looper letters, 19 selfloop transitions, 0 changer transitions 1/21 dead transitions. [2023-11-06 22:36:44,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 91 flow [2023-11-06 22:36:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:36:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:36:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 249 transitions. [2023-11-06 22:36:44,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5737327188940092 [2023-11-06 22:36:44,431 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 249 transitions. [2023-11-06 22:36:44,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 249 transitions. [2023-11-06 22:36:44,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:44,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 249 transitions. [2023-11-06 22:36:44,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 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) [2023-11-06 22:36:44,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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) [2023-11-06 22:36:44,450 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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) [2023-11-06 22:36:44,452 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 249 transitions. [2023-11-06 22:36:44,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 91 flow [2023-11-06 22:36:44,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:36:44,459 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 46 flow [2023-11-06 22:36:44,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2023-11-06 22:36:44,465 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-11-06 22:36:44,466 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 46 flow [2023-11-06 22:36:44,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 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) [2023-11-06 22:36:44,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:44,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:44,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:36:44,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:36:44,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash 503164231, now seen corresponding path program 1 times [2023-11-06 22:36:44,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:44,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528680587] [2023-11-06 22:36:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:36:44,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528680587] [2023-11-06 22:36:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528680587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:36:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338579018] [2023-11-06 22:36:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:44,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:36:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:36:44,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:36:45,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-11-06 22:36:45,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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) [2023-11-06 22:36:45,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:45,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-11-06 22:36:45,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:45,536 INFO L124 PetriNetUnfolderBase]: 963/1468 cut-off events. [2023-11-06 22:36:45,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:36:45,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 1468 events. 963/1468 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6141 event pairs, 293 based on Foata normal form. 80/1548 useless extension candidates. Maximal degree in co-relation 2978. Up to 1213 conditions per place. [2023-11-06 22:36:45,549 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 29 selfloop transitions, 3 changer transitions 17/49 dead transitions. [2023-11-06 22:36:45,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 49 transitions, 206 flow [2023-11-06 22:36:45,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:36:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:36:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-11-06 22:36:45,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5493087557603686 [2023-11-06 22:36:45,558 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-11-06 22:36:45,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-11-06 22:36:45,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:45,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-11-06 22:36:45,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 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) [2023-11-06 22:36:45,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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) [2023-11-06 22:36:45,574 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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) [2023-11-06 22:36:45,575 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 46 flow. Second operand 5 states and 596 transitions. [2023-11-06 22:36:45,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 49 transitions, 206 flow [2023-11-06 22:36:45,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 49 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:36:45,578 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 73 flow [2023-11-06 22:36:45,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2023-11-06 22:36:45,586 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-11-06 22:36:45,586 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 73 flow [2023-11-06 22:36:45,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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) [2023-11-06 22:36:45,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:45,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:45,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:36:45,588 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:36:45,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:45,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1581797039, now seen corresponding path program 1 times [2023-11-06 22:36:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:45,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56486737] [2023-11-06 22:36:45,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:36:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56486737] [2023-11-06 22:36:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56486737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:46,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:46,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:36:46,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738259154] [2023-11-06 22:36:46,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:46,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:36:46,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:46,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:36:46,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:36:46,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 217 [2023-11-06 22:36:46,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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) [2023-11-06 22:36:46,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:46,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 217 [2023-11-06 22:36:46,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:46,451 INFO L124 PetriNetUnfolderBase]: 769/1230 cut-off events. [2023-11-06 22:36:46,451 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2023-11-06 22:36:46,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2974 conditions, 1230 events. 769/1230 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5242 event pairs, 199 based on Foata normal form. 60/1290 useless extension candidates. Maximal degree in co-relation 2967. Up to 831 conditions per place. [2023-11-06 22:36:46,462 INFO L140 encePairwiseOnDemand]: 213/217 looper letters, 26 selfloop transitions, 2 changer transitions 14/44 dead transitions. [2023-11-06 22:36:46,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 206 flow [2023-11-06 22:36:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:36:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:36:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-11-06 22:36:46,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5557603686635945 [2023-11-06 22:36:46,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-11-06 22:36:46,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-11-06 22:36:46,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:46,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-11-06 22:36:46,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 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) [2023-11-06 22:36:46,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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) [2023-11-06 22:36:46,473 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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) [2023-11-06 22:36:46,473 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 73 flow. Second operand 5 states and 603 transitions. [2023-11-06 22:36:46,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 206 flow [2023-11-06 22:36:46,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:36:46,480 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 80 flow [2023-11-06 22:36:46,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2023-11-06 22:36:46,481 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-11-06 22:36:46,482 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 80 flow [2023-11-06 22:36:46,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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) [2023-11-06 22:36:46,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:46,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:46,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:36:46,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:36:46,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -672059030, now seen corresponding path program 1 times [2023-11-06 22:36:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:46,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481989852] [2023-11-06 22:36:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:46,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:36:48,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:48,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481989852] [2023-11-06 22:36:48,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481989852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:48,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:48,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:36:48,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850804701] [2023-11-06 22:36:48,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:48,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:36:48,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:36:48,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:36:48,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2023-11-06 22:36:48,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 80 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 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) [2023-11-06 22:36:48,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:48,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2023-11-06 22:36:48,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:48,770 INFO L124 PetriNetUnfolderBase]: 706/1137 cut-off events. [2023-11-06 22:36:48,771 INFO L125 PetriNetUnfolderBase]: For 896/896 co-relation queries the response was YES. [2023-11-06 22:36:48,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1137 events. 706/1137 cut-off events. For 896/896 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4805 event pairs, 219 based on Foata normal form. 60/1197 useless extension candidates. Maximal degree in co-relation 2892. Up to 796 conditions per place. [2023-11-06 22:36:48,780 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 33 selfloop transitions, 4 changer transitions 14/53 dead transitions. [2023-11-06 22:36:48,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 269 flow [2023-11-06 22:36:48,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:36:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:36:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2023-11-06 22:36:48,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046082949308756 [2023-11-06 22:36:48,784 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2023-11-06 22:36:48,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2023-11-06 22:36:48,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:48,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2023-11-06 22:36:48,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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) [2023-11-06 22:36:48,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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) [2023-11-06 22:36:48,792 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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) [2023-11-06 22:36:48,792 INFO L175 Difference]: Start difference. First operand has 38 places, 22 transitions, 80 flow. Second operand 6 states and 657 transitions. [2023-11-06 22:36:48,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 269 flow [2023-11-06 22:36:48,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 259 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 22:36:48,799 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 98 flow [2023-11-06 22:36:48,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-11-06 22:36:48,801 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-11-06 22:36:48,801 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 98 flow [2023-11-06 22:36:48,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 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) [2023-11-06 22:36:48,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:48,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:48,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:36:48,803 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:36:48,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash 641316196, now seen corresponding path program 1 times [2023-11-06 22:36:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:48,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296177883] [2023-11-06 22:36:48,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:36:49,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:49,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296177883] [2023-11-06 22:36:49,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296177883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:49,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:49,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:36:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047824949] [2023-11-06 22:36:49,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:49,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:36:49,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:49,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:36:49,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:36:49,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 217 [2023-11-06 22:36:49,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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) [2023-11-06 22:36:49,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:49,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 217 [2023-11-06 22:36:49,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:49,292 INFO L124 PetriNetUnfolderBase]: 374/629 cut-off events. [2023-11-06 22:36:49,292 INFO L125 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2023-11-06 22:36:49,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 629 events. 374/629 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2439 event pairs, 105 based on Foata normal form. 27/650 useless extension candidates. Maximal degree in co-relation 1733. Up to 500 conditions per place. [2023-11-06 22:36:49,299 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 34 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-11-06 22:36:49,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 230 flow [2023-11-06 22:36:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:36:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:36:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-11-06 22:36:49,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5576036866359447 [2023-11-06 22:36:49,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-11-06 22:36:49,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-11-06 22:36:49,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:49,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-11-06 22:36:49,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2023-11-06 22:36:49,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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) [2023-11-06 22:36:49,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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) [2023-11-06 22:36:49,308 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 98 flow. Second operand 3 states and 363 transitions. [2023-11-06 22:36:49,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 230 flow [2023-11-06 22:36:49,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 221 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 22:36:49,315 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 117 flow [2023-11-06 22:36:49,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-11-06 22:36:49,317 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-11-06 22:36:49,317 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 117 flow [2023-11-06 22:36:49,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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) [2023-11-06 22:36:49,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:49,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:49,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:36:49,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:36:49,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash -319635126, now seen corresponding path program 1 times [2023-11-06 22:36:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346393530] [2023-11-06 22:36:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:49,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:36:49,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:49,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346393530] [2023-11-06 22:36:49,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346393530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:49,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:49,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:36:49,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214496623] [2023-11-06 22:36:49,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:49,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:36:49,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:49,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:36:49,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:36:49,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 217 [2023-11-06 22:36:49,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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) [2023-11-06 22:36:49,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:49,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 217 [2023-11-06 22:36:49,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:49,843 INFO L124 PetriNetUnfolderBase]: 178/335 cut-off events. [2023-11-06 22:36:49,843 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2023-11-06 22:36:49,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 335 events. 178/335 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1157 event pairs, 53 based on Foata normal form. 29/362 useless extension candidates. Maximal degree in co-relation 1009. Up to 111 conditions per place. [2023-11-06 22:36:49,847 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 42 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-11-06 22:36:49,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 302 flow [2023-11-06 22:36:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:36:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:36:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-11-06 22:36:49,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5576036866359447 [2023-11-06 22:36:49,851 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-11-06 22:36:49,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-11-06 22:36:49,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:49,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-11-06 22:36:49,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 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) [2023-11-06 22:36:49,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-11-06 22:36:49,856 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-11-06 22:36:49,856 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 117 flow. Second operand 4 states and 484 transitions. [2023-11-06 22:36:49,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 302 flow [2023-11-06 22:36:49,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:36:49,861 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 153 flow [2023-11-06 22:36:49,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-11-06 22:36:49,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-11-06 22:36:49,864 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 153 flow [2023-11-06 22:36:49,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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) [2023-11-06 22:36:49,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:49,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:49,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:36:49,865 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:36:49,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash 335760819, now seen corresponding path program 1 times [2023-11-06 22:36:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:49,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326260137] [2023-11-06 22:36:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:36:50,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:50,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326260137] [2023-11-06 22:36:50,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326260137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:50,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:50,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:36:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576600109] [2023-11-06 22:36:50,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:50,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:36:50,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:50,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:36:50,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:36:50,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 217 [2023-11-06 22:36:50,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 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) [2023-11-06 22:36:50,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:50,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 217 [2023-11-06 22:36:50,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:50,519 INFO L124 PetriNetUnfolderBase]: 141/262 cut-off events. [2023-11-06 22:36:50,519 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2023-11-06 22:36:50,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 262 events. 141/262 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 876 event pairs, 47 based on Foata normal form. 10/271 useless extension candidates. Maximal degree in co-relation 841. Up to 111 conditions per place. [2023-11-06 22:36:50,522 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 39 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2023-11-06 22:36:50,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 326 flow [2023-11-06 22:36:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:36:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:36:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-11-06 22:36:50,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5474654377880185 [2023-11-06 22:36:50,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-11-06 22:36:50,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-11-06 22:36:50,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:50,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-11-06 22:36:50,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-11-06 22:36:50,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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) [2023-11-06 22:36:50,533 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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) [2023-11-06 22:36:50,534 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 153 flow. Second operand 5 states and 594 transitions. [2023-11-06 22:36:50,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 326 flow [2023-11-06 22:36:50,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 285 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-11-06 22:36:50,537 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 150 flow [2023-11-06 22:36:50,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-11-06 22:36:50,538 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-11-06 22:36:50,538 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 150 flow [2023-11-06 22:36:50,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 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) [2023-11-06 22:36:50,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:50,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:50,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:36:50,540 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:36:50,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1952695875, now seen corresponding path program 1 times [2023-11-06 22:36:50,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:50,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717821771] [2023-11-06 22:36:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:50,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:36:50,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717821771] [2023-11-06 22:36:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717821771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:50,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:50,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:36:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336611663] [2023-11-06 22:36:50,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:50,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:36:50,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:50,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:36:50,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:36:50,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-11-06 22:36:50,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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) [2023-11-06 22:36:50,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:50,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-11-06 22:36:50,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:51,097 INFO L124 PetriNetUnfolderBase]: 198/362 cut-off events. [2023-11-06 22:36:51,098 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2023-11-06 22:36:51,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 362 events. 198/362 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1293 event pairs, 92 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 1143. Up to 252 conditions per place. [2023-11-06 22:36:51,105 INFO L140 encePairwiseOnDemand]: 213/217 looper letters, 33 selfloop transitions, 2 changer transitions 11/46 dead transitions. [2023-11-06 22:36:51,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 335 flow [2023-11-06 22:36:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:36:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:36:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-11-06 22:36:51,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5391705069124424 [2023-11-06 22:36:51,109 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-11-06 22:36:51,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-11-06 22:36:51,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:51,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-11-06 22:36:51,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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) [2023-11-06 22:36:51,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-11-06 22:36:51,116 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-11-06 22:36:51,116 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 150 flow. Second operand 4 states and 468 transitions. [2023-11-06 22:36:51,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 335 flow [2023-11-06 22:36:51,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 285 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-06 22:36:51,122 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 126 flow [2023-11-06 22:36:51,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-11-06 22:36:51,125 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2023-11-06 22:36:51,125 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 126 flow [2023-11-06 22:36:51,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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) [2023-11-06 22:36:51,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:51,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:51,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:36:51,127 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:36:51,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1343852823, now seen corresponding path program 2 times [2023-11-06 22:36:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:51,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191998881] [2023-11-06 22:36:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:36:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:54,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191998881] [2023-11-06 22:36:54,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191998881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:54,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:54,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:36:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613043059] [2023-11-06 22:36:54,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:54,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:36:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:54,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:36:54,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:36:54,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217 [2023-11-06 22:36:54,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 126 flow. Second operand has 11 states, 11 states have (on average 103.72727272727273) internal successors, (1141), 11 states have internal predecessors, (1141), 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) [2023-11-06 22:36:54,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:54,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217 [2023-11-06 22:36:54,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:55,371 INFO L124 PetriNetUnfolderBase]: 124/264 cut-off events. [2023-11-06 22:36:55,372 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-06 22:36:55,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 264 events. 124/264 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 995 event pairs, 14 based on Foata normal form. 2/266 useless extension candidates. Maximal degree in co-relation 832. Up to 85 conditions per place. [2023-11-06 22:36:55,373 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 28 selfloop transitions, 4 changer transitions 39/72 dead transitions. [2023-11-06 22:36:55,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 466 flow [2023-11-06 22:36:55,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:36:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:36:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1072 transitions. [2023-11-06 22:36:55,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49400921658986174 [2023-11-06 22:36:55,379 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1072 transitions. [2023-11-06 22:36:55,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1072 transitions. [2023-11-06 22:36:55,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:55,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1072 transitions. [2023-11-06 22:36:55,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.2) internal successors, (1072), 10 states have internal predecessors, (1072), 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) [2023-11-06 22:36:55,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 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) [2023-11-06 22:36:55,389 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 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) [2023-11-06 22:36:55,389 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 126 flow. Second operand 10 states and 1072 transitions. [2023-11-06 22:36:55,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 466 flow [2023-11-06 22:36:55,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 441 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-06 22:36:55,392 INFO L231 Difference]: Finished difference. Result has 51 places, 26 transitions, 122 flow [2023-11-06 22:36:55,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=122, PETRI_PLACES=51, PETRI_TRANSITIONS=26} [2023-11-06 22:36:55,393 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-11-06 22:36:55,394 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 26 transitions, 122 flow [2023-11-06 22:36:55,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.72727272727273) internal successors, (1141), 11 states have internal predecessors, (1141), 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) [2023-11-06 22:36:55,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:55,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:55,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:36:55,411 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:36:55,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash -809392325, now seen corresponding path program 3 times [2023-11-06 22:36:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797237223] [2023-11-06 22:36:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:36:55,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:36:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:36:55,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:36:55,731 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:36:55,732 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-06 22:36:55,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-06 22:36:55,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-06 22:36:55,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-06 22:36:55,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:36:55,736 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:55,742 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:36:55,742 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:36:55,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:36:55 BasicIcfg [2023-11-06 22:36:55,898 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:36:55,899 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:36:55,899 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:36:55,899 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:36:55,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:36:35" (3/4) ... [2023-11-06 22:36:55,900 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:36:56,051 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:36:56,051 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:36:56,052 INFO L158 Benchmark]: Toolchain (without parser) took 23047.11ms. Allocated memory was 136.3MB in the beginning and 394.3MB in the end (delta: 257.9MB). Free memory was 97.0MB in the beginning and 287.1MB in the end (delta: -190.1MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2023-11-06 22:36:56,052 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 136.3MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:36:56,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 921.76ms. Allocated memory is still 136.3MB. Free memory was 96.9MB in the beginning and 72.3MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:36:56,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.89ms. Allocated memory is still 136.3MB. Free memory was 72.3MB in the beginning and 69.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:36:56,053 INFO L158 Benchmark]: Boogie Preprocessor took 83.41ms. Allocated memory is still 136.3MB. Free memory was 69.6MB in the beginning and 67.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:36:56,053 INFO L158 Benchmark]: RCFGBuilder took 1215.60ms. Allocated memory is still 136.3MB. Free memory was 67.5MB in the beginning and 46.5MB in the end (delta: 21.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:36:56,054 INFO L158 Benchmark]: TraceAbstraction took 20542.96ms. Allocated memory was 136.3MB in the beginning and 394.3MB in the end (delta: 257.9MB). Free memory was 45.9MB in the beginning and 301.9MB in the end (delta: -256.0MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2023-11-06 22:36:56,055 INFO L158 Benchmark]: Witness Printer took 152.44ms. Allocated memory is still 394.3MB. Free memory was 301.9MB in the beginning and 287.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:36:56,057 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.20ms. Allocated memory is still 136.3MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 921.76ms. Allocated memory is still 136.3MB. Free memory was 96.9MB in the beginning and 72.3MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.89ms. Allocated memory is still 136.3MB. Free memory was 72.3MB in the beginning and 69.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.41ms. Allocated memory is still 136.3MB. Free memory was 69.6MB in the beginning and 67.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1215.60ms. Allocated memory is still 136.3MB. Free memory was 67.5MB in the beginning and 46.5MB in the end (delta: 21.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20542.96ms. Allocated memory was 136.3MB in the beginning and 394.3MB in the end (delta: 257.9MB). Free memory was 45.9MB in the beginning and 301.9MB in the end (delta: -256.0MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. * Witness Printer took 152.44ms. Allocated memory is still 394.3MB. Free memory was 301.9MB in the beginning and 287.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 117 PlacesBefore, 31 PlacesAfterwards, 108 TransitionsBefore, 22 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, 3337 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1219, independent: 1045, independent conditional: 0, independent unconditional: 1045, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 606, independent: 568, independent conditional: 0, independent unconditional: 568, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1219, independent: 477, independent conditional: 0, independent unconditional: 477, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 606, unknown conditional: 0, unknown unconditional: 606] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269, ((void *)0), P0, ((void *)0))=0, t2269={7:0}, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270, ((void *)0), P1, ((void *)0))=1, t2269={7:0}, t2270={8:0}, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2271, ((void *)0), P2, ((void *)0))=2, t2269={7:0}, t2270={8:0}, t2271={5:0}, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !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) [L768] EXPR 1 \read(x) [L768] EXPR 1 !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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 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 = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 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 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269={7:0}, t2270={8:0}, t2271={5:0}, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] - UnprovableResult [Line: 854]: 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: 850]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 4 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: 20.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 433 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 428 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 367 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1144 IncrementalHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 61 mSDtfsCounter, 1144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=6, InterpolantAutomatonStates: 44, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 1118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:36:56,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_680414b0-dc68-4fd6-95ae-a574bdd5eda7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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