./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/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_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/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_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/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 e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:30:56,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:30:56,966 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:30:56,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:30:56,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:30:57,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:30:57,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:30:57,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:30:57,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:30:57,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:30:57,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:30:57,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:30:57,037 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:30:57,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:30:57,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:30:57,041 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:30:57,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:30:57,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:30:57,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:30:57,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:30:57,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:30:57,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:30:57,045 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:30:57,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:30:57,047 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:30:57,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:30:57,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:30:57,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:30:57,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:30:57,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:30:57,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:30:57,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:30:57,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:30:57,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:30:57,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:30:57,055 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:30:57,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:30:57,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:30:57,056 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:30:57,056 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_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/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_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/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 -> e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 [2023-11-06 22:30:57,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:30:57,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:30:57,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:30:57,484 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:30:57,484 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:30:57,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2023-11-06 22:31:00,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:31:01,387 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:31:01,388 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2023-11-06 22:31:01,414 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/data/94ad9c43e/9a24f6d39c8b409b9a7281e440ce4bb7/FLAG43ada934f [2023-11-06 22:31:01,450 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/data/94ad9c43e/9a24f6d39c8b409b9a7281e440ce4bb7 [2023-11-06 22:31:01,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:31:01,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:31:01,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:31:01,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:31:01,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:31:01,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:01" (1/1) ... [2023-11-06 22:31:01,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b6e53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:01, skipping insertion in model container [2023-11-06 22:31:01,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:01" (1/1) ... [2023-11-06 22:31:01,575 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:31:01,785 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_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958] [2023-11-06 22:31:02,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:31:02,078 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:31:02,093 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_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958] [2023-11-06 22:31:02,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:31:02,248 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:31:02,249 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:31:02,258 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:31:02,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02 WrapperNode [2023-11-06 22:31:02,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:31:02,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:31:02,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:31:02,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:31:02,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,339 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-11-06 22:31:02,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:31:02,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:31:02,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:31:02,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:31:02,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:31:02,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:31:02,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:31:02,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:31:02,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (1/1) ... [2023-11-06 22:31:02,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:31:02,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:02,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:31:02,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:31:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:31:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:31:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:31:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:31:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:31:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:31:02,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:31:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:31:02,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:31:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:31:02,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:31:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:31:02,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:31:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:31:02,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:31:02,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:31:02,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:31:02,516 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:31:02,834 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:31:02,839 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:31:03,322 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:31:03,605 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:31:03,605 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:31:03,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:03 BoogieIcfgContainer [2023-11-06 22:31:03,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:31:03,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:31:03,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:31:03,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:31:03,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:31:01" (1/3) ... [2023-11-06 22:31:03,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184e51de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:03, skipping insertion in model container [2023-11-06 22:31:03,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:02" (2/3) ... [2023-11-06 22:31:03,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184e51de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:03, skipping insertion in model container [2023-11-06 22:31:03,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:03" (3/3) ... [2023-11-06 22:31:03,629 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2023-11-06 22:31:03,641 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:31:03,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:31:03,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:31:03,654 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:31:03,771 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:31:03,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 290 flow [2023-11-06 22:31:03,971 INFO L124 PetriNetUnfolderBase]: 2/133 cut-off events. [2023-11-06 22:31:03,971 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:31:03,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-06 22:31:03,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 290 flow [2023-11-06 22:31:03,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2023-11-06 22:31:03,995 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:31:04,026 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2023-11-06 22:31:04,029 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2023-11-06 22:31:04,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2023-11-06 22:31:04,138 INFO L124 PetriNetUnfolderBase]: 2/133 cut-off events. [2023-11-06 22:31:04,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:31:04,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-06 22:31:04,143 INFO L119 LiptonReduction]: Number of co-enabled transitions 3518 [2023-11-06 22:31:10,718 INFO L134 LiptonReduction]: Checked pairs total: 10024 [2023-11-06 22:31:10,718 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-11-06 22:31:10,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:31:10,743 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;@1b0dafb9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:31:10,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 22:31:10,747 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:31:10,747 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-06 22:31:10,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:31:10,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:10,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:31:10,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:10,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:10,755 INFO L85 PathProgramCache]: Analyzing trace with hash 573139, now seen corresponding path program 1 times [2023-11-06 22:31:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:10,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079131313] [2023-11-06 22:31:10,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:11,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:11,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079131313] [2023-11-06 22:31:11,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079131313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:11,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:11,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:31:11,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114990132] [2023-11-06 22:31:11,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:11,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:31:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:11,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:31:11,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:31:11,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 253 [2023-11-06 22:31:11,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:11,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:11,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 253 [2023-11-06 22:31:11,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:13,279 INFO L124 PetriNetUnfolderBase]: 5879/8109 cut-off events. [2023-11-06 22:31:13,280 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-06 22:31:13,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16253 conditions, 8109 events. 5879/8109 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 40759 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16241. Up to 6367 conditions per place. [2023-11-06 22:31:13,376 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-11-06 22:31:13,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-11-06 22:31:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:31:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:31:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-11-06 22:31:13,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.544137022397892 [2023-11-06 22:31:13,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-11-06 22:31:13,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-11-06 22:31:13,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:31:13,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-11-06 22:31:13,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:13,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:13,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:13,438 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 413 transitions. [2023-11-06 22:31:13,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-11-06 22:31:13,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:31:13,448 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-11-06 22:31:13,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-06 22:31:13,457 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-06 22:31:13,457 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-11-06 22:31:13,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:13,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:13,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:13,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:31:13,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:13,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:13,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2127032609, now seen corresponding path program 1 times [2023-11-06 22:31:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:13,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536100590] [2023-11-06 22:31:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536100590] [2023-11-06 22:31:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536100590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:13,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:13,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:31:13,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355896790] [2023-11-06 22:31:13,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:13,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:31:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:13,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:31:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:31:13,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-11-06 22:31:13,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:13,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:13,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-11-06 22:31:13,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:16,387 INFO L124 PetriNetUnfolderBase]: 9575/12870 cut-off events. [2023-11-06 22:31:16,388 INFO L125 PetriNetUnfolderBase]: For 653/653 co-relation queries the response was YES. [2023-11-06 22:31:16,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26710 conditions, 12870 events. 9575/12870 cut-off events. For 653/653 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 58912 event pairs, 4615 based on Foata normal form. 16/12886 useless extension candidates. Maximal degree in co-relation 26700. Up to 12679 conditions per place. [2023-11-06 22:31:16,593 INFO L140 encePairwiseOnDemand]: 247/253 looper letters, 39 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-11-06 22:31:16,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 196 flow [2023-11-06 22:31:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:31:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:31:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-11-06 22:31:16,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059288537549407 [2023-11-06 22:31:16,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-11-06 22:31:16,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-11-06 22:31:16,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:31:16,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-11-06 22:31:16,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:16,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:16,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:16,611 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 384 transitions. [2023-11-06 22:31:16,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 196 flow [2023-11-06 22:31:16,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:31:16,615 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 97 flow [2023-11-06 22:31:16,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-06 22:31:16,617 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-06 22:31:16,617 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 97 flow [2023-11-06 22:31:16,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:16,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:16,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:16,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:31:16,619 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:16,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash -815365750, now seen corresponding path program 1 times [2023-11-06 22:31:16,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:16,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903503871] [2023-11-06 22:31:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:16,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:16,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:16,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903503871] [2023-11-06 22:31:16,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903503871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:16,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:16,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:31:16,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198442246] [2023-11-06 22:31:16,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:16,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:16,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:16,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-11-06 22:31:16,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:16,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:16,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-11-06 22:31:16,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:18,903 INFO L124 PetriNetUnfolderBase]: 8789/11850 cut-off events. [2023-11-06 22:31:18,903 INFO L125 PetriNetUnfolderBase]: For 1933/1933 co-relation queries the response was YES. [2023-11-06 22:31:18,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26844 conditions, 11850 events. 8789/11850 cut-off events. For 1933/1933 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 52969 event pairs, 2767 based on Foata normal form. 234/12084 useless extension candidates. Maximal degree in co-relation 26833. Up to 8176 conditions per place. [2023-11-06 22:31:19,005 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-11-06 22:31:19,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 223 flow [2023-11-06 22:31:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:31:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:31:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-06 22:31:19,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032938076416338 [2023-11-06 22:31:19,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-11-06 22:31:19,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-11-06 22:31:19,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:31:19,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-11-06 22:31:19,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:19,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:19,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:19,014 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 97 flow. Second operand 3 states and 382 transitions. [2023-11-06 22:31:19,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 223 flow [2023-11-06 22:31:19,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:31:19,018 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 103 flow [2023-11-06 22:31:19,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-11-06 22:31:19,020 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-11-06 22:31:19,024 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 103 flow [2023-11-06 22:31:19,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:19,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:19,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:19,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:31:19,026 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:19,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:19,027 INFO L85 PathProgramCache]: Analyzing trace with hash -328615287, now seen corresponding path program 1 times [2023-11-06 22:31:19,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:19,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907618496] [2023-11-06 22:31:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907618496] [2023-11-06 22:31:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907618496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:19,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:19,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:31:19,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681965576] [2023-11-06 22:31:19,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:19,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:19,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:19,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:19,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-11-06 22:31:19,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:19,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:19,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-11-06 22:31:19,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:21,047 INFO L124 PetriNetUnfolderBase]: 5743/8379 cut-off events. [2023-11-06 22:31:21,047 INFO L125 PetriNetUnfolderBase]: For 1583/1586 co-relation queries the response was YES. [2023-11-06 22:31:21,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18815 conditions, 8379 events. 5743/8379 cut-off events. For 1583/1586 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 47267 event pairs, 1099 based on Foata normal form. 665/8799 useless extension candidates. Maximal degree in co-relation 18802. Up to 5131 conditions per place. [2023-11-06 22:31:21,129 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 66 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2023-11-06 22:31:21,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 82 transitions, 381 flow [2023-11-06 22:31:21,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:31:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:31:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-11-06 22:31:21,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027667984189723 [2023-11-06 22:31:21,134 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-11-06 22:31:21,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-11-06 22:31:21,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:31:21,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-11-06 22:31:21,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:21,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:21,143 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:21,144 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 103 flow. Second operand 5 states and 636 transitions. [2023-11-06 22:31:21,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 82 transitions, 381 flow [2023-11-06 22:31:21,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 82 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:31:21,154 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 172 flow [2023-11-06 22:31:21,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-11-06 22:31:21,156 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2023-11-06 22:31:21,156 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 172 flow [2023-11-06 22:31:21,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:21,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:21,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:21,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:31:21,158 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:21,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash 345030726, now seen corresponding path program 1 times [2023-11-06 22:31:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:21,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990236552] [2023-11-06 22:31:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:21,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:21,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:21,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990236552] [2023-11-06 22:31:21,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990236552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:21,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:21,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:21,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604121720] [2023-11-06 22:31:21,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:21,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:31:21,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:21,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:31:21,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:31:21,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-11-06 22:31:21,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:21,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:21,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-11-06 22:31:21,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:23,120 INFO L124 PetriNetUnfolderBase]: 4519/6802 cut-off events. [2023-11-06 22:31:23,120 INFO L125 PetriNetUnfolderBase]: For 3011/3014 co-relation queries the response was YES. [2023-11-06 22:31:23,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19044 conditions, 6802 events. 4519/6802 cut-off events. For 3011/3014 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 39288 event pairs, 630 based on Foata normal form. 395/7018 useless extension candidates. Maximal degree in co-relation 19028. Up to 1949 conditions per place. [2023-11-06 22:31:23,181 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 90 selfloop transitions, 19 changer transitions 0/115 dead transitions. [2023-11-06 22:31:23,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 115 transitions, 616 flow [2023-11-06 22:31:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:31:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:31:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions. [2023-11-06 22:31:23,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042348955392434 [2023-11-06 22:31:23,187 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 893 transitions. [2023-11-06 22:31:23,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions. [2023-11-06 22:31:23,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:31:23,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions. [2023-11-06 22:31:23,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:23,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:23,201 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:23,201 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 172 flow. Second operand 7 states and 893 transitions. [2023-11-06 22:31:23,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 115 transitions, 616 flow [2023-11-06 22:31:23,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 115 transitions, 611 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:31:23,327 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 301 flow [2023-11-06 22:31:23,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-11-06 22:31:23,328 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2023-11-06 22:31:23,328 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 301 flow [2023-11-06 22:31:23,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:23,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:23,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:23,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:31:23,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:23,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -713701738, now seen corresponding path program 1 times [2023-11-06 22:31:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835125017] [2023-11-06 22:31:23,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835125017] [2023-11-06 22:31:24,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835125017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:24,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:24,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:24,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130923078] [2023-11-06 22:31:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:24,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:31:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:31:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:31:24,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 253 [2023-11-06 22:31:24,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:24,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:24,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 253 [2023-11-06 22:31:24,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:26,300 INFO L124 PetriNetUnfolderBase]: 8140/12704 cut-off events. [2023-11-06 22:31:26,300 INFO L125 PetriNetUnfolderBase]: For 22725/22727 co-relation queries the response was YES. [2023-11-06 22:31:26,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43148 conditions, 12704 events. 8140/12704 cut-off events. For 22725/22727 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 84505 event pairs, 2580 based on Foata normal form. 58/12583 useless extension candidates. Maximal degree in co-relation 43128. Up to 6732 conditions per place. [2023-11-06 22:31:26,441 INFO L140 encePairwiseOnDemand]: 245/253 looper letters, 154 selfloop transitions, 16 changer transitions 2/178 dead transitions. [2023-11-06 22:31:26,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 178 transitions, 1516 flow [2023-11-06 22:31:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:31:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:31:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 792 transitions. [2023-11-06 22:31:26,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2023-11-06 22:31:26,447 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 792 transitions. [2023-11-06 22:31:26,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 792 transitions. [2023-11-06 22:31:26,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:31:26,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 792 transitions. [2023-11-06 22:31:26,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:26,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:26,457 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:26,457 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 301 flow. Second operand 6 states and 792 transitions. [2023-11-06 22:31:26,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 178 transitions, 1516 flow [2023-11-06 22:31:27,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 178 transitions, 1296 flow, removed 77 selfloop flow, removed 3 redundant places. [2023-11-06 22:31:27,661 INFO L231 Difference]: Finished difference. Result has 60 places, 69 transitions, 393 flow [2023-11-06 22:31:27,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2023-11-06 22:31:27,662 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2023-11-06 22:31:27,662 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 393 flow [2023-11-06 22:31:27,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:27,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:27,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:27,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:31:27,664 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:27,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1499455014, now seen corresponding path program 2 times [2023-11-06 22:31:27,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:27,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136923578] [2023-11-06 22:31:27,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:28,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 22:31:28,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:28,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136923578] [2023-11-06 22:31:28,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136923578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:28,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:28,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:31:28,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106960813] [2023-11-06 22:31:28,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:28,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:31:28,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:28,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:31:28,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:31:28,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-11-06 22:31:28,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:28,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:28,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-11-06 22:31:28,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:29,939 INFO L124 PetriNetUnfolderBase]: 7633/11593 cut-off events. [2023-11-06 22:31:29,939 INFO L125 PetriNetUnfolderBase]: For 17815/17863 co-relation queries the response was YES. [2023-11-06 22:31:29,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40265 conditions, 11593 events. 7633/11593 cut-off events. For 17815/17863 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 75110 event pairs, 563 based on Foata normal form. 299/11620 useless extension candidates. Maximal degree in co-relation 40243. Up to 3019 conditions per place. [2023-11-06 22:31:30,040 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 187 selfloop transitions, 27 changer transitions 38/258 dead transitions. [2023-11-06 22:31:30,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 258 transitions, 1756 flow [2023-11-06 22:31:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:31:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:31:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1148 transitions. [2023-11-06 22:31:30,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041721563460694 [2023-11-06 22:31:30,059 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1148 transitions. [2023-11-06 22:31:30,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1148 transitions. [2023-11-06 22:31:30,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:31:30,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1148 transitions. [2023-11-06 22:31:30,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.55555555555556) internal successors, (1148), 9 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:30,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 253.0) internal successors, (2530), 10 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:30,083 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 253.0) internal successors, (2530), 10 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:30,084 INFO L175 Difference]: Start difference. First operand has 60 places, 69 transitions, 393 flow. Second operand 9 states and 1148 transitions. [2023-11-06 22:31:30,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 258 transitions, 1756 flow [2023-11-06 22:31:31,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 258 transitions, 1754 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-06 22:31:31,043 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 555 flow [2023-11-06 22:31:31,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=555, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2023-11-06 22:31:31,044 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-11-06 22:31:31,045 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 555 flow [2023-11-06 22:31:31,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:31,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:31,046 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, 1, 1, 1, 1] [2023-11-06 22:31:31,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:31:31,047 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:31,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash -376719998, now seen corresponding path program 1 times [2023-11-06 22:31:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:31,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230982405] [2023-11-06 22:31:31,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230982405] [2023-11-06 22:31:32,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230982405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:32,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:32,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:31:32,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281202386] [2023-11-06 22:31:32,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:32,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:31:32,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:32,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:31:32,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:31:32,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 253 [2023-11-06 22:31:32,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 555 flow. Second operand has 7 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:32,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:32,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 253 [2023-11-06 22:31:32,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:35,128 INFO L124 PetriNetUnfolderBase]: 8659/13914 cut-off events. [2023-11-06 22:31:35,129 INFO L125 PetriNetUnfolderBase]: For 38724/39076 co-relation queries the response was YES. [2023-11-06 22:31:35,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55428 conditions, 13914 events. 8659/13914 cut-off events. For 38724/39076 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 98961 event pairs, 1541 based on Foata normal form. 177/13932 useless extension candidates. Maximal degree in co-relation 55401. Up to 4414 conditions per place. [2023-11-06 22:31:35,246 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 184 selfloop transitions, 18 changer transitions 30/238 dead transitions. [2023-11-06 22:31:35,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 238 transitions, 2395 flow [2023-11-06 22:31:35,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:31:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:31:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-11-06 22:31:35,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093167701863354 [2023-11-06 22:31:35,258 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-11-06 22:31:35,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-11-06 22:31:35,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:31:35,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-11-06 22:31:35,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:35,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:35,271 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:35,272 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 555 flow. Second operand 7 states and 902 transitions. [2023-11-06 22:31:35,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 238 transitions, 2395 flow [2023-11-06 22:31:37,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 238 transitions, 1972 flow, removed 142 selfloop flow, removed 5 redundant places. [2023-11-06 22:31:37,674 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 615 flow [2023-11-06 22:31:37,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=615, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2023-11-06 22:31:37,676 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-11-06 22:31:37,676 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 615 flow [2023-11-06 22:31:37,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:37,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:37,677 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, 1, 1, 1, 1] [2023-11-06 22:31:37,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:31:37,678 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:37,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1101438891, now seen corresponding path program 1 times [2023-11-06 22:31:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860953223] [2023-11-06 22:31:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:38,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:38,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860953223] [2023-11-06 22:31:38,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860953223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:38,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:38,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:31:38,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277235828] [2023-11-06 22:31:38,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:38,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:31:38,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:38,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:31:38,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:31:38,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 253 [2023-11-06 22:31:38,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 615 flow. Second operand has 7 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:38,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:38,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 253 [2023-11-06 22:31:38,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:41,473 INFO L124 PetriNetUnfolderBase]: 9980/16301 cut-off events. [2023-11-06 22:31:41,473 INFO L125 PetriNetUnfolderBase]: For 38308/38605 co-relation queries the response was YES. [2023-11-06 22:31:41,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63884 conditions, 16301 events. 9980/16301 cut-off events. For 38308/38605 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 121705 event pairs, 1944 based on Foata normal form. 231/16368 useless extension candidates. Maximal degree in co-relation 63853. Up to 4890 conditions per place. [2023-11-06 22:31:41,623 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 187 selfloop transitions, 22 changer transitions 35/250 dead transitions. [2023-11-06 22:31:41,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 250 transitions, 2245 flow [2023-11-06 22:31:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:31:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:31:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-11-06 22:31:41,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093167701863354 [2023-11-06 22:31:41,630 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-11-06 22:31:41,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-11-06 22:31:41,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:31:41,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-11-06 22:31:41,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:41,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:41,644 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:41,644 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 615 flow. Second operand 7 states and 902 transitions. [2023-11-06 22:31:41,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 250 transitions, 2245 flow [2023-11-06 22:31:45,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 250 transitions, 2240 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:31:45,064 INFO L231 Difference]: Finished difference. Result has 85 places, 93 transitions, 815 flow [2023-11-06 22:31:45,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=815, PETRI_PLACES=85, PETRI_TRANSITIONS=93} [2023-11-06 22:31:45,065 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2023-11-06 22:31:45,065 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 93 transitions, 815 flow [2023-11-06 22:31:45,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:45,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:45,067 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, 1, 1, 1, 1] [2023-11-06 22:31:45,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:31:45,067 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:45,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash -727136138, now seen corresponding path program 2 times [2023-11-06 22:31:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653313609] [2023-11-06 22:31:45,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:45,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653313609] [2023-11-06 22:31:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653313609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:45,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:45,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:31:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415655397] [2023-11-06 22:31:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:45,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:31:45,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:45,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:31:45,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:31:45,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 253 [2023-11-06 22:31:45,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 93 transitions, 815 flow. Second operand has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:45,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:45,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 253 [2023-11-06 22:31:45,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:50,168 INFO L124 PetriNetUnfolderBase]: 16016/23961 cut-off events. [2023-11-06 22:31:50,168 INFO L125 PetriNetUnfolderBase]: For 66253/66253 co-relation queries the response was YES. [2023-11-06 22:31:50,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97036 conditions, 23961 events. 16016/23961 cut-off events. For 66253/66253 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 155845 event pairs, 3510 based on Foata normal form. 13/23974 useless extension candidates. Maximal degree in co-relation 97000. Up to 19673 conditions per place. [2023-11-06 22:31:50,394 INFO L140 encePairwiseOnDemand]: 241/253 looper letters, 161 selfloop transitions, 50 changer transitions 59/270 dead transitions. [2023-11-06 22:31:50,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 270 transitions, 2372 flow [2023-11-06 22:31:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:31:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:31:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1255 transitions. [2023-11-06 22:31:50,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49604743083003955 [2023-11-06 22:31:50,403 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1255 transitions. [2023-11-06 22:31:50,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1255 transitions. [2023-11-06 22:31:50,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:31:50,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1255 transitions. [2023-11-06 22:31:50,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.5) internal successors, (1255), 10 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:50,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 253.0) internal successors, (2783), 11 states have internal predecessors, (2783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:50,420 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 253.0) internal successors, (2783), 11 states have internal predecessors, (2783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:50,421 INFO L175 Difference]: Start difference. First operand has 85 places, 93 transitions, 815 flow. Second operand 10 states and 1255 transitions. [2023-11-06 22:31:50,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 270 transitions, 2372 flow [2023-11-06 22:31:58,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 270 transitions, 2361 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 22:31:58,125 INFO L231 Difference]: Finished difference. Result has 98 places, 113 transitions, 1088 flow [2023-11-06 22:31:58,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1088, PETRI_PLACES=98, PETRI_TRANSITIONS=113} [2023-11-06 22:31:58,126 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2023-11-06 22:31:58,127 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 113 transitions, 1088 flow [2023-11-06 22:31:58,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:58,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:31:58,128 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, 1, 1, 1, 1] [2023-11-06 22:31:58,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:31:58,128 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:31:58,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1394601494, now seen corresponding path program 3 times [2023-11-06 22:31:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804563847] [2023-11-06 22:31:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:58,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:58,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804563847] [2023-11-06 22:31:58,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804563847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:58,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:58,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:31:58,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723232917] [2023-11-06 22:31:58,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:58,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:31:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:31:58,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:31:58,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-11-06 22:31:58,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 113 transitions, 1088 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:58,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:31:58,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-11-06 22:31:58,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:31:59,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L810-->L817: Formula: (let ((.cse1 (not (= (mod v_~b$w_buff0_used~0_79 256) 0))) (.cse0 (not (= (mod v_~b$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_80 256) 0)))) (.cse3 (and (not (= (mod v_~b$w_buff1_used~0_67 256) 0)) .cse0)) (.cse4 (and .cse5 .cse1))) (and (= (ite (or (and .cse0 (not (= (mod v_~b$w_buff1_used~0_66 256) 0))) (and .cse1 (not (= (mod v_~b$r_buff0_thd3~0_19 256) 0)))) 0 v_~b$r_buff1_thd3~0_18) v_~b$r_buff1_thd3~0_17) (= v_~b$w_buff0_used~0_79 (ite .cse2 0 v_~b$w_buff0_used~0_80)) (= v_~b~0_42 (ite .cse2 v_~b$w_buff0~0_28 (ite .cse3 v_~b$w_buff1~0_23 v_~b~0_43))) (= v_~b$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~b$w_buff1_used~0_67)) (= (ite .cse4 0 v_~b$r_buff0_thd3~0_20) v_~b$r_buff0_thd3~0_19)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_80, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_67, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_28, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_79, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_66, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_28, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][90], [278#(= ~__unbuffered_cnt~0 0), 189#true, Black: 193#(= ~__unbuffered_p3_EBX~0 1), Black: 191#(and (= ~b$r_buff0_thd1~0 1) (<= (div ~b$w_buff0_used~0 256) 0) (= ~b$w_buff0~0 1) (<= 1 ~b$w_buff0_used~0)), 50#L817true, 218#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0)), 239#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd3~0 0) (<= (div ~b$w_buff0_used~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0~0 1) (<= 1 ~b$w_buff0_used~0)), Black: 268#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= ~__unbuffered_p0_EAX~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~x~0 1) (= ~b$w_buff0~0 1)), Black: 262#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), P3Thread1of1ForFork2InUse, Black: 255#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= ~x~0 1)), Black: 266#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~x~0 1) (= ~b$w_buff0~0 1)), P0Thread1of1ForFork1InUse, Black: 254#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0)), P1Thread1of1ForFork3InUse, Black: 258#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 211#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 204#(<= ~__unbuffered_cnt~0 2), 21#L856true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 9#L880-3true, Black: 162#(= ~__unbuffered_p3_EAX~0 0), Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (<= (div ~b$w_buff0_used~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0) (<= 1 ~b$w_buff0_used~0)), Black: 226#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 228#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0)), 43#L787true, 252#true, Black: 171#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 169#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 4#L770true, Black: 240#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1)), Black: 244#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1)), Black: 179#(<= ~__unbuffered_cnt~0 1), Black: 180#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~b$r_buff0_thd3~0 0)), Black: 184#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 178#(= ~__unbuffered_cnt~0 0)]) [2023-11-06 22:31:59,424 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:31:59,424 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:31:59,424 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:31:59,424 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:31:59,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L810-->L817: Formula: (let ((.cse1 (not (= (mod v_~b$w_buff0_used~0_79 256) 0))) (.cse0 (not (= (mod v_~b$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_80 256) 0)))) (.cse3 (and (not (= (mod v_~b$w_buff1_used~0_67 256) 0)) .cse0)) (.cse4 (and .cse5 .cse1))) (and (= (ite (or (and .cse0 (not (= (mod v_~b$w_buff1_used~0_66 256) 0))) (and .cse1 (not (= (mod v_~b$r_buff0_thd3~0_19 256) 0)))) 0 v_~b$r_buff1_thd3~0_18) v_~b$r_buff1_thd3~0_17) (= v_~b$w_buff0_used~0_79 (ite .cse2 0 v_~b$w_buff0_used~0_80)) (= v_~b~0_42 (ite .cse2 v_~b$w_buff0~0_28 (ite .cse3 v_~b$w_buff1~0_23 v_~b~0_43))) (= v_~b$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~b$w_buff1_used~0_67)) (= (ite .cse4 0 v_~b$r_buff0_thd3~0_20) v_~b$r_buff0_thd3~0_19)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_80, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_67, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_28, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_79, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_66, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_28, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][91], [189#true, Black: 193#(= ~__unbuffered_p3_EBX~0 1), Black: 191#(and (= ~b$r_buff0_thd1~0 1) (<= (div ~b$w_buff0_used~0 256) 0) (= ~b$w_buff0~0 1) (<= 1 ~b$w_buff0_used~0)), 50#L817true, 239#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd3~0 0) (<= (div ~b$w_buff0_used~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0~0 1) (<= 1 ~b$w_buff0_used~0)), 218#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0)), Black: 268#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= ~__unbuffered_p0_EAX~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~x~0 1) (= ~b$w_buff0~0 1)), Black: 262#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), P3Thread1of1ForFork2InUse, Black: 255#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 266#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~x~0 1) (= ~b$w_buff0~0 1)), Black: 254#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0)), P1Thread1of1ForFork3InUse, Black: 258#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 211#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 204#(<= ~__unbuffered_cnt~0 2), 92#P3EXITtrue, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 9#L880-3true, Black: 162#(= ~__unbuffered_p3_EAX~0 0), Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (<= (div ~b$w_buff0_used~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0) (<= 1 ~b$w_buff0_used~0)), Black: 226#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 228#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0)), 43#L787true, 252#true, Black: 171#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 169#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 203#(<= ~__unbuffered_cnt~0 1), Black: 168#(= ~__unbuffered_cnt~0 0), 4#L770true, Black: 240#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1)), Black: 244#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1)), Black: 180#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~b$r_buff0_thd3~0 0)), Black: 184#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 279#(<= ~__unbuffered_cnt~0 1)]) [2023-11-06 22:31:59,722 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:31:59,722 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:31:59,722 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:31:59,722 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:31:59,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L810-->L817: Formula: (let ((.cse1 (not (= (mod v_~b$w_buff0_used~0_79 256) 0))) (.cse0 (not (= (mod v_~b$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_80 256) 0)))) (.cse3 (and (not (= (mod v_~b$w_buff1_used~0_67 256) 0)) .cse0)) (.cse4 (and .cse5 .cse1))) (and (= (ite (or (and .cse0 (not (= (mod v_~b$w_buff1_used~0_66 256) 0))) (and .cse1 (not (= (mod v_~b$r_buff0_thd3~0_19 256) 0)))) 0 v_~b$r_buff1_thd3~0_18) v_~b$r_buff1_thd3~0_17) (= v_~b$w_buff0_used~0_79 (ite .cse2 0 v_~b$w_buff0_used~0_80)) (= v_~b~0_42 (ite .cse2 v_~b$w_buff0~0_28 (ite .cse3 v_~b$w_buff1~0_23 v_~b~0_43))) (= v_~b$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~b$w_buff1_used~0_67)) (= (ite .cse4 0 v_~b$r_buff0_thd3~0_20) v_~b$r_buff0_thd3~0_19)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_80, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_67, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_28, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_79, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_66, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_28, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][90], [278#(= ~__unbuffered_cnt~0 0), 189#true, Black: 193#(= ~__unbuffered_p3_EBX~0 1), Black: 191#(and (= ~b$r_buff0_thd1~0 1) (<= (div ~b$w_buff0_used~0 256) 0) (= ~b$w_buff0~0 1) (<= 1 ~b$w_buff0_used~0)), 50#L817true, 239#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd3~0 0) (<= (div ~b$w_buff0_used~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0~0 1) (<= 1 ~b$w_buff0_used~0)), 218#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0)), Black: 268#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= ~__unbuffered_p0_EAX~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~x~0 1) (= ~b$w_buff0~0 1)), Black: 262#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), P3Thread1of1ForFork2InUse, Black: 255#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 266#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~x~0 1) (= ~b$w_buff0~0 1)), Black: 254#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0)), P1Thread1of1ForFork3InUse, Black: 258#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), P2Thread1of1ForFork0InUse, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 204#(<= ~__unbuffered_cnt~0 2), 21#L856true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 9#L880-3true, Black: 162#(= ~__unbuffered_p3_EAX~0 0), 29#L790true, Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (<= (div ~b$w_buff0_used~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0) (<= 1 ~b$w_buff0_used~0)), Black: 226#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 228#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0)), 252#true, Black: 171#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 169#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 4#L770true, Black: 240#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1)), Black: 244#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1)), Black: 179#(<= ~__unbuffered_cnt~0 1), Black: 180#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~b$r_buff0_thd3~0 0)), Black: 184#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 178#(= ~__unbuffered_cnt~0 0)]) [2023-11-06 22:31:59,730 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:31:59,730 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:31:59,730 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:31:59,730 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:31:59,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L810-->L817: Formula: (let ((.cse1 (not (= (mod v_~b$w_buff0_used~0_79 256) 0))) (.cse0 (not (= (mod v_~b$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_80 256) 0)))) (.cse3 (and (not (= (mod v_~b$w_buff1_used~0_67 256) 0)) .cse0)) (.cse4 (and .cse5 .cse1))) (and (= (ite (or (and .cse0 (not (= (mod v_~b$w_buff1_used~0_66 256) 0))) (and .cse1 (not (= (mod v_~b$r_buff0_thd3~0_19 256) 0)))) 0 v_~b$r_buff1_thd3~0_18) v_~b$r_buff1_thd3~0_17) (= v_~b$w_buff0_used~0_79 (ite .cse2 0 v_~b$w_buff0_used~0_80)) (= v_~b~0_42 (ite .cse2 v_~b$w_buff0~0_28 (ite .cse3 v_~b$w_buff1~0_23 v_~b~0_43))) (= v_~b$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~b$w_buff1_used~0_67)) (= (ite .cse4 0 v_~b$r_buff0_thd3~0_20) v_~b$r_buff0_thd3~0_19)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_80, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_67, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_28, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_79, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_66, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_28, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][91], [189#true, Black: 193#(= ~__unbuffered_p3_EBX~0 1), Black: 191#(and (= ~b$r_buff0_thd1~0 1) (<= (div ~b$w_buff0_used~0 256) 0) (= ~b$w_buff0~0 1) (<= 1 ~b$w_buff0_used~0)), 50#L817true, 218#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0)), 239#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd3~0 0) (<= (div ~b$w_buff0_used~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0~0 1) (<= 1 ~b$w_buff0_used~0)), Black: 268#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= ~__unbuffered_p0_EAX~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~x~0 1) (= ~b$w_buff0~0 1)), P3Thread1of1ForFork2InUse, Black: 262#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 255#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 266#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~x~0 1) (= ~b$w_buff0~0 1)), Black: 254#(and (= ~b$r_buff0_thd4~0 0) (= ~b~0 0)), P1Thread1of1ForFork3InUse, Black: 258#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 211#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 204#(<= ~__unbuffered_cnt~0 2), 92#P3EXITtrue, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 9#L880-3true, Black: 162#(= ~__unbuffered_p3_EAX~0 0), 29#L790true, Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (<= (div ~b$w_buff0_used~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0) (<= 1 ~b$w_buff0_used~0)), Black: 226#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 228#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EBX~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0)), 252#true, Black: 171#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 203#(<= ~__unbuffered_cnt~0 1), Black: 169#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 168#(= ~__unbuffered_cnt~0 0), 4#L770true, Black: 240#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1)), Black: 244#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b~0 1)), Black: 180#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~b$r_buff0_thd3~0 0)), Black: 184#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 279#(<= ~__unbuffered_cnt~0 1)]) [2023-11-06 22:31:59,784 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 22:31:59,784 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:31:59,785 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:31:59,785 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:32:00,265 INFO L124 PetriNetUnfolderBase]: 4448/7030 cut-off events. [2023-11-06 22:32:00,265 INFO L125 PetriNetUnfolderBase]: For 34476/34995 co-relation queries the response was YES. [2023-11-06 22:32:00,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32379 conditions, 7030 events. 4448/7030 cut-off events. For 34476/34995 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 44279 event pairs, 638 based on Foata normal form. 132/6918 useless extension candidates. Maximal degree in co-relation 32348. Up to 2737 conditions per place. [2023-11-06 22:32:00,372 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 167 selfloop transitions, 18 changer transitions 21/223 dead transitions. [2023-11-06 22:32:00,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 223 transitions, 2305 flow [2023-11-06 22:32:00,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:32:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:32:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 992 transitions. [2023-11-06 22:32:00,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4901185770750988 [2023-11-06 22:32:00,379 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 992 transitions. [2023-11-06 22:32:00,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 992 transitions. [2023-11-06 22:32:00,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:00,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 992 transitions. [2023-11-06 22:32:00,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:00,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:00,390 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:00,391 INFO L175 Difference]: Start difference. First operand has 98 places, 113 transitions, 1088 flow. Second operand 8 states and 992 transitions. [2023-11-06 22:32:00,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 223 transitions, 2305 flow [2023-11-06 22:32:00,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 223 transitions, 2174 flow, removed 58 selfloop flow, removed 8 redundant places. [2023-11-06 22:32:00,824 INFO L231 Difference]: Finished difference. Result has 88 places, 110 transitions, 980 flow [2023-11-06 22:32:00,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=980, PETRI_PLACES=88, PETRI_TRANSITIONS=110} [2023-11-06 22:32:00,825 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2023-11-06 22:32:00,825 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 110 transitions, 980 flow [2023-11-06 22:32:00,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:00,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:00,826 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:00,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:32:00,826 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:32:00,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:00,826 INFO L85 PathProgramCache]: Analyzing trace with hash -864739895, now seen corresponding path program 1 times [2023-11-06 22:32:00,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:00,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298281786] [2023-11-06 22:32:00,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:32:01,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298281786] [2023-11-06 22:32:01,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298281786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:01,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:01,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:32:01,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484454517] [2023-11-06 22:32:01,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:01,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:32:01,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:01,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:32:01,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:32:01,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 253 [2023-11-06 22:32:01,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 110 transitions, 980 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:01,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:01,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 253 [2023-11-06 22:32:01,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:03,406 INFO L124 PetriNetUnfolderBase]: 7805/11853 cut-off events. [2023-11-06 22:32:03,407 INFO L125 PetriNetUnfolderBase]: For 52417/52417 co-relation queries the response was YES. [2023-11-06 22:32:03,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58018 conditions, 11853 events. 7805/11853 cut-off events. For 52417/52417 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 70064 event pairs, 983 based on Foata normal form. 1/11854 useless extension candidates. Maximal degree in co-relation 57991. Up to 5302 conditions per place. [2023-11-06 22:32:03,497 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 151 selfloop transitions, 10 changer transitions 107/268 dead transitions. [2023-11-06 22:32:03,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 268 transitions, 2975 flow [2023-11-06 22:32:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:32:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:32:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2023-11-06 22:32:03,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4901185770750988 [2023-11-06 22:32:03,501 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2023-11-06 22:32:03,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2023-11-06 22:32:03,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:03,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2023-11-06 22:32:03,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:03,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:03,510 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:03,510 INFO L175 Difference]: Start difference. First operand has 88 places, 110 transitions, 980 flow. Second operand 6 states and 744 transitions. [2023-11-06 22:32:03,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 268 transitions, 2975 flow [2023-11-06 22:32:04,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 268 transitions, 2792 flow, removed 53 selfloop flow, removed 7 redundant places. [2023-11-06 22:32:04,123 INFO L231 Difference]: Finished difference. Result has 87 places, 105 transitions, 889 flow [2023-11-06 22:32:04,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=889, PETRI_PLACES=87, PETRI_TRANSITIONS=105} [2023-11-06 22:32:04,124 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-11-06 22:32:04,125 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 105 transitions, 889 flow [2023-11-06 22:32:04,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:04,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:04,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:04,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:32:04,126 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:32:04,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash 256832031, now seen corresponding path program 2 times [2023-11-06 22:32:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026754372] [2023-11-06 22:32:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:04,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:32:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026754372] [2023-11-06 22:32:04,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026754372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:04,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:04,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:32:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141632566] [2023-11-06 22:32:04,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:04,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:32:04,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:04,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:32:04,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:32:04,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 253 [2023-11-06 22:32:04,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 105 transitions, 889 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:04,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:04,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 253 [2023-11-06 22:32:04,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:07,048 INFO L124 PetriNetUnfolderBase]: 6671/10624 cut-off events. [2023-11-06 22:32:07,048 INFO L125 PetriNetUnfolderBase]: For 44190/44238 co-relation queries the response was YES. [2023-11-06 22:32:07,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48321 conditions, 10624 events. 6671/10624 cut-off events. For 44190/44238 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 69886 event pairs, 1582 based on Foata normal form. 10/10546 useless extension candidates. Maximal degree in co-relation 48295. Up to 5157 conditions per place. [2023-11-06 22:32:07,146 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 106 selfloop transitions, 1 changer transitions 115/231 dead transitions. [2023-11-06 22:32:07,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 231 transitions, 2443 flow [2023-11-06 22:32:07,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:32:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:32:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-11-06 22:32:07,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-11-06 22:32:07,150 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-11-06 22:32:07,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-11-06 22:32:07,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:07,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-11-06 22:32:07,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:07,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:07,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:07,159 INFO L175 Difference]: Start difference. First operand has 87 places, 105 transitions, 889 flow. Second operand 4 states and 529 transitions. [2023-11-06 22:32:07,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 231 transitions, 2443 flow [2023-11-06 22:32:08,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 231 transitions, 2410 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-06 22:32:08,022 INFO L231 Difference]: Finished difference. Result has 86 places, 96 transitions, 796 flow [2023-11-06 22:32:08,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=796, PETRI_PLACES=86, PETRI_TRANSITIONS=96} [2023-11-06 22:32:08,024 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-11-06 22:32:08,024 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 96 transitions, 796 flow [2023-11-06 22:32:08,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:08,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:08,025 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:08,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:32:08,025 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:32:08,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1621056101, now seen corresponding path program 3 times [2023-11-06 22:32:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:08,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480768965] [2023-11-06 22:32:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:32:09,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:09,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480768965] [2023-11-06 22:32:09,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480768965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:09,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:09,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:32:09,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123412493] [2023-11-06 22:32:09,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:09,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:32:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:32:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:32:09,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 253 [2023-11-06 22:32:09,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 96 transitions, 796 flow. Second operand has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:09,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:09,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 253 [2023-11-06 22:32:09,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:11,058 INFO L124 PetriNetUnfolderBase]: 3269/5352 cut-off events. [2023-11-06 22:32:11,058 INFO L125 PetriNetUnfolderBase]: For 22331/22414 co-relation queries the response was YES. [2023-11-06 22:32:11,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24315 conditions, 5352 events. 3269/5352 cut-off events. For 22331/22414 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 32494 event pairs, 585 based on Foata normal form. 26/5299 useless extension candidates. Maximal degree in co-relation 24288. Up to 2964 conditions per place. [2023-11-06 22:32:11,116 INFO L140 encePairwiseOnDemand]: 247/253 looper letters, 94 selfloop transitions, 14 changer transitions 37/158 dead transitions. [2023-11-06 22:32:11,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 158 transitions, 1423 flow [2023-11-06 22:32:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:32:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:32:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2023-11-06 22:32:11,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49632975719932243 [2023-11-06 22:32:11,121 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 879 transitions. [2023-11-06 22:32:11,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 879 transitions. [2023-11-06 22:32:11,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:11,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 879 transitions. [2023-11-06 22:32:11,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:11,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:11,130 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:11,130 INFO L175 Difference]: Start difference. First operand has 86 places, 96 transitions, 796 flow. Second operand 7 states and 879 transitions. [2023-11-06 22:32:11,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 158 transitions, 1423 flow [2023-11-06 22:32:11,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 158 transitions, 1416 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:32:11,343 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 758 flow [2023-11-06 22:32:11,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=758, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-11-06 22:32:11,344 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2023-11-06 22:32:11,344 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 758 flow [2023-11-06 22:32:11,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:11,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:11,345 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:11,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:32:11,346 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:32:11,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash -582184911, now seen corresponding path program 4 times [2023-11-06 22:32:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:11,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594578141] [2023-11-06 22:32:11,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:32:11,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:32:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:32:11,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:32:11,581 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:32:11,582 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-06 22:32:11,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-06 22:32:11,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-06 22:32:11,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-06 22:32:11,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-06 22:32:11,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-06 22:32:11,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-06 22:32:11,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:32:11,592 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:11,601 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:32:11,601 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:32:11,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:32:11 BasicIcfg [2023-11-06 22:32:11,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:32:11,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:32:11,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:32:11,750 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:32:11,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:03" (3/4) ... [2023-11-06 22:32:11,751 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:32:11,912 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:32:11,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:32:11,914 INFO L158 Benchmark]: Toolchain (without parser) took 70458.29ms. Allocated memory was 130.0MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 97.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 727.2MB. Max. memory is 16.1GB. [2023-11-06 22:32:11,917 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 130.0MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:32:11,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 802.57ms. Allocated memory is still 130.0MB. Free memory was 97.8MB in the beginning and 73.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:32:11,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.75ms. Allocated memory is still 130.0MB. Free memory was 73.4MB in the beginning and 70.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:32:11,919 INFO L158 Benchmark]: Boogie Preprocessor took 46.00ms. Allocated memory is still 130.0MB. Free memory was 70.7MB in the beginning and 68.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:32:11,919 INFO L158 Benchmark]: RCFGBuilder took 1223.24ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 68.6MB in the beginning and 103.0MB in the end (delta: -34.4MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-11-06 22:32:11,920 INFO L158 Benchmark]: TraceAbstraction took 68132.61ms. Allocated memory was 163.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 102.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 692.2MB. Max. memory is 16.1GB. [2023-11-06 22:32:11,920 INFO L158 Benchmark]: Witness Printer took 163.84ms. Allocated memory is still 4.2GB. Free memory was 3.5GB in the beginning and 3.8GB in the end (delta: -286.1MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2023-11-06 22:32:11,924 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.37ms. Allocated memory is still 130.0MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 802.57ms. Allocated memory is still 130.0MB. Free memory was 97.8MB in the beginning and 73.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.75ms. Allocated memory is still 130.0MB. Free memory was 73.4MB in the beginning and 70.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.00ms. Allocated memory is still 130.0MB. Free memory was 70.7MB in the beginning and 68.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1223.24ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 68.6MB in the beginning and 103.0MB in the end (delta: -34.4MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * TraceAbstraction took 68132.61ms. Allocated memory was 163.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 102.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 692.2MB. Max. memory is 16.1GB. * Witness Printer took 163.84ms. Allocated memory is still 4.2GB. Free memory was 3.5GB in the beginning and 3.8GB in the end (delta: -286.1MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 144 PlacesBefore, 43 PlacesAfterwards, 133 TransitionsBefore, 31 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 10024 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4228, independent: 3971, independent conditional: 0, independent unconditional: 3971, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1930, independent: 1878, independent conditional: 0, independent unconditional: 1878, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4228, independent: 2093, independent conditional: 0, independent unconditional: 2093, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 1930, unknown conditional: 0, unknown unconditional: 1930] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t937, ((void *)0), P0, ((void *)0))=0, t937={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t938, ((void *)0), P1, ((void *)0))=1, t937={6:0}, t938={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t939, ((void *)0), P2, ((void *)0))=2, t937={6:0}, t938={7:0}, t939={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t940, ((void *)0), P3, ((void *)0))=3, t937={6:0}, t938={7:0}, t939={8:0}, t940={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937={6:0}, t938={7:0}, t939={8:0}, t940={5:0}, weak$$choice2=1, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 880]: 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: 874]: 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: 876]: 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: 878]: 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 9 procedures, 175 locations, 7 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: 67.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 51.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1035 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 858 mSDsluCounter, 435 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2781 IncrementalHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 95 mSDtfsCounter, 2781 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1088occurred in iteration=10, InterpolantAutomatonStates: 85, 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.9s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 2122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:32:11,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6ef49-c4fd-4297-a061-d1306edfd9d5/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