./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:06:36,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:06:36,439 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:06:36,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:06:36,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:06:36,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:06:36,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:06:36,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:06:36,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:06:36,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:06:36,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:06:36,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:06:36,477 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:06:36,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:06:36,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:06:36,479 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:06:36,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:06:36,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:06:36,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:06:36,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:06:36,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:06:36,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:06:36,484 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:06:36,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:06:36,485 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:06:36,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:06:36,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:06:36,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:06:36,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:06:36,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:06:36,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:06:36,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:06:36,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:06:36,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:06:36,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:06:36,492 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:06:36,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:06:36,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:06:36,493 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:06:36,493 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_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/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_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 [2023-11-12 02:06:36,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:06:36,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:06:36,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:06:36,859 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:06:36,860 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:06:36,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i [2023-11-12 02:06:40,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:06:40,381 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:06:40,382 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i [2023-11-12 02:06:40,422 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/data/44a6cc754/74ab2d13a871498990d89c900382d78e/FLAG28b3bfe8e [2023-11-12 02:06:40,441 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/data/44a6cc754/74ab2d13a871498990d89c900382d78e [2023-11-12 02:06:40,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:06:40,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:06:40,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:06:40,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:06:40,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:06:40,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:06:40" (1/1) ... [2023-11-12 02:06:40,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b123911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:40, skipping insertion in model container [2023-11-12 02:06:40,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:06:40" (1/1) ... [2023-11-12 02:06:40,549 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:06:40,778 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_5eb8d3f6-4948-487a-8342-f109d58d33e3/sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i[994,1007] [2023-11-12 02:06:41,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:06:41,162 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:06:41,175 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_5eb8d3f6-4948-487a-8342-f109d58d33e3/sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i[994,1007] [2023-11-12 02:06:41,230 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:06:41,271 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:06:41,272 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:06:41,280 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:06:41,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41 WrapperNode [2023-11-12 02:06:41,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:06:41,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:06:41,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:06:41,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:06:41,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,357 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2023-11-12 02:06:41,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:06:41,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:06:41,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:06:41,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:06:41,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:06:41,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:06:41,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:06:41,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:06:41,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:06:41,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:06:41,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:06:41,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:06:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:06:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:06:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:06:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:06:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:06:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:06:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:06:41,564 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:06:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:06:41,564 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:06:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:06:41,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:06:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:06:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:06:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:06:41,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:06:41,567 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:06:41,737 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:06:41,739 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:06:42,277 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:06:42,626 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:06:42,626 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:06:42,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:06:42 BoogieIcfgContainer [2023-11-12 02:06:42,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:06:42,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:06:42,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:06:42,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:06:42,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:06:40" (1/3) ... [2023-11-12 02:06:42,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c958b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:06:42, skipping insertion in model container [2023-11-12 02:06:42,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (2/3) ... [2023-11-12 02:06:42,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c958b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:06:42, skipping insertion in model container [2023-11-12 02:06:42,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:06:42" (3/3) ... [2023-11-12 02:06:42,639 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2023-11-12 02:06:42,649 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:06:42,661 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:06:42,661 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:06:42,662 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:06:42,743 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:06:42,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 266 flow [2023-11-12 02:06:42,850 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-11-12 02:06:42,851 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:06:42,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-11-12 02:06:42,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 266 flow [2023-11-12 02:06:42,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2023-11-12 02:06:42,866 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:06:42,876 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2023-11-12 02:06:42,879 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2023-11-12 02:06:42,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2023-11-12 02:06:42,912 INFO L124 PetriNetUnfolderBase]: 1/109 cut-off events. [2023-11-12 02:06:42,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:06:42,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 38 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-11-12 02:06:42,915 INFO L119 LiptonReduction]: Number of co-enabled transitions 1190 [2023-11-12 02:06:52,724 INFO L134 LiptonReduction]: Checked pairs total: 3065 [2023-11-12 02:06:52,724 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-11-12 02:06:52,740 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:06:52,747 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@630aba67, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:06:52,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-12 02:06:52,756 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:06:52,756 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-11-12 02:06:52,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:06:52,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:52,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:52,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:06:52,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash 601853400, now seen corresponding path program 1 times [2023-11-12 02:06:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:52,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134150295] [2023-11-12 02:06:52,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:52,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,515 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-12 02:06:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:53,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134150295] [2023-11-12 02:06:53,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134150295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:53,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:53,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:06:53,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998955184] [2023-11-12 02:06:53,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:53,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:06:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:53,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:06:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:06:53,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 219 [2023-11-12 02:06:53,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 47 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-12 02:06:53,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:53,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 219 [2023-11-12 02:06:53,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:53,983 INFO L124 PetriNetUnfolderBase]: 545/890 cut-off events. [2023-11-12 02:06:53,983 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-12 02:06:53,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 890 events. 545/890 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3918 event pairs, 125 based on Foata normal form. 8/898 useless extension candidates. Maximal degree in co-relation 1760. Up to 775 conditions per place. [2023-11-12 02:06:54,000 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-11-12 02:06:54,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 137 flow [2023-11-12 02:06:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:06:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:06:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-12 02:06:54,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.563165905631659 [2023-11-12 02:06:54,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-12 02:06:54,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-12 02:06:54,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:54,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-12 02:06:54,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-12 02:06:54,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:54,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:54,052 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 47 flow. Second operand 3 states and 370 transitions. [2023-11-12 02:06:54,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 137 flow [2023-11-12 02:06:54,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:06:54,060 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2023-11-12 02:06:54,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-11-12 02:06:54,067 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-11-12 02:06:54,068 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2023-11-12 02:06:54,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-12 02:06:54,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:54,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:54,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:06:54,070 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:06:54,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1477584927, now seen corresponding path program 1 times [2023-11-12 02:06:54,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:54,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722077004] [2023-11-12 02:06:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,385 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-12 02:06:54,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:54,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722077004] [2023-11-12 02:06:54,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722077004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:54,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:54,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:06:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943180467] [2023-11-12 02:06:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:54,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:06:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:54,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:06:54,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:06:54,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 219 [2023-11-12 02:06:54,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:54,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:54,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 219 [2023-11-12 02:06:54,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:54,752 INFO L124 PetriNetUnfolderBase]: 570/892 cut-off events. [2023-11-12 02:06:54,752 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-12 02:06:54,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 892 events. 570/892 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3652 event pairs, 184 based on Foata normal form. 24/915 useless extension candidates. Maximal degree in co-relation 1957. Up to 621 conditions per place. [2023-11-12 02:06:54,761 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-11-12 02:06:54,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 139 flow [2023-11-12 02:06:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:06:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:06:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-12 02:06:54,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.563165905631659 [2023-11-12 02:06:54,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-12 02:06:54,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-12 02:06:54,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:54,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-12 02:06:54,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-12 02:06:54,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:54,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:54,771 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 3 states and 370 transitions. [2023-11-12 02:06:54,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 139 flow [2023-11-12 02:06:54,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:06:54,773 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 68 flow [2023-11-12 02:06:54,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-12 02:06:54,775 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-11-12 02:06:54,775 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 68 flow [2023-11-12 02:06:54,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:54,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:54,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:54,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:06:54,777 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:06:54,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1143627417, now seen corresponding path program 1 times [2023-11-12 02:06:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676174165] [2023-11-12 02:06:54,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,099 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-12 02:06:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676174165] [2023-11-12 02:06:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676174165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:55,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:55,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:06:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702104829] [2023-11-12 02:06:55,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:55,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:06:55,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:55,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:06:55,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:06:55,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 219 [2023-11-12 02:06:55,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-12 02:06:55,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:55,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 219 [2023-11-12 02:06:55,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:55,369 INFO L124 PetriNetUnfolderBase]: 449/748 cut-off events. [2023-11-12 02:06:55,369 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-11-12 02:06:55,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 748 events. 449/748 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3229 event pairs, 141 based on Foata normal form. 12/759 useless extension candidates. Maximal degree in co-relation 1686. Up to 555 conditions per place. [2023-11-12 02:06:55,376 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-11-12 02:06:55,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 158 flow [2023-11-12 02:06:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:06:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:06:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-11-12 02:06:55,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5753424657534246 [2023-11-12 02:06:55,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-11-12 02:06:55,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-11-12 02:06:55,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:55,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-11-12 02:06:55,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-12 02:06:55,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:55,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:55,385 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 68 flow. Second operand 3 states and 378 transitions. [2023-11-12 02:06:55,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 158 flow [2023-11-12 02:06:55,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:06:55,389 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 72 flow [2023-11-12 02:06:55,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-11-12 02:06:55,391 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-11-12 02:06:55,395 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 72 flow [2023-11-12 02:06:55,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-12 02:06:55,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:55,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:55,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:06:55,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:06:55,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1092662814, now seen corresponding path program 1 times [2023-11-12 02:06:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723365100] [2023-11-12 02:06:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,318 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-12 02:06:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:57,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723365100] [2023-11-12 02:06:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723365100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:06:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688898677] [2023-11-12 02:06:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:57,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:06:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:57,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:06:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:06:57,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 219 [2023-11-12 02:06:57,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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-12 02:06:57,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:57,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 219 [2023-11-12 02:06:57,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:57,900 INFO L124 PetriNetUnfolderBase]: 530/865 cut-off events. [2023-11-12 02:06:57,900 INFO L125 PetriNetUnfolderBase]: For 373/373 co-relation queries the response was YES. [2023-11-12 02:06:57,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 865 events. 530/865 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3896 event pairs, 75 based on Foata normal form. 9/870 useless extension candidates. Maximal degree in co-relation 2083. Up to 520 conditions per place. [2023-11-12 02:06:57,909 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 33 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2023-11-12 02:06:57,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 213 flow [2023-11-12 02:06:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:06:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:06:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2023-11-12 02:06:57,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521689497716895 [2023-11-12 02:06:57,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 457 transitions. [2023-11-12 02:06:57,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 457 transitions. [2023-11-12 02:06:57,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:57,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 457 transitions. [2023-11-12 02:06:57,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 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-12 02:06:57,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:57,918 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:57,919 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 72 flow. Second operand 4 states and 457 transitions. [2023-11-12 02:06:57,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 213 flow [2023-11-12 02:06:57,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:06:57,922 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 106 flow [2023-11-12 02:06:57,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-11-12 02:06:57,923 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-11-12 02:06:57,923 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 106 flow [2023-11-12 02:06:57,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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-12 02:06:57,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:57,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:57,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:06:57,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:06:57,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:57,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1724603826, now seen corresponding path program 2 times [2023-11-12 02:06:57,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:57,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790211057] [2023-11-12 02:06:57,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:57,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,220 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-12 02:06:59,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:59,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790211057] [2023-11-12 02:06:59,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790211057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:59,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:59,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:06:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474955667] [2023-11-12 02:06:59,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:59,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:06:59,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:59,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:06:59,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:06:59,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 219 [2023-11-12 02:06:59,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 106 flow. Second operand has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 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-12 02:06:59,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:59,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 219 [2023-11-12 02:06:59,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:59,821 INFO L124 PetriNetUnfolderBase]: 508/832 cut-off events. [2023-11-12 02:06:59,821 INFO L125 PetriNetUnfolderBase]: For 555/555 co-relation queries the response was YES. [2023-11-12 02:06:59,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2253 conditions, 832 events. 508/832 cut-off events. For 555/555 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3766 event pairs, 98 based on Foata normal form. 9/839 useless extension candidates. Maximal degree in co-relation 2237. Up to 511 conditions per place. [2023-11-12 02:06:59,830 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 33 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2023-11-12 02:06:59,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 229 flow [2023-11-12 02:06:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:06:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:06:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2023-11-12 02:06:59,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.523972602739726 [2023-11-12 02:06:59,834 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2023-11-12 02:06:59,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2023-11-12 02:06:59,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:59,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2023-11-12 02:06:59,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:59,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:59,841 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:06:59,841 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 106 flow. Second operand 4 states and 459 transitions. [2023-11-12 02:06:59,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 229 flow [2023-11-12 02:06:59,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:06:59,847 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 122 flow [2023-11-12 02:06:59,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-12 02:06:59,849 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2023-11-12 02:06:59,849 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 122 flow [2023-11-12 02:06:59,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 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-12 02:06:59,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:59,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:59,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:06:59,851 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:06:59,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash 487241801, now seen corresponding path program 1 times [2023-11-12 02:06:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:59,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068124085] [2023-11-12 02:06:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:00,076 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-12 02:07:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:07:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068124085] [2023-11-12 02:07:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068124085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:07:00,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:07:00,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:07:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596697018] [2023-11-12 02:07:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:07:00,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:07:00,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:07:00,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:07:00,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:07:00,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 219 [2023-11-12 02:07:00,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-12 02:07:00,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:07:00,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 219 [2023-11-12 02:07:00,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:07:00,375 INFO L124 PetriNetUnfolderBase]: 315/562 cut-off events. [2023-11-12 02:07:00,375 INFO L125 PetriNetUnfolderBase]: For 615/615 co-relation queries the response was YES. [2023-11-12 02:07:00,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 562 events. 315/562 cut-off events. For 615/615 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2462 event pairs, 69 based on Foata normal form. 29/586 useless extension candidates. Maximal degree in co-relation 1630. Up to 430 conditions per place. [2023-11-12 02:07:00,382 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 36 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-11-12 02:07:00,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 279 flow [2023-11-12 02:07:00,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:07:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:07:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-11-12 02:07:00,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5570776255707762 [2023-11-12 02:07:00,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-11-12 02:07:00,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-11-12 02:07:00,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:07:00,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-11-12 02:07:00,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-12 02:07:00,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:07:00,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:07:00,390 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 122 flow. Second operand 3 states and 366 transitions. [2023-11-12 02:07:00,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 279 flow [2023-11-12 02:07:00,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:07:00,393 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 144 flow [2023-11-12 02:07:00,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-12 02:07:00,394 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2023-11-12 02:07:00,395 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 144 flow [2023-11-12 02:07:00,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-12 02:07:00,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:07:00,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:07:00,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:07:00,396 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:07:00,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 597677295, now seen corresponding path program 1 times [2023-11-12 02:07:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075996620] [2023-11-12 02:07:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:00,593 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-12 02:07:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:07:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075996620] [2023-11-12 02:07:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075996620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:07:00,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:07:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:07:00,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854195298] [2023-11-12 02:07:00,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:07:00,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:07:00,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:07:00,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:07:00,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:07:00,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 219 [2023-11-12 02:07:00,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 144 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-12 02:07:00,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:07:00,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 219 [2023-11-12 02:07:00,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:07:00,815 INFO L124 PetriNetUnfolderBase]: 177/350 cut-off events. [2023-11-12 02:07:00,815 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2023-11-12 02:07:00,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 350 events. 177/350 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1475 event pairs, 39 based on Foata normal form. 31/376 useless extension candidates. Maximal degree in co-relation 1173. Up to 128 conditions per place. [2023-11-12 02:07:00,819 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 45 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-11-12 02:07:00,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 367 flow [2023-11-12 02:07:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:07:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:07:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2023-11-12 02:07:00,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5570776255707762 [2023-11-12 02:07:00,823 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2023-11-12 02:07:00,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2023-11-12 02:07:00,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:07:00,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2023-11-12 02:07:00,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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-12 02:07:00,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:07:00,829 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:07:00,829 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 144 flow. Second operand 4 states and 488 transitions. [2023-11-12 02:07:00,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 367 flow [2023-11-12 02:07:00,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:07:00,833 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 180 flow [2023-11-12 02:07:00,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-11-12 02:07:00,834 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2023-11-12 02:07:00,835 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 180 flow [2023-11-12 02:07:00,835 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-12 02:07:00,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:07:00,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:07:00,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:07:00,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:07:00,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1999715533, now seen corresponding path program 1 times [2023-11-12 02:07:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:00,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093278155] [2023-11-12 02:07:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:00,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:01,081 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-12 02:07:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:07:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093278155] [2023-11-12 02:07:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093278155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:07:01,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:07:01,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:07:01,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605206030] [2023-11-12 02:07:01,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:07:01,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:07:01,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:07:01,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:07:01,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:07:01,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 219 [2023-11-12 02:07:01,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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-12 02:07:01,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:07:01,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 219 [2023-11-12 02:07:01,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:07:01,273 INFO L124 PetriNetUnfolderBase]: 153/300 cut-off events. [2023-11-12 02:07:01,274 INFO L125 PetriNetUnfolderBase]: For 559/559 co-relation queries the response was YES. [2023-11-12 02:07:01,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 300 events. 153/300 cut-off events. For 559/559 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1275 event pairs, 36 based on Foata normal form. 10/305 useless extension candidates. Maximal degree in co-relation 1070. Up to 128 conditions per place. [2023-11-12 02:07:01,277 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 42 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2023-11-12 02:07:01,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 391 flow [2023-11-12 02:07:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:07:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:07:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-11-12 02:07:01,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.547945205479452 [2023-11-12 02:07:01,281 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-11-12 02:07:01,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-11-12 02:07:01,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:07:01,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-11-12 02:07:01,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:07:01,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:07:01,287 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:07:01,287 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 180 flow. Second operand 5 states and 600 transitions. [2023-11-12 02:07:01,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 391 flow [2023-11-12 02:07:01,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 351 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-12 02:07:01,293 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 176 flow [2023-11-12 02:07:01,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-11-12 02:07:01,296 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2023-11-12 02:07:01,296 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 176 flow [2023-11-12 02:07:01,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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-12 02:07:01,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:07:01,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:07:01,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:07:01,297 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-12 02:07:01,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash 136374748, now seen corresponding path program 1 times [2023-11-12 02:07:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083135388] [2023-11-12 02:07:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:07:01,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:07:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:07:01,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:07:01,530 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:07:01,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-12 02:07:01,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-12 02:07:01,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-12 02:07:01,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-12 02:07:01,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:07:01,534 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:07:01,539 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:07:01,539 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:07:01,616 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-11-12 02:07:01,618 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-11-12 02:07:01,625 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated [2023-11-12 02:07:01,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:07:01 BasicIcfg [2023-11-12 02:07:01,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:07:01,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:07:01,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:07:01,645 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:07:01,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:06:42" (3/4) ... [2023-11-12 02:07:01,646 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:07:01,693 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-11-12 02:07:01,699 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-11-12 02:07:01,703 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated [2023-11-12 02:07:01,792 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:07:01,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:07:01,793 INFO L158 Benchmark]: Toolchain (without parser) took 21340.58ms. Allocated memory was 113.2MB in the beginning and 318.8MB in the end (delta: 205.5MB). Free memory was 68.1MB in the beginning and 266.1MB in the end (delta: -198.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,794 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 113.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:07:01,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 825.29ms. Allocated memory is still 113.2MB. Free memory was 68.1MB in the beginning and 43.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.03ms. Allocated memory is still 113.2MB. Free memory was 43.0MB in the beginning and 40.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,795 INFO L158 Benchmark]: Boogie Preprocessor took 95.33ms. Allocated memory is still 113.2MB. Free memory was 40.8MB in the beginning and 83.3MB in the end (delta: -42.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,795 INFO L158 Benchmark]: RCFGBuilder took 1166.51ms. Allocated memory was 113.2MB in the beginning and 151.0MB in the end (delta: 37.7MB). Free memory was 83.3MB in the beginning and 103.0MB in the end (delta: -19.7MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,796 INFO L158 Benchmark]: TraceAbstraction took 19012.36ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 101.9MB in the beginning and 279.7MB in the end (delta: -177.8MB). Peak memory consumption was 174.5MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,796 INFO L158 Benchmark]: Witness Printer took 148.12ms. Allocated memory is still 318.8MB. Free memory was 279.7MB in the beginning and 266.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,798 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.52ms. Allocated memory is still 113.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 825.29ms. Allocated memory is still 113.2MB. Free memory was 68.1MB in the beginning and 43.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.03ms. Allocated memory is still 113.2MB. Free memory was 43.0MB in the beginning and 40.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.33ms. Allocated memory is still 113.2MB. Free memory was 40.8MB in the beginning and 83.3MB in the end (delta: -42.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1166.51ms. Allocated memory was 113.2MB in the beginning and 151.0MB in the end (delta: 37.7MB). Free memory was 83.3MB in the beginning and 103.0MB in the end (delta: -19.7MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19012.36ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 101.9MB in the beginning and 279.7MB in the end (delta: -177.8MB). Peak memory consumption was 174.5MB. Max. memory is 16.1GB. * Witness Printer took 148.12ms. Allocated memory is still 318.8MB. Free memory was 279.7MB in the beginning and 266.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8s, 118 PlacesBefore, 29 PlacesAfterwards, 109 TransitionsBefore, 19 TransitionsAfterwards, 1190 CoEnabledTransitionPairs, 8 FixpointIterations, 56 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 3065 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1445, independent: 1278, independent conditional: 0, independent unconditional: 1278, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 626, independent: 587, independent conditional: 0, independent unconditional: 587, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1445, independent: 691, independent conditional: 0, independent unconditional: 691, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 626, unknown conditional: 0, unknown unconditional: 626] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L850] 0 pthread_t t1682; [L851] FCALL, FORK 0 pthread_create(&t1682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] 0 pthread_t t1683; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] EXPR 2 \read(x) [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L853] FCALL, FORK 0 pthread_create(&t1683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 632 IncrementalHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 74 mSDtfsCounter, 632 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-12 02:07:01,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eb8d3f6-4948-487a-8342-f109d58d33e3/bin/uautomizer-verify-uTZkv6EMXl/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