./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/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_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/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_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/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 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:07:38,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:07:38,842 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:07:38,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:07:38,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:07:38,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:07:38,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:07:38,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:07:38,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:07:38,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:07:38,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:07:38,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:07:38,904 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:07:38,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:07:38,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:07:38,907 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:07:38,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:07:38,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:07:38,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:07:38,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:07:38,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:07:38,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:07:38,910 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:07:38,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:07:38,911 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:07:38,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:07:38,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:07:38,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:07:38,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:38,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:07:38,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:07:38,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:07:38,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:07:38,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:07:38,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:07:38,916 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:07:38,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:07:38,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:07:38,917 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:07:38,917 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_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/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_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/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 -> 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b [2023-11-06 23:07:39,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:07:39,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:07:39,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:07:39,275 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:07:39,275 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:07:39,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2023-11-06 23:07:42,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:07:42,752 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:07:42,752 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2023-11-06 23:07:42,769 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/data/818dd5669/2b8d60412156480381c88000a508d6cf/FLAG8b0d097d6 [2023-11-06 23:07:42,788 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/data/818dd5669/2b8d60412156480381c88000a508d6cf [2023-11-06 23:07:42,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:07:42,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:07:42,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:42,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:07:42,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:07:42,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:42" (1/1) ... [2023-11-06 23:07:42,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7581eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:42, skipping insertion in model container [2023-11-06 23:07:42,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:42" (1/1) ... [2023-11-06 23:07:42,883 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:07:43,088 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_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i[995,1008] [2023-11-06 23:07:43,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:43,363 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:07:43,378 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_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i[995,1008] [2023-11-06 23:07:43,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:43,491 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:07:43,491 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:07:43,499 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:07:43,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43 WrapperNode [2023-11-06 23:07:43,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:43,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:43,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:07:43,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:07:43,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,557 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2023-11-06 23:07:43,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:43,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:07:43,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:07:43,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:07:43,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:07:43,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:07:43,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:07:43,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:07:43,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (1/1) ... [2023-11-06 23:07:43,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:43,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:07:43,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:07:43,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:07:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:07:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:07:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:07:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:07:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:07:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:07:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:07:43,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:07:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:07:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:07:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:07:43,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:07:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:07:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:07:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:07:43,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:07:43,710 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 23:07:43,879 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:07:43,882 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:07:44,328 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:07:44,716 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:07:44,717 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:07:44,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:44 BoogieIcfgContainer [2023-11-06 23:07:44,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:07:44,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:07:44,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:07:44,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:07:44,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:07:42" (1/3) ... [2023-11-06 23:07:44,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db6f4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:44, skipping insertion in model container [2023-11-06 23:07:44,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:43" (2/3) ... [2023-11-06 23:07:44,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db6f4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:44, skipping insertion in model container [2023-11-06 23:07:44,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:44" (3/3) ... [2023-11-06 23:07:44,735 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i [2023-11-06 23:07:44,742 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 23:07:44,750 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:07:44,750 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:07:44,751 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:07:44,826 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:07:44,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 266 flow [2023-11-06 23:07:44,964 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-11-06 23:07:44,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:44,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 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/121 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-11-06 23:07:44,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 266 flow [2023-11-06 23:07:44,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2023-11-06 23:07:44,982 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:07:45,005 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2023-11-06 23:07:45,008 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2023-11-06 23:07:45,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2023-11-06 23:07:45,070 INFO L124 PetriNetUnfolderBase]: 1/109 cut-off events. [2023-11-06 23:07:45,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:45,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 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/108 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-11-06 23:07:45,075 INFO L119 LiptonReduction]: Number of co-enabled transitions 1176 [2023-11-06 23:07:54,318 INFO L134 LiptonReduction]: Checked pairs total: 3232 [2023-11-06 23:07:54,319 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-11-06 23:07:54,334 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:07:54,341 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;@475ce15c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:07:54,341 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 23:07:54,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:07:54,350 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-06 23:07:54,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:54,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:54,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:54,352 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 23:07:54,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1760499900, now seen corresponding path program 1 times [2023-11-06 23:07:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:54,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464142104] [2023-11-06 23:07:54,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:54,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:55,067 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 23:07:55,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464142104] [2023-11-06 23:07:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464142104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:55,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:55,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:07:55,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275792880] [2023-11-06 23:07:55,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:55,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:07:55,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:55,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:07:55,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:07:55,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 219 [2023-11-06 23:07:55,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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 23:07:55,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:55,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 219 [2023-11-06 23:07:55,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:55,552 INFO L124 PetriNetUnfolderBase]: 449/757 cut-off events. [2023-11-06 23:07:55,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:55,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 757 events. 449/757 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3671 event pairs, 104 based on Foata normal form. 72/789 useless extension candidates. Maximal degree in co-relation 1485. Up to 496 conditions per place. [2023-11-06 23:07:55,562 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 21 selfloop transitions, 2 changer transitions 14/40 dead transitions. [2023-11-06 23:07:55,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 163 flow [2023-11-06 23:07:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:07:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:07:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2023-11-06 23:07:55,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5534246575342465 [2023-11-06 23:07:55,585 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2023-11-06 23:07:55,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2023-11-06 23:07:55,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:55,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2023-11-06 23:07:55,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 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 23:07:55,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 23:07:55,609 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 23:07:55,611 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 5 states and 606 transitions. [2023-11-06 23:07:55,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 163 flow [2023-11-06 23:07:55,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:07:55,618 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 58 flow [2023-11-06 23:07:55,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-11-06 23:07:55,624 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-11-06 23:07:55,625 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 58 flow [2023-11-06 23:07:55,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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 23:07:55,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:55,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:55,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:07:55,627 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 23:07:55,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1259075462, now seen corresponding path program 1 times [2023-11-06 23:07:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:55,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77992212] [2023-11-06 23:07:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:55,981 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 23:07:55,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77992212] [2023-11-06 23:07:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77992212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:55,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:55,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155917294] [2023-11-06 23:07:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:55,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:55,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:56,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 219 [2023-11-06 23:07:56,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 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 23:07:56,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:56,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 219 [2023-11-06 23:07:56,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:56,499 INFO L124 PetriNetUnfolderBase]: 621/1001 cut-off events. [2023-11-06 23:07:56,499 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-11-06 23:07:56,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 1001 events. 621/1001 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4931 event pairs, 84 based on Foata normal form. 36/1033 useless extension candidates. Maximal degree in co-relation 2183. Up to 406 conditions per place. [2023-11-06 23:07:56,509 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 27 selfloop transitions, 3 changer transitions 18/50 dead transitions. [2023-11-06 23:07:56,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 223 flow [2023-11-06 23:07:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 710 transitions. [2023-11-06 23:07:56,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5403348554033486 [2023-11-06 23:07:56,517 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 710 transitions. [2023-11-06 23:07:56,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 710 transitions. [2023-11-06 23:07:56,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:56,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 710 transitions. [2023-11-06 23:07:56,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 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 23:07:56,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 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 23:07:56,532 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 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 23:07:56,534 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 58 flow. Second operand 6 states and 710 transitions. [2023-11-06 23:07:56,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 223 flow [2023-11-06 23:07:56,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 213 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 23:07:56,541 INFO L231 Difference]: Finished difference. Result has 37 places, 20 transitions, 68 flow [2023-11-06 23:07:56,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=20} [2023-11-06 23:07:56,547 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-11-06 23:07:56,547 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 68 flow [2023-11-06 23:07:56,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 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 23:07:56,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:56,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:56,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:07:56,549 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 23:07:56,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 376869500, now seen corresponding path program 1 times [2023-11-06 23:07:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:56,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164704227] [2023-11-06 23:07:56,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:56,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:56,757 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 23:07:56,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:56,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164704227] [2023-11-06 23:07:56,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164704227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:56,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:56,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:56,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146524945] [2023-11-06 23:07:56,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:56,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:07:56,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:56,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:07:56,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:07:56,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 219 [2023-11-06 23:07:56,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 20 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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 23:07:56,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:56,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 219 [2023-11-06 23:07:56,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:57,098 INFO L124 PetriNetUnfolderBase]: 342/563 cut-off events. [2023-11-06 23:07:57,098 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2023-11-06 23:07:57,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 563 events. 342/563 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2335 event pairs, 212 based on Foata normal form. 27/589 useless extension candidates. Maximal degree in co-relation 1370. Up to 391 conditions per place. [2023-11-06 23:07:57,103 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 25 selfloop transitions, 2 changer transitions 11/40 dead transitions. [2023-11-06 23:07:57,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 196 flow [2023-11-06 23:07:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:07:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:07:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-11-06 23:07:57,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.547945205479452 [2023-11-06 23:07:57,107 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-11-06 23:07:57,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-11-06 23:07:57,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:57,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-11-06 23:07:57,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 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 23:07:57,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 23:07:57,115 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 23:07:57,116 INFO L175 Difference]: Start difference. First operand has 37 places, 20 transitions, 68 flow. Second operand 5 states and 600 transitions. [2023-11-06 23:07:57,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 196 flow [2023-11-06 23:07:57,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 174 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-06 23:07:57,119 INFO L231 Difference]: Finished difference. Result has 36 places, 20 transitions, 64 flow [2023-11-06 23:07:57,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=20} [2023-11-06 23:07:57,120 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-11-06 23:07:57,121 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 64 flow [2023-11-06 23:07:57,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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 23:07:57,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:57,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:57,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:07:57,122 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 23:07:57,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash 267928674, now seen corresponding path program 1 times [2023-11-06 23:07:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255540603] [2023-11-06 23:07:57,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:57,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:57,285 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 23:07:57,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:57,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255540603] [2023-11-06 23:07:57,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255540603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:57,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:57,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:07:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876477995] [2023-11-06 23:07:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:57,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:57,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 219 [2023-11-06 23:07:57,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 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 23:07:57,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:57,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 219 [2023-11-06 23:07:57,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:57,687 INFO L124 PetriNetUnfolderBase]: 420/704 cut-off events. [2023-11-06 23:07:57,688 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2023-11-06 23:07:57,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 704 events. 420/704 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3266 event pairs, 221 based on Foata normal form. 18/721 useless extension candidates. Maximal degree in co-relation 1655. Up to 364 conditions per place. [2023-11-06 23:07:57,693 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 22 selfloop transitions, 2 changer transitions 21/47 dead transitions. [2023-11-06 23:07:57,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 219 flow [2023-11-06 23:07:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2023-11-06 23:07:57,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372907153729072 [2023-11-06 23:07:57,697 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 706 transitions. [2023-11-06 23:07:57,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 706 transitions. [2023-11-06 23:07:57,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:57,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 706 transitions. [2023-11-06 23:07:57,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 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 23:07:57,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 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 23:07:57,706 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 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 23:07:57,706 INFO L175 Difference]: Start difference. First operand has 36 places, 20 transitions, 64 flow. Second operand 6 states and 706 transitions. [2023-11-06 23:07:57,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 219 flow [2023-11-06 23:07:57,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 209 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 23:07:57,710 INFO L231 Difference]: Finished difference. Result has 38 places, 20 transitions, 68 flow [2023-11-06 23:07:57,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=20} [2023-11-06 23:07:57,711 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-11-06 23:07:57,711 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 20 transitions, 68 flow [2023-11-06 23:07:57,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 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 23:07:57,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:57,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:57,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:07:57,713 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 23:07:57,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1766851136, now seen corresponding path program 2 times [2023-11-06 23:07:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639247016] [2023-11-06 23:07:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:57,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:57,944 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 23:07:57,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:57,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639247016] [2023-11-06 23:07:57,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639247016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:57,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:57,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:07:57,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532283032] [2023-11-06 23:07:57,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:57,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:07:57,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:57,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:07:57,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:07:57,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 219 [2023-11-06 23:07:57,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 20 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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 23:07:57,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:57,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 219 [2023-11-06 23:07:57,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:58,161 INFO L124 PetriNetUnfolderBase]: 216/410 cut-off events. [2023-11-06 23:07:58,162 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2023-11-06 23:07:58,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 410 events. 216/410 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1860 event pairs, 41 based on Foata normal form. 18/425 useless extension candidates. Maximal degree in co-relation 929. Up to 261 conditions per place. [2023-11-06 23:07:58,166 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 26 selfloop transitions, 2 changer transitions 9/40 dead transitions. [2023-11-06 23:07:58,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 201 flow [2023-11-06 23:07:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:07:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:07:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-11-06 23:07:58,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5607305936073059 [2023-11-06 23:07:58,170 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-11-06 23:07:58,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-11-06 23:07:58,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:58,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-11-06 23:07:58,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 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 23:07:58,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 23:07:58,177 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 23:07:58,177 INFO L175 Difference]: Start difference. First operand has 38 places, 20 transitions, 68 flow. Second operand 5 states and 614 transitions. [2023-11-06 23:07:58,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 201 flow [2023-11-06 23:07:58,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 182 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-06 23:07:58,180 INFO L231 Difference]: Finished difference. Result has 37 places, 20 transitions, 68 flow [2023-11-06 23:07:58,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=20} [2023-11-06 23:07:58,181 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-11-06 23:07:58,181 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 68 flow [2023-11-06 23:07:58,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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 23:07:58,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:58,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:58,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:07:58,183 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 23:07:58,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1567686625, now seen corresponding path program 1 times [2023-11-06 23:07:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:58,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589626045] [2023-11-06 23:07:58,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:58,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:00,044 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 23:08:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:00,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589626045] [2023-11-06 23:08:00,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589626045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:00,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:00,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:00,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409508215] [2023-11-06 23:08:00,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:00,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:08:00,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:00,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:08:00,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:08:00,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 219 [2023-11-06 23:08:00,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 20 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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 23:08:00,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:00,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 219 [2023-11-06 23:08:00,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:00,507 INFO L124 PetriNetUnfolderBase]: 322/558 cut-off events. [2023-11-06 23:08:00,507 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2023-11-06 23:08:00,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 558 events. 322/558 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2406 event pairs, 55 based on Foata normal form. 16/573 useless extension candidates. Maximal degree in co-relation 1376. Up to 238 conditions per place. [2023-11-06 23:08:00,513 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 30 selfloop transitions, 6 changer transitions 8/46 dead transitions. [2023-11-06 23:08:00,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 233 flow [2023-11-06 23:08:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:08:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 676 transitions. [2023-11-06 23:08:00,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144596651445966 [2023-11-06 23:08:00,517 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 676 transitions. [2023-11-06 23:08:00,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 676 transitions. [2023-11-06 23:08:00,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:00,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 676 transitions. [2023-11-06 23:08:00,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 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 23:08:00,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 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 23:08:00,524 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 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 23:08:00,524 INFO L175 Difference]: Start difference. First operand has 37 places, 20 transitions, 68 flow. Second operand 6 states and 676 transitions. [2023-11-06 23:08:00,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 233 flow [2023-11-06 23:08:00,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 219 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-06 23:08:00,527 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 102 flow [2023-11-06 23:08:00,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-11-06 23:08:00,528 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-11-06 23:08:00,529 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 102 flow [2023-11-06 23:08:00,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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 23:08:00,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:00,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:00,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:08:00,530 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 23:08:00,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:00,531 INFO L85 PathProgramCache]: Analyzing trace with hash 463529533, now seen corresponding path program 2 times [2023-11-06 23:08:00,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:00,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947152170] [2023-11-06 23:08:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:00,763 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 23:08:00,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947152170] [2023-11-06 23:08:00,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947152170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:00,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:00,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:08:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908885181] [2023-11-06 23:08:00,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:00,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:08:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:00,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:08:00,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:00,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 219 [2023-11-06 23:08:00,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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 23:08:00,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:00,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 219 [2023-11-06 23:08:00,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:00,913 INFO L124 PetriNetUnfolderBase]: 193/365 cut-off events. [2023-11-06 23:08:00,913 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2023-11-06 23:08:00,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 365 events. 193/365 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1466 event pairs, 65 based on Foata normal form. 11/373 useless extension candidates. Maximal degree in co-relation 1005. Up to 309 conditions per place. [2023-11-06 23:08:00,917 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 29 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-11-06 23:08:00,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 222 flow [2023-11-06 23:08:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:08:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-06 23:08:00,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5601217656012176 [2023-11-06 23:08:00,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-06 23:08:00,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-06 23:08:00,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:00,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-06 23:08:00,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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 23:08:00,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 23:08:00,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 23:08:00,924 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 102 flow. Second operand 3 states and 368 transitions. [2023-11-06 23:08:00,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 222 flow [2023-11-06 23:08:00,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 215 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 23:08:00,927 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 121 flow [2023-11-06 23:08:00,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=121, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-11-06 23:08:00,928 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-11-06 23:08:00,928 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 121 flow [2023-11-06 23:08:00,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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 23:08:00,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:00,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:00,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:08:00,929 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 23:08:00,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:00,930 INFO L85 PathProgramCache]: Analyzing trace with hash 975998424, now seen corresponding path program 1 times [2023-11-06 23:08:00,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:00,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088233090] [2023-11-06 23:08:00,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:00,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:01,159 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 23:08:01,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:01,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088233090] [2023-11-06 23:08:01,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088233090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:01,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:01,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:01,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596160749] [2023-11-06 23:08:01,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:01,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:01,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:01,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:01,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:01,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 219 [2023-11-06 23:08:01,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 23:08:01,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:01,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 219 [2023-11-06 23:08:01,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:01,323 INFO L124 PetriNetUnfolderBase]: 102/222 cut-off events. [2023-11-06 23:08:01,323 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-06 23:08:01,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 222 events. 102/222 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 820 event pairs, 15 based on Foata normal form. 18/237 useless extension candidates. Maximal degree in co-relation 738. Up to 95 conditions per place. [2023-11-06 23:08:01,326 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 35 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2023-11-06 23:08:01,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 292 flow [2023-11-06 23:08:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:08:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-11-06 23:08:01,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5582191780821918 [2023-11-06 23:08:01,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-11-06 23:08:01,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-11-06 23:08:01,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:01,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-11-06 23:08:01,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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 23:08:01,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 23:08:01,334 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 23:08:01,334 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 121 flow. Second operand 4 states and 489 transitions. [2023-11-06 23:08:01,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 292 flow [2023-11-06 23:08:01,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:08:01,337 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 157 flow [2023-11-06 23:08:01,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=157, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-11-06 23:08:01,338 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-11-06 23:08:01,338 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 157 flow [2023-11-06 23:08:01,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 23:08:01,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:01,339 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 23:08:01,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:08:01,340 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 23:08:01,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1217386824, now seen corresponding path program 1 times [2023-11-06 23:08:01,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:01,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977471389] [2023-11-06 23:08:01,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:01,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:01,541 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 23:08:01,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:01,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977471389] [2023-11-06 23:08:01,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977471389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:01,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:01,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:01,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340955001] [2023-11-06 23:08:01,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:01,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:01,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:01,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:01,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:01,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 219 [2023-11-06 23:08:01,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 157 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 23:08:01,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:01,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 219 [2023-11-06 23:08:01,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:01,782 INFO L124 PetriNetUnfolderBase]: 240/485 cut-off events. [2023-11-06 23:08:01,782 INFO L125 PetriNetUnfolderBase]: For 738/738 co-relation queries the response was YES. [2023-11-06 23:08:01,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 485 events. 240/485 cut-off events. For 738/738 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2081 event pairs, 114 based on Foata normal form. 6/490 useless extension candidates. Maximal degree in co-relation 1726. Up to 280 conditions per place. [2023-11-06 23:08:01,787 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 31 selfloop transitions, 2 changer transitions 27/62 dead transitions. [2023-11-06 23:08:01,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 449 flow [2023-11-06 23:08:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:08:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 703 transitions. [2023-11-06 23:08:01,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5350076103500762 [2023-11-06 23:08:01,791 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 703 transitions. [2023-11-06 23:08:01,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 703 transitions. [2023-11-06 23:08:01,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:01,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 703 transitions. [2023-11-06 23:08:01,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 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 23:08:01,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 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 23:08:01,798 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 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 23:08:01,798 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 157 flow. Second operand 6 states and 703 transitions. [2023-11-06 23:08:01,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 449 flow [2023-11-06 23:08:01,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 421 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-06 23:08:01,802 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 155 flow [2023-11-06 23:08:01,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=143, 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=6, PETRI_FLOW=155, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-11-06 23:08:01,803 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-11-06 23:08:01,803 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 155 flow [2023-11-06 23:08:01,804 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 23:08:01,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:01,804 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 23:08:01,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:08:01,805 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 23:08:01,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1961922410, now seen corresponding path program 2 times [2023-11-06 23:08:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:01,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602122737] [2023-11-06 23:08:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:01,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:02,074 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 23:08:02,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:02,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602122737] [2023-11-06 23:08:02,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602122737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:02,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:02,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:02,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693477677] [2023-11-06 23:08:02,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:02,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:02,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:02,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:02,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:02,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 219 [2023-11-06 23:08:02,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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 23:08:02,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:02,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 219 [2023-11-06 23:08:02,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:02,238 INFO L124 PetriNetUnfolderBase]: 91/206 cut-off events. [2023-11-06 23:08:02,239 INFO L125 PetriNetUnfolderBase]: For 366/376 co-relation queries the response was YES. [2023-11-06 23:08:02,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 206 events. 91/206 cut-off events. For 366/376 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 845 event pairs, 17 based on Foata normal form. 15/210 useless extension candidates. Maximal degree in co-relation 752. Up to 88 conditions per place. [2023-11-06 23:08:02,242 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 32 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2023-11-06 23:08:02,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 317 flow [2023-11-06 23:08:02,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-11-06 23:08:02,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5497716894977169 [2023-11-06 23:08:02,246 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-11-06 23:08:02,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-11-06 23:08:02,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:02,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-11-06 23:08:02,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 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 23:08:02,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 23:08:02,252 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 23:08:02,252 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 155 flow. Second operand 5 states and 602 transitions. [2023-11-06 23:08:02,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 317 flow [2023-11-06 23:08:02,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 291 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-06 23:08:02,255 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 164 flow [2023-11-06 23:08:02,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=164, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-06 23:08:02,256 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-11-06 23:08:02,257 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 164 flow [2023-11-06 23:08:02,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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 23:08:02,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:02,257 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 23:08:02,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:08:02,258 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 23:08:02,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:02,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1135615783, now seen corresponding path program 1 times [2023-11-06 23:08:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:02,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142636617] [2023-11-06 23:08:02,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:02,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:08:02,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:08:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:08:02,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:08:02,427 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:08:02,429 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-06 23:08:02,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-06 23:08:02,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-06 23:08:02,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-06 23:08:02,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:08:02,432 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2023-11-06 23:08:02,438 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:08:02,438 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:08:02,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:08:02 BasicIcfg [2023-11-06 23:08:02,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:08:02,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:08:02,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:08:02,546 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:08:02,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:44" (3/4) ... [2023-11-06 23:08:02,547 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 23:08:02,647 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:08:02,648 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:08:02,649 INFO L158 Benchmark]: Toolchain (without parser) took 19849.87ms. Allocated memory was 167.8MB in the beginning and 337.6MB in the end (delta: 169.9MB). Free memory was 121.5MB in the beginning and 155.4MB in the end (delta: -33.9MB). Peak memory consumption was 137.0MB. Max. memory is 16.1GB. [2023-11-06 23:08:02,649 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 167.8MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:08:02,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 696.28ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 97.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 23:08:02,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.35ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 95.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:08:02,650 INFO L158 Benchmark]: Boogie Preprocessor took 46.38ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 92.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:08:02,651 INFO L158 Benchmark]: RCFGBuilder took 1116.86ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 108.9MB in the end (delta: -16.1MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2023-11-06 23:08:02,651 INFO L158 Benchmark]: TraceAbstraction took 17819.17ms. Allocated memory was 167.8MB in the beginning and 337.6MB in the end (delta: 169.9MB). Free memory was 108.6MB in the beginning and 169.1MB in the end (delta: -60.5MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. [2023-11-06 23:08:02,651 INFO L158 Benchmark]: Witness Printer took 102.56ms. Allocated memory is still 337.6MB. Free memory was 169.1MB in the beginning and 155.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:08:02,653 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.29ms. Allocated memory is still 167.8MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 696.28ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 97.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.35ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 95.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.38ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 92.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1116.86ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 108.9MB in the end (delta: -16.1MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17819.17ms. Allocated memory was 167.8MB in the beginning and 337.6MB in the end (delta: 169.9MB). Free memory was 108.6MB in the beginning and 169.1MB in the end (delta: -60.5MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. * Witness Printer took 102.56ms. Allocated memory is still 337.6MB. Free memory was 169.1MB in the beginning and 155.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 118 PlacesBefore, 31 PlacesAfterwards, 109 TransitionsBefore, 22 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 3232 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1550, independent: 1381, independent conditional: 0, independent unconditional: 1381, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 621, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1550, independent: 789, independent conditional: 0, independent unconditional: 789, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 621, unknown conditional: 0, unknown unconditional: 621] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L835] 0 pthread_t t2097; [L836] FCALL, FORK 0 pthread_create(&t2097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2097, ((void *)0), P0, ((void *)0))=-2, t2097={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 0 pthread_t t2098; [L838] FCALL, FORK 0 pthread_create(&t2098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2098, ((void *)0), P1, ((void *)0))=-1, t2097={7:0}, t2098={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 0 pthread_t t2099; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L840] FCALL, FORK 0 pthread_create(&t2099, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, pthread_create(&t2099, ((void *)0), P2, ((void *)0))=0, t2097={7:0}, t2098={8:0}, t2099={5:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L810] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] 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$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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, t2097={7:0}, t2098={8:0}, t2099={5:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L857] 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$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice0=6, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 840]: 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: 838]: 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: 836]: 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, 151 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: 17.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 274 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 965 IncrementalHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 61 mSDtfsCounter, 965 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=10, InterpolantAutomatonStates: 51, 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.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 597 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 23:08:02,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c98be6df-13d7-4643-b3a3-e39be7cc3c2b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE