./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu --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 bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:03:46,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:03:46,428 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:03:46,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:03:46,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:03:46,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:03:46,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:03:46,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:03:46,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:03:46,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:03:46,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:03:46,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:03:46,469 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:03:46,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:03:46,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:03:46,471 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:03:46,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:03:46,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:03:46,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:03:46,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:03:46,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:03:46,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:03:46,474 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:03:46,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:03:46,475 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:03:46,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:03:46,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:03:46,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:03:46,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:46,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:03:46,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:03:46,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:03:46,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:03:46,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:03:46,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:03:46,479 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:03:46,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:03:46,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:03:46,480 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:03:46,480 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_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/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_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu 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 -> bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 [2023-11-19 08:03:46,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:03:46,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:03:46,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:03:46,801 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:03:46,802 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:03:46,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-19 08:03:49,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:03:50,268 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:03:50,269 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-19 08:03:50,288 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/data/ac5be95ff/fabcc81f3be6430bad4ae25253f34ebf/FLAG5bd0d629a [2023-11-19 08:03:50,304 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/data/ac5be95ff/fabcc81f3be6430bad4ae25253f34ebf [2023-11-19 08:03:50,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:03:50,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:03:50,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:50,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:03:50,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:03:50,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:50" (1/1) ... [2023-11-19 08:03:50,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c50411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:50, skipping insertion in model container [2023-11-19 08:03:50,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:50" (1/1) ... [2023-11-19 08:03:50,382 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:03:50,632 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_1c25deea-d428-4cc4-b394-7380caa6b5d1/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2023-11-19 08:03:50,944 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:50,961 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:03:50,986 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_1c25deea-d428-4cc4-b394-7380caa6b5d1/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2023-11-19 08:03:51,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:51,158 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:03:51,158 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:03:51,167 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:03:51,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51 WrapperNode [2023-11-19 08:03:51,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:51,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:51,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:03:51,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:03:51,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,251 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-19 08:03:51,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:51,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:03:51,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:03:51,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:03:51,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:03:51,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:03:51,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:03:51,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:03:51,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (1/1) ... [2023-11-19 08:03:51,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:51,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:51,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:51,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:03:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:03:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:03:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:03:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:03:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:03:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:03:51,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:03:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:03:51,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:03:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:03:51,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:03:51,400 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 08:03:51,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 08:03:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:03:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:03:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:03:51,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:03:51,403 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:03:51,635 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:03:51,639 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:03:52,143 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:03:52,437 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:03:52,437 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:03:52,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:52 BoogieIcfgContainer [2023-11-19 08:03:52,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:03:52,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:03:52,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:03:52,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:03:52,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:03:50" (1/3) ... [2023-11-19 08:03:52,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2e0e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:52, skipping insertion in model container [2023-11-19 08:03:52,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:51" (2/3) ... [2023-11-19 08:03:52,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2e0e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:52, skipping insertion in model container [2023-11-19 08:03:52,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:52" (3/3) ... [2023-11-19 08:03:52,454 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-19 08:03:52,463 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 08:03:52,475 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:03:52,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 08:03:52,476 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:03:52,538 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:03:52,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 134 transitions, 284 flow [2023-11-19 08:03:52,646 INFO L124 PetriNetUnfolderBase]: 3/130 cut-off events. [2023-11-19 08:03:52,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:52,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 3/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-19 08:03:52,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 134 transitions, 284 flow [2023-11-19 08:03:52,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 130 transitions, 272 flow [2023-11-19 08:03:52,665 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:03:52,676 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 130 transitions, 272 flow [2023-11-19 08:03:52,680 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 130 transitions, 272 flow [2023-11-19 08:03:52,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 130 transitions, 272 flow [2023-11-19 08:03:52,716 INFO L124 PetriNetUnfolderBase]: 3/130 cut-off events. [2023-11-19 08:03:52,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:52,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 3/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-19 08:03:52,721 INFO L119 LiptonReduction]: Number of co-enabled transitions 3560 [2023-11-19 08:03:57,780 INFO L134 LiptonReduction]: Checked pairs total: 9611 [2023-11-19 08:03:57,780 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-11-19 08:03:57,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:03:57,805 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;@33f747eb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:03:57,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-19 08:03:57,808 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:03:57,809 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-19 08:03:57,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:57,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:57,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 08:03:57,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:03:57,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 561345, now seen corresponding path program 1 times [2023-11-19 08:03:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:57,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949627362] [2023-11-19 08:03:57,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:57,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:58,404 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-19 08:03:58,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:58,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949627362] [2023-11-19 08:03:58,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949627362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:58,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:58,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:03:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126820414] [2023-11-19 08:03:58,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:58,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:58,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:58,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:58,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:58,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 246 [2023-11-19 08:03:58,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-19 08:03:58,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:58,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 246 [2023-11-19 08:03:58,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:59,862 INFO L124 PetriNetUnfolderBase]: 4903/6758 cut-off events. [2023-11-19 08:03:59,862 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-11-19 08:03:59,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13606 conditions, 6758 events. 4903/6758 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32801 event pairs, 2535 based on Foata normal form. 0/6422 useless extension candidates. Maximal degree in co-relation 13594. Up to 5335 conditions per place. [2023-11-19 08:03:59,923 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-11-19 08:03:59,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-11-19 08:03:59,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:03:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-11-19 08:03:59,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.540650406504065 [2023-11-19 08:03:59,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-11-19 08:03:59,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-11-19 08:03:59,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:59,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-11-19 08:03:59,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-19 08:03:59,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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-19 08:03:59,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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-19 08:03:59,961 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 399 transitions. [2023-11-19 08:03:59,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-11-19 08:03:59,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 08:03:59,968 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-11-19 08:03:59,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-19 08:03:59,975 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-19 08:03:59,975 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-11-19 08:03:59,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-19 08:03:59,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:59,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:59,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:03:59,977 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:03:59,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash 711240117, now seen corresponding path program 1 times [2023-11-19 08:03:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:59,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657563289] [2023-11-19 08:03:59,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:59,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:00,355 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-19 08:04:00,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:00,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657563289] [2023-11-19 08:04:00,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657563289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:00,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:00,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:04:00,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873673891] [2023-11-19 08:04:00,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:00,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:04:00,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:00,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:04:00,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:04:00,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-11-19 08:04:00,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-19 08:04:00,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:00,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-11-19 08:04:00,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:04,058 INFO L124 PetriNetUnfolderBase]: 16167/22000 cut-off events. [2023-11-19 08:04:04,059 INFO L125 PetriNetUnfolderBase]: For 1094/1094 co-relation queries the response was YES. [2023-11-19 08:04:04,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45567 conditions, 22000 events. 16167/22000 cut-off events. For 1094/1094 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 115742 event pairs, 5981 based on Foata normal form. 634/22634 useless extension candidates. Maximal degree in co-relation 45557. Up to 12890 conditions per place. [2023-11-19 08:04:04,245 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-11-19 08:04:04,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2023-11-19 08:04:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:04:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:04:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-11-19 08:04:04,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508130081300813 [2023-11-19 08:04:04,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-11-19 08:04:04,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-11-19 08:04:04,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:04,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-11-19 08:04:04,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-19 08:04:04,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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-19 08:04:04,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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-19 08:04:04,257 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 375 transitions. [2023-11-19 08:04:04,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2023-11-19 08:04:04,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:04,261 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 126 flow [2023-11-19 08:04:04,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-11-19 08:04:04,263 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-11-19 08:04:04,263 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 126 flow [2023-11-19 08:04:04,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-19 08:04:04,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:04,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:04,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:04:04,265 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:04:04,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash 573605781, now seen corresponding path program 1 times [2023-11-19 08:04:04,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:04,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435787487] [2023-11-19 08:04:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:04,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-19 08:04:04,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:04,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435787487] [2023-11-19 08:04:04,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435787487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:04,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529850537] [2023-11-19 08:04:04,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:04,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:04,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:04,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:04,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-11-19 08:04:04,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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-19 08:04:04,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:04,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-11-19 08:04:04,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:07,605 INFO L124 PetriNetUnfolderBase]: 15851/21572 cut-off events. [2023-11-19 08:04:07,605 INFO L125 PetriNetUnfolderBase]: For 8069/8069 co-relation queries the response was YES. [2023-11-19 08:04:07,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54174 conditions, 21572 events. 15851/21572 cut-off events. For 8069/8069 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 112341 event pairs, 1254 based on Foata normal form. 40/21612 useless extension candidates. Maximal degree in co-relation 54162. Up to 11912 conditions per place. [2023-11-19 08:04:07,752 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 57 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2023-11-19 08:04:07,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 366 flow [2023-11-19 08:04:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-11-19 08:04:07,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010162601626016 [2023-11-19 08:04:07,758 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-11-19 08:04:07,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-11-19 08:04:07,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:07,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-11-19 08:04:07,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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-19 08:04:07,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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-19 08:04:07,767 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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-19 08:04:07,767 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 126 flow. Second operand 4 states and 493 transitions. [2023-11-19 08:04:07,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 366 flow [2023-11-19 08:04:07,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:07,840 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 198 flow [2023-11-19 08:04:07,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-11-19 08:04:07,842 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-11-19 08:04:07,846 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 198 flow [2023-11-19 08:04:07,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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-19 08:04:07,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:07,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:07,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:04:07,848 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:04:07,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:07,849 INFO L85 PathProgramCache]: Analyzing trace with hash 573605037, now seen corresponding path program 1 times [2023-11-19 08:04:07,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:07,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513862384] [2023-11-19 08:04:07,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:08,096 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-19 08:04:08,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:08,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513862384] [2023-11-19 08:04:08,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513862384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:08,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:08,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:04:08,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557903343] [2023-11-19 08:04:08,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:08,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:04:08,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:08,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:04:08,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:04:08,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246 [2023-11-19 08:04:08,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-19 08:04:08,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:08,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246 [2023-11-19 08:04:08,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:10,902 INFO L124 PetriNetUnfolderBase]: 12379/17840 cut-off events. [2023-11-19 08:04:10,902 INFO L125 PetriNetUnfolderBase]: For 11117/11187 co-relation queries the response was YES. [2023-11-19 08:04:10,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45861 conditions, 17840 events. 12379/17840 cut-off events. For 11117/11187 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 105316 event pairs, 3764 based on Foata normal form. 74/17806 useless extension candidates. Maximal degree in co-relation 45846. Up to 15768 conditions per place. [2023-11-19 08:04:11,021 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 47 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2023-11-19 08:04:11,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 380 flow [2023-11-19 08:04:11,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:04:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:04:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-11-19 08:04:11,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524390243902439 [2023-11-19 08:04:11,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-11-19 08:04:11,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-11-19 08:04:11,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:11,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-11-19 08:04:11,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-19 08:04:11,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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-19 08:04:11,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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-19 08:04:11,029 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 198 flow. Second operand 3 states and 387 transitions. [2023-11-19 08:04:11,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 380 flow [2023-11-19 08:04:11,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:11,090 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 256 flow [2023-11-19 08:04:11,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-11-19 08:04:11,091 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-11-19 08:04:11,092 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 256 flow [2023-11-19 08:04:11,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-19 08:04:11,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:11,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:11,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:04:11,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:04:11,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash 601907917, now seen corresponding path program 1 times [2023-11-19 08:04:11,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:11,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282768342] [2023-11-19 08:04:11,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:11,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:11,301 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-19 08:04:11,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282768342] [2023-11-19 08:04:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282768342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:11,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:11,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132369087] [2023-11-19 08:04:11,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:11,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:11,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:11,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:11,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-11-19 08:04:11,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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-19 08:04:11,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:11,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-11-19 08:04:11,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:14,272 INFO L124 PetriNetUnfolderBase]: 14712/20031 cut-off events. [2023-11-19 08:04:14,272 INFO L125 PetriNetUnfolderBase]: For 20208/20208 co-relation queries the response was YES. [2023-11-19 08:04:14,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56311 conditions, 20031 events. 14712/20031 cut-off events. For 20208/20208 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 102012 event pairs, 3683 based on Foata normal form. 160/20191 useless extension candidates. Maximal degree in co-relation 56293. Up to 8438 conditions per place. [2023-11-19 08:04:14,411 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 70 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2023-11-19 08:04:14,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 532 flow [2023-11-19 08:04:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2023-11-19 08:04:14,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2023-11-19 08:04:14,414 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2023-11-19 08:04:14,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2023-11-19 08:04:14,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:14,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2023-11-19 08:04:14,417 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-19 08:04:14,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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-19 08:04:14,421 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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-19 08:04:14,421 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 256 flow. Second operand 4 states and 488 transitions. [2023-11-19 08:04:14,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 532 flow [2023-11-19 08:04:14,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 79 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:14,502 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 342 flow [2023-11-19 08:04:14,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=342, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2023-11-19 08:04:14,504 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-11-19 08:04:14,504 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 342 flow [2023-11-19 08:04:14,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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-19 08:04:14,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:14,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:14,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:04:14,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:04:14,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash -796134641, now seen corresponding path program 1 times [2023-11-19 08:04:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508484101] [2023-11-19 08:04:14,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:14,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:14,779 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-19 08:04:14,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508484101] [2023-11-19 08:04:14,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508484101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:14,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:14,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:14,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715845021] [2023-11-19 08:04:14,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:14,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:14,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:14,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:14,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:14,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 246 [2023-11-19 08:04:14,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 342 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 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-19 08:04:14,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:14,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 246 [2023-11-19 08:04:14,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:16,842 INFO L124 PetriNetUnfolderBase]: 9094/13546 cut-off events. [2023-11-19 08:04:16,842 INFO L125 PetriNetUnfolderBase]: For 17810/18643 co-relation queries the response was YES. [2023-11-19 08:04:16,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36986 conditions, 13546 events. 9094/13546 cut-off events. For 17810/18643 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 85073 event pairs, 1426 based on Foata normal form. 1320/14718 useless extension candidates. Maximal degree in co-relation 36964. Up to 8222 conditions per place. [2023-11-19 08:04:16,942 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 94 selfloop transitions, 10 changer transitions 0/123 dead transitions. [2023-11-19 08:04:16,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 123 transitions, 902 flow [2023-11-19 08:04:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:04:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:04:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-11-19 08:04:16,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975609756097561 [2023-11-19 08:04:16,948 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-11-19 08:04:16,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-11-19 08:04:16,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:16,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-11-19 08:04:16,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 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-19 08:04:16,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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-19 08:04:16,960 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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-19 08:04:16,961 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 342 flow. Second operand 5 states and 612 transitions. [2023-11-19 08:04:16,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 123 transitions, 902 flow [2023-11-19 08:04:16,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 123 transitions, 899 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:17,000 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 414 flow [2023-11-19 08:04:17,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=414, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2023-11-19 08:04:17,003 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-11-19 08:04:17,003 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 414 flow [2023-11-19 08:04:17,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 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-19 08:04:17,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:17,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:17,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:04:17,005 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:04:17,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1789283482, now seen corresponding path program 1 times [2023-11-19 08:04:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:17,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507051484] [2023-11-19 08:04:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:17,294 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-19 08:04:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507051484] [2023-11-19 08:04:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507051484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:17,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222752235] [2023-11-19 08:04:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:17,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:17,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:17,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 246 [2023-11-19 08:04:17,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 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-19 08:04:17,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:17,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 246 [2023-11-19 08:04:17,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:18,997 INFO L124 PetriNetUnfolderBase]: 7301/11198 cut-off events. [2023-11-19 08:04:18,997 INFO L125 PetriNetUnfolderBase]: For 18099/18697 co-relation queries the response was YES. [2023-11-19 08:04:19,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37816 conditions, 11198 events. 7301/11198 cut-off events. For 18099/18697 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 71803 event pairs, 762 based on Foata normal form. 886/11963 useless extension candidates. Maximal degree in co-relation 37790. Up to 3406 conditions per place. [2023-11-19 08:04:19,082 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 132 selfloop transitions, 19 changer transitions 0/170 dead transitions. [2023-11-19 08:04:19,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 170 transitions, 1330 flow [2023-11-19 08:04:19,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:04:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:04:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 859 transitions. [2023-11-19 08:04:19,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988385598141696 [2023-11-19 08:04:19,086 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 859 transitions. [2023-11-19 08:04:19,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 859 transitions. [2023-11-19 08:04:19,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:19,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 859 transitions. [2023-11-19 08:04:19,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 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-19 08:04:19,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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-19 08:04:19,096 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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-19 08:04:19,096 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 414 flow. Second operand 7 states and 859 transitions. [2023-11-19 08:04:19,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 170 transitions, 1330 flow [2023-11-19 08:04:19,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 170 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:19,165 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 543 flow [2023-11-19 08:04:19,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=543, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2023-11-19 08:04:19,166 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-11-19 08:04:19,167 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 543 flow [2023-11-19 08:04:19,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 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-19 08:04:19,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:19,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:19,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:04:19,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:04:19,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash -390670907, now seen corresponding path program 1 times [2023-11-19 08:04:19,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:19,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445231148] [2023-11-19 08:04:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:19,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:19,479 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-19 08:04:19,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:19,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445231148] [2023-11-19 08:04:19,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445231148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:19,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:19,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:19,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630982171] [2023-11-19 08:04:19,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:19,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:19,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:19,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:19,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:19,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-11-19 08:04:19,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 543 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-19 08:04:19,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:19,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-11-19 08:04:19,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:22,663 INFO L124 PetriNetUnfolderBase]: 14875/21606 cut-off events. [2023-11-19 08:04:22,663 INFO L125 PetriNetUnfolderBase]: For 75021/75021 co-relation queries the response was YES. [2023-11-19 08:04:22,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89712 conditions, 21606 events. 14875/21606 cut-off events. For 75021/75021 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 131909 event pairs, 2692 based on Foata normal form. 76/21682 useless extension candidates. Maximal degree in co-relation 89682. Up to 9764 conditions per place. [2023-11-19 08:04:22,767 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 92 selfloop transitions, 22 changer transitions 40/154 dead transitions. [2023-11-19 08:04:22,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 154 transitions, 1453 flow [2023-11-19 08:04:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-11-19 08:04:22,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5101626016260162 [2023-11-19 08:04:22,770 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-11-19 08:04:22,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-11-19 08:04:22,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:22,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-11-19 08:04:22,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 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-19 08:04:22,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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-19 08:04:22,776 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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-19 08:04:22,776 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 543 flow. Second operand 4 states and 502 transitions. [2023-11-19 08:04:22,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 154 transitions, 1453 flow [2023-11-19 08:04:24,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 154 transitions, 1307 flow, removed 51 selfloop flow, removed 3 redundant places. [2023-11-19 08:04:24,324 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 538 flow [2023-11-19 08:04:24,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=538, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2023-11-19 08:04:24,328 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-11-19 08:04:24,329 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 538 flow [2023-11-19 08:04:24,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-19 08:04:24,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:24,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:24,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:04:24,330 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:04:24,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1097247082, now seen corresponding path program 1 times [2023-11-19 08:04:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:24,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041406402] [2023-11-19 08:04:24,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:24,673 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-19 08:04:24,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:24,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041406402] [2023-11-19 08:04:24,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041406402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:24,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:24,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:24,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403928801] [2023-11-19 08:04:24,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:24,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:24,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:24,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:24,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:24,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 246 [2023-11-19 08:04:24,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 538 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 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-19 08:04:24,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:24,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 246 [2023-11-19 08:04:24,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:26,124 INFO L124 PetriNetUnfolderBase]: 4174/6702 cut-off events. [2023-11-19 08:04:26,124 INFO L125 PetriNetUnfolderBase]: For 15605/15887 co-relation queries the response was YES. [2023-11-19 08:04:26,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23814 conditions, 6702 events. 4174/6702 cut-off events. For 15605/15887 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 42206 event pairs, 817 based on Foata normal form. 473/7064 useless extension candidates. Maximal degree in co-relation 23782. Up to 2269 conditions per place. [2023-11-19 08:04:26,185 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 112 selfloop transitions, 18 changer transitions 18/168 dead transitions. [2023-11-19 08:04:26,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 168 transitions, 1570 flow [2023-11-19 08:04:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:04:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:04:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2023-11-19 08:04:26,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4994192799070848 [2023-11-19 08:04:26,204 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 860 transitions. [2023-11-19 08:04:26,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 860 transitions. [2023-11-19 08:04:26,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:26,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 860 transitions. [2023-11-19 08:04:26,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 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-19 08:04:26,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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-19 08:04:26,214 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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-19 08:04:26,214 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 538 flow. Second operand 7 states and 860 transitions. [2023-11-19 08:04:26,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 168 transitions, 1570 flow [2023-11-19 08:04:26,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 168 transitions, 1508 flow, removed 31 selfloop flow, removed 3 redundant places. [2023-11-19 08:04:26,278 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 654 flow [2023-11-19 08:04:26,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=654, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2023-11-19 08:04:26,279 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-11-19 08:04:26,279 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 654 flow [2023-11-19 08:04:26,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 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-19 08:04:26,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:26,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:26,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:04:26,280 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:04:26,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash 819055927, now seen corresponding path program 1 times [2023-11-19 08:04:26,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607702162] [2023-11-19 08:04:26,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:27,707 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-19 08:04:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:27,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607702162] [2023-11-19 08:04:27,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607702162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:27,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:27,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:27,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112162780] [2023-11-19 08:04:27,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:27,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:04:27,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:04:27,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:04:27,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-11-19 08:04:27,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 654 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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-19 08:04:27,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:27,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-11-19 08:04:27,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:29,748 INFO L124 PetriNetUnfolderBase]: 5812/9340 cut-off events. [2023-11-19 08:04:29,748 INFO L125 PetriNetUnfolderBase]: For 24242/24610 co-relation queries the response was YES. [2023-11-19 08:04:29,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36148 conditions, 9340 events. 5812/9340 cut-off events. For 24242/24610 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 62499 event pairs, 657 based on Foata normal form. 170/9334 useless extension candidates. Maximal degree in co-relation 36114. Up to 5737 conditions per place. [2023-11-19 08:04:29,819 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 124 selfloop transitions, 11 changer transitions 54/209 dead transitions. [2023-11-19 08:04:29,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 209 transitions, 2080 flow [2023-11-19 08:04:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:04:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:04:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2023-11-19 08:04:29,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127758420441347 [2023-11-19 08:04:29,824 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2023-11-19 08:04:29,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2023-11-19 08:04:29,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:29,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2023-11-19 08:04:29,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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-19 08:04:29,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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-19 08:04:29,834 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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-19 08:04:29,834 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 654 flow. Second operand 7 states and 883 transitions. [2023-11-19 08:04:29,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 209 transitions, 2080 flow [2023-11-19 08:04:30,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 209 transitions, 1843 flow, removed 94 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:30,269 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 703 flow [2023-11-19 08:04:30,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=703, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2023-11-19 08:04:30,270 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2023-11-19 08:04:30,270 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 703 flow [2023-11-19 08:04:30,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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-19 08:04:30,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:30,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:30,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:04:30,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:04:30,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash 784775151, now seen corresponding path program 2 times [2023-11-19 08:04:30,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:30,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553989931] [2023-11-19 08:04:30,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:30,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:30,743 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-19 08:04:30,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:30,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553989931] [2023-11-19 08:04:30,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553989931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:30,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:30,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:04:30,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541819980] [2023-11-19 08:04:30,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:30,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:04:30,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:30,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:04:30,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:04:30,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 246 [2023-11-19 08:04:30,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 703 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 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-19 08:04:30,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:30,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 246 [2023-11-19 08:04:30,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:32,616 INFO L124 PetriNetUnfolderBase]: 4911/7861 cut-off events. [2023-11-19 08:04:32,617 INFO L125 PetriNetUnfolderBase]: For 19664/20048 co-relation queries the response was YES. [2023-11-19 08:04:32,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30703 conditions, 7861 events. 4911/7861 cut-off events. For 19664/20048 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 51240 event pairs, 694 based on Foata normal form. 224/7958 useless extension candidates. Maximal degree in co-relation 30669. Up to 2776 conditions per place. [2023-11-19 08:04:32,677 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 114 selfloop transitions, 23 changer transitions 35/189 dead transitions. [2023-11-19 08:04:32,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 189 transitions, 1830 flow [2023-11-19 08:04:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 08:04:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 08:04:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1077 transitions. [2023-11-19 08:04:32,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48644986449864497 [2023-11-19 08:04:32,683 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1077 transitions. [2023-11-19 08:04:32,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1077 transitions. [2023-11-19 08:04:32,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:32,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1077 transitions. [2023-11-19 08:04:32,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 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-19 08:04:32,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 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-19 08:04:32,695 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 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-19 08:04:32,695 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 703 flow. Second operand 9 states and 1077 transitions. [2023-11-19 08:04:32,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 189 transitions, 1830 flow [2023-11-19 08:04:32,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 189 transitions, 1800 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-19 08:04:32,970 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 696 flow [2023-11-19 08:04:32,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=696, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2023-11-19 08:04:32,971 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-11-19 08:04:32,972 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 696 flow [2023-11-19 08:04:32,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 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-19 08:04:32,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:32,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:32,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:04:32,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 08:04:32,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:32,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1236996073, now seen corresponding path program 1 times [2023-11-19 08:04:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:32,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899309150] [2023-11-19 08:04:32,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:32,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:33,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:04:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:33,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:04:33,153 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:04:33,154 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-19 08:04:33,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-19 08:04:33,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-19 08:04:33,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-19 08:04:33,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-19 08:04:33,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-19 08:04:33,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-19 08:04:33,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:04:33,158 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:33,164 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:04:33,165 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:04:33,247 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:04:33,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 08:04:33,264 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 08:04:33,271 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 08:04:33,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:04:33 BasicIcfg [2023-11-19 08:04:33,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:04:33,302 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:04:33,302 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:04:33,302 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:04:33,303 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:52" (3/4) ... [2023-11-19 08:04:33,304 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 08:04:33,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:04:33,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 08:04:33,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 08:04:33,350 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 08:04:33,430 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 08:04:33,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:04:33,430 INFO L158 Benchmark]: Toolchain (without parser) took 43122.09ms. Allocated memory was 180.4MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 146.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2023-11-19 08:04:33,431 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 138.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:04:33,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 858.24ms. Allocated memory is still 180.4MB. Free memory was 146.0MB in the beginning and 121.5MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 08:04:33,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.95ms. Allocated memory is still 180.4MB. Free memory was 121.5MB in the beginning and 118.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 08:04:33,432 INFO L158 Benchmark]: Boogie Preprocessor took 40.64ms. Allocated memory is still 180.4MB. Free memory was 118.7MB in the beginning and 116.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:04:33,432 INFO L158 Benchmark]: RCFGBuilder took 1148.25ms. Allocated memory is still 180.4MB. Free memory was 116.6MB in the beginning and 141.0MB in the end (delta: -24.4MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2023-11-19 08:04:33,433 INFO L158 Benchmark]: TraceAbstraction took 40857.14ms. Allocated memory was 180.4MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 140.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2023-11-19 08:04:33,433 INFO L158 Benchmark]: Witness Printer took 128.12ms. Allocated memory is still 6.9GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-19 08:04:33,435 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.25ms. Allocated memory is still 138.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 858.24ms. Allocated memory is still 180.4MB. Free memory was 146.0MB in the beginning and 121.5MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.95ms. Allocated memory is still 180.4MB. Free memory was 121.5MB in the beginning and 118.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.64ms. Allocated memory is still 180.4MB. Free memory was 118.7MB in the beginning and 116.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1148.25ms. Allocated memory is still 180.4MB. Free memory was 116.6MB in the beginning and 141.0MB in the end (delta: -24.4MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * TraceAbstraction took 40857.14ms. Allocated memory was 180.4MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 140.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 128.12ms. Allocated memory is still 6.9GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 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: 5.1s, 140 PlacesBefore, 43 PlacesAfterwards, 130 TransitionsBefore, 31 TransitionsAfterwards, 3560 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 9611 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3753, independent: 3502, independent conditional: 0, independent unconditional: 3502, dependent: 251, dependent conditional: 0, dependent unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1896, independent: 1843, independent conditional: 0, independent unconditional: 1843, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3753, independent: 1659, independent conditional: 0, independent unconditional: 1659, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 1896, unknown conditional: 0, unknown unconditional: 1896] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t769; [L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t770; [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t769={5:0}, t770={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t771; [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t769={5:0}, t770={6:0}, t771={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L870] 0 pthread_t t772; [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=1, y=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=1, y=2, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=1, y=2, z=1] [L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=1, y=2, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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$$choice2=0, x=1, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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$$choice2=0, x=1, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice2=0, x=1, y=2, z=2] [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 865]: 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: 869]: 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: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 599 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 481 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1365 IncrementalHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 60 mSDtfsCounter, 1365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=703occurred in iteration=10, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-19 08:04:33,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c25deea-d428-4cc4-b394-7380caa6b5d1/bin/uautomizer-verify-uCwYo4JHxu/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