./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme --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 b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:56:14,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:56:14,642 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:56:14,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:56:14,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:56:14,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:56:14,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:56:14,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:56:14,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:56:14,694 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:56:14,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:56:14,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:56:14,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:56:14,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:56:14,701 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:56:14,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:56:14,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:56:14,702 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:56:14,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:56:14,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:56:14,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:56:14,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:56:14,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:56:14,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:56:14,706 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:56:14,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:56:14,707 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:56:14,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:56:14,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:56:14,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:56:14,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:56:14,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:56:14,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:56:14,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:56:14,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:56:14,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:56:14,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:56:14,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:56:14,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:56:14,713 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:56:14,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:56:14,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:56:14,714 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_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/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_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme 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 -> b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e [2023-11-26 11:56:14,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:56:15,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:56:15,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:56:15,016 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:56:15,016 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:56:15,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2023-11-26 11:56:18,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:56:18,503 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:56:18,503 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2023-11-26 11:56:18,523 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/data/e1059fceb/2b52072053d942bca86e18abba20447a/FLAGd8f290be8 [2023-11-26 11:56:18,544 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/data/e1059fceb/2b52072053d942bca86e18abba20447a [2023-11-26 11:56:18,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:56:18,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:56:18,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:56:18,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:56:18,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:56:18,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2412c851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18, skipping insertion in model container [2023-11-26 11:56:18,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,647 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:56:18,806 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_6f4f0eee-8168-4290-9488-d0cf8302ca31/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2023-11-26 11:56:19,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:56:19,166 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:56:19,178 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_6f4f0eee-8168-4290-9488-d0cf8302ca31/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2023-11-26 11:56:19,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:56:19,263 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:56:19,263 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:56:19,271 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:56:19,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19 WrapperNode [2023-11-26 11:56:19,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:56:19,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:56:19,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:56:19,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:56:19,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,356 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-11-26 11:56:19,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:56:19,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:56:19,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:56:19,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:56:19,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,431 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-26 11:56:19,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:56:19,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:56:19,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:56:19,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:56:19,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (1/1) ... [2023-11-26 11:56:19,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:56:19,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:19,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:56:19,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:56:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:56:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:56:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:56:19,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:56:19,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:56:19,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:56:19,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:56:19,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:56:19,581 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:56:19,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:56:19,581 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:56:19,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:56:19,582 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:56:19,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:56:19,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:56:19,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:56:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:56:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:56:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:56:19,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:56:19,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:56:19,587 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:56:19,883 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:56:19,887 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:56:20,303 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:56:20,630 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:56:20,630 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:56:20,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:20 BoogieIcfgContainer [2023-11-26 11:56:20,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:56:20,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:56:20,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:56:20,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:56:20,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:56:18" (1/3) ... [2023-11-26 11:56:20,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f61661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:56:20, skipping insertion in model container [2023-11-26 11:56:20,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:19" (2/3) ... [2023-11-26 11:56:20,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f61661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:56:20, skipping insertion in model container [2023-11-26 11:56:20,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:20" (3/3) ... [2023-11-26 11:56:20,645 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2023-11-26 11:56:20,658 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:56:20,671 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:56:20,672 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-26 11:56:20,672 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:56:20,745 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:56:20,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2023-11-26 11:56:20,844 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-11-26 11:56:20,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:56:20,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-26 11:56:20,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2023-11-26 11:56:20,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2023-11-26 11:56:20,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:56:20,882 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;@6670cbde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:56:20,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-26 11:56:20,892 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:56:20,892 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-26 11:56:20,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:56:20,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:20,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-26 11:56:20,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:20,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1856651692, now seen corresponding path program 1 times [2023-11-26 11:56:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:20,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075343482] [2023-11-26 11:56:20,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:20,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:21,523 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-26 11:56:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075343482] [2023-11-26 11:56:21,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075343482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:21,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:21,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:56:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595726656] [2023-11-26 11:56:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:21,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:56:21,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:21,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:56:21,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:56:21,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2023-11-26 11:56:21,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:21,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:21,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2023-11-26 11:56:21,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:21,971 INFO L124 PetriNetUnfolderBase]: 528/989 cut-off events. [2023-11-26 11:56:21,971 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-26 11:56:21,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 989 events. 528/989 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5918 event pairs, 168 based on Foata normal form. 36/988 useless extension candidates. Maximal degree in co-relation 1826. Up to 652 conditions per place. [2023-11-26 11:56:21,992 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 27 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-26 11:56:21,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 170 flow [2023-11-26 11:56:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:56:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:56:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2023-11-26 11:56:22,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7642276422764228 [2023-11-26 11:56:22,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 94 transitions. [2023-11-26 11:56:22,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 94 transitions. [2023-11-26 11:56:22,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:22,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 94 transitions. [2023-11-26 11:56:22,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:22,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:22,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:22,038 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 94 transitions. [2023-11-26 11:56:22,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 170 flow [2023-11-26 11:56:22,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:56:22,050 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2023-11-26 11:56:22,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-11-26 11:56:22,059 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-11-26 11:56:22,060 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2023-11-26 11:56:22,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:22,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:22,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:22,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:56:22,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:22,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:22,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1127533048, now seen corresponding path program 1 times [2023-11-26 11:56:22,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:22,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603192302] [2023-11-26 11:56:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:22,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:23,492 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-26 11:56:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:23,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603192302] [2023-11-26 11:56:23,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603192302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:23,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:23,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:56:23,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016284689] [2023-11-26 11:56:23,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:23,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:56:23,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:23,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:56:23,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:56:23,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2023-11-26 11:56:23,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:23,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:23,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2023-11-26 11:56:23,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:24,909 INFO L124 PetriNetUnfolderBase]: 2571/4105 cut-off events. [2023-11-26 11:56:24,909 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2023-11-26 11:56:24,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8153 conditions, 4105 events. 2571/4105 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 25728 event pairs, 957 based on Foata normal form. 0/4002 useless extension candidates. Maximal degree in co-relation 8143. Up to 2352 conditions per place. [2023-11-26 11:56:24,945 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 38 selfloop transitions, 11 changer transitions 66/126 dead transitions. [2023-11-26 11:56:24,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 126 transitions, 518 flow [2023-11-26 11:56:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:56:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 11:56:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 272 transitions. [2023-11-26 11:56:24,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6031042128603105 [2023-11-26 11:56:24,952 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 272 transitions. [2023-11-26 11:56:24,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 272 transitions. [2023-11-26 11:56:24,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:24,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 272 transitions. [2023-11-26 11:56:24,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 24.727272727272727) internal successors, (272), 11 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:24,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 41.0) internal successors, (492), 12 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:24,960 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 41.0) internal successors, (492), 12 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:24,960 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 11 states and 272 transitions. [2023-11-26 11:56:24,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 126 transitions, 518 flow [2023-11-26 11:56:24,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 126 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:56:24,965 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 181 flow [2023-11-26 11:56:24,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=181, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2023-11-26 11:56:24,967 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2023-11-26 11:56:24,968 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 181 flow [2023-11-26 11:56:24,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:24,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:24,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:24,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:56:24,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:24,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1107018938, now seen corresponding path program 1 times [2023-11-26 11:56:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:24,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340397050] [2023-11-26 11:56:24,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:24,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,678 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-26 11:56:25,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:25,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340397050] [2023-11-26 11:56:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340397050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:25,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:25,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:56:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159800893] [2023-11-26 11:56:25,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:25,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:56:25,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:25,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:56:25,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:56:25,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-26 11:56:25,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:25,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:25,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-26 11:56:25,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:26,694 INFO L124 PetriNetUnfolderBase]: 1831/2978 cut-off events. [2023-11-26 11:56:26,694 INFO L125 PetriNetUnfolderBase]: For 4192/4335 co-relation queries the response was YES. [2023-11-26 11:56:26,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9801 conditions, 2978 events. 1831/2978 cut-off events. For 4192/4335 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17856 event pairs, 323 based on Foata normal form. 98/3031 useless extension candidates. Maximal degree in co-relation 9783. Up to 1829 conditions per place. [2023-11-26 11:56:26,736 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 42 selfloop transitions, 3 changer transitions 35/93 dead transitions. [2023-11-26 11:56:26,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 571 flow [2023-11-26 11:56:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:56:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:56:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2023-11-26 11:56:26,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6027874564459931 [2023-11-26 11:56:26,741 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 173 transitions. [2023-11-26 11:56:26,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 173 transitions. [2023-11-26 11:56:26,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:26,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 173 transitions. [2023-11-26 11:56:26,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:26,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:26,745 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:26,745 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 181 flow. Second operand 7 states and 173 transitions. [2023-11-26 11:56:26,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 571 flow [2023-11-26 11:56:26,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 93 transitions, 563 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-26 11:56:26,765 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 196 flow [2023-11-26 11:56:26,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-11-26 11:56:26,767 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2023-11-26 11:56:26,767 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 196 flow [2023-11-26 11:56:26,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:26,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:26,768 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-26 11:56:26,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:56:26,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:26,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1959256572, now seen corresponding path program 1 times [2023-11-26 11:56:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:26,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637791130] [2023-11-26 11:56:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:27,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-26 11:56:27,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:27,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637791130] [2023-11-26 11:56:27,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637791130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:27,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:27,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:56:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144148851] [2023-11-26 11:56:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:27,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:56:27,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:27,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:56:27,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:56:27,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-26 11:56:27,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:27,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:27,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-26 11:56:27,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:28,486 INFO L124 PetriNetUnfolderBase]: 1624/2724 cut-off events. [2023-11-26 11:56:28,486 INFO L125 PetriNetUnfolderBase]: For 5505/5605 co-relation queries the response was YES. [2023-11-26 11:56:28,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8893 conditions, 2724 events. 1624/2724 cut-off events. For 5505/5605 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16614 event pairs, 635 based on Foata normal form. 85/2683 useless extension candidates. Maximal degree in co-relation 8870. Up to 1735 conditions per place. [2023-11-26 11:56:28,519 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 39 selfloop transitions, 9 changer transitions 35/100 dead transitions. [2023-11-26 11:56:28,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 606 flow [2023-11-26 11:56:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:56:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 11:56:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2023-11-26 11:56:28,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6048780487804878 [2023-11-26 11:56:28,522 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 248 transitions. [2023-11-26 11:56:28,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 248 transitions. [2023-11-26 11:56:28,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:28,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 248 transitions. [2023-11-26 11:56:28,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:28,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 41.0) internal successors, (451), 11 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:28,526 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 41.0) internal successors, (451), 11 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:28,526 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 196 flow. Second operand 10 states and 248 transitions. [2023-11-26 11:56:28,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 606 flow [2023-11-26 11:56:28,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 580 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-26 11:56:28,546 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 280 flow [2023-11-26 11:56:28,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2023-11-26 11:56:28,548 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2023-11-26 11:56:28,548 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 280 flow [2023-11-26 11:56:28,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:28,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:28,549 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] [2023-11-26 11:56:28,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:56:28,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:28,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:28,550 INFO L85 PathProgramCache]: Analyzing trace with hash -91028911, now seen corresponding path program 1 times [2023-11-26 11:56:28,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:28,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284621224] [2023-11-26 11:56:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:28,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:29,073 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-26 11:56:29,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:29,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284621224] [2023-11-26 11:56:29,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284621224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:29,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:29,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:56:29,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063035458] [2023-11-26 11:56:29,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:29,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:56:29,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:29,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:56:29,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:56:29,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-26 11:56:29,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:29,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:29,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-26 11:56:29,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:29,893 INFO L124 PetriNetUnfolderBase]: 1506/2516 cut-off events. [2023-11-26 11:56:29,893 INFO L125 PetriNetUnfolderBase]: For 9215/9474 co-relation queries the response was YES. [2023-11-26 11:56:29,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10019 conditions, 2516 events. 1506/2516 cut-off events. For 9215/9474 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14863 event pairs, 482 based on Foata normal form. 65/2449 useless extension candidates. Maximal degree in co-relation 9992. Up to 1508 conditions per place. [2023-11-26 11:56:29,926 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 42 selfloop transitions, 14 changer transitions 26/99 dead transitions. [2023-11-26 11:56:29,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 723 flow [2023-11-26 11:56:29,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:56:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 11:56:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2023-11-26 11:56:29,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2023-11-26 11:56:29,929 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 205 transitions. [2023-11-26 11:56:29,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 205 transitions. [2023-11-26 11:56:29,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:29,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 205 transitions. [2023-11-26 11:56:29,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 25.625) internal successors, (205), 8 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:29,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:29,932 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:29,932 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 280 flow. Second operand 8 states and 205 transitions. [2023-11-26 11:56:29,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 723 flow [2023-11-26 11:56:29,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 99 transitions, 697 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-11-26 11:56:29,950 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 385 flow [2023-11-26 11:56:29,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=385, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2023-11-26 11:56:29,951 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2023-11-26 11:56:29,951 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 385 flow [2023-11-26 11:56:29,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:29,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:29,952 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] [2023-11-26 11:56:29,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:56:29,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:29,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:29,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1216181533, now seen corresponding path program 1 times [2023-11-26 11:56:29,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:29,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965407856] [2023-11-26 11:56:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:30,188 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-26 11:56:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965407856] [2023-11-26 11:56:30,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965407856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:30,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:30,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:56:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094663531] [2023-11-26 11:56:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:30,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:56:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:30,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:56:30,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:56:30,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2023-11-26 11:56:30,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:30,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:30,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2023-11-26 11:56:30,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:31,236 INFO L124 PetriNetUnfolderBase]: 2106/3697 cut-off events. [2023-11-26 11:56:31,236 INFO L125 PetriNetUnfolderBase]: For 15914/15956 co-relation queries the response was YES. [2023-11-26 11:56:31,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15262 conditions, 3697 events. 2106/3697 cut-off events. For 15914/15956 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 25139 event pairs, 321 based on Foata normal form. 68/3745 useless extension candidates. Maximal degree in co-relation 15229. Up to 1348 conditions per place. [2023-11-26 11:56:31,301 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 66 selfloop transitions, 3 changer transitions 14/101 dead transitions. [2023-11-26 11:56:31,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 101 transitions, 853 flow [2023-11-26 11:56:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:56:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:56:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2023-11-26 11:56:31,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6178861788617886 [2023-11-26 11:56:31,303 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 152 transitions. [2023-11-26 11:56:31,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 152 transitions. [2023-11-26 11:56:31,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:31,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 152 transitions. [2023-11-26 11:56:31,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:31,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:31,306 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:31,307 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 385 flow. Second operand 6 states and 152 transitions. [2023-11-26 11:56:31,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 101 transitions, 853 flow [2023-11-26 11:56:31,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 101 transitions, 798 flow, removed 23 selfloop flow, removed 7 redundant places. [2023-11-26 11:56:31,350 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 387 flow [2023-11-26 11:56:31,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2023-11-26 11:56:31,354 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2023-11-26 11:56:31,354 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 387 flow [2023-11-26 11:56:31,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:31,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:31,355 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] [2023-11-26 11:56:31,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:56:31,356 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:31,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:31,356 INFO L85 PathProgramCache]: Analyzing trace with hash -599943689, now seen corresponding path program 2 times [2023-11-26 11:56:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:31,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899868766] [2023-11-26 11:56:31,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:31,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:31,607 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-26 11:56:31,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:31,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899868766] [2023-11-26 11:56:31,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899868766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:31,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:31,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:56:31,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769596703] [2023-11-26 11:56:31,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:31,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:56:31,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:31,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:56:31,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:56:31,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2023-11-26 11:56:31,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:31,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:31,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2023-11-26 11:56:31,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:32,982 INFO L124 PetriNetUnfolderBase]: 3467/5665 cut-off events. [2023-11-26 11:56:32,982 INFO L125 PetriNetUnfolderBase]: For 18669/18986 co-relation queries the response was YES. [2023-11-26 11:56:33,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20498 conditions, 5665 events. 3467/5665 cut-off events. For 18669/18986 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 36256 event pairs, 641 based on Foata normal form. 303/5637 useless extension candidates. Maximal degree in co-relation 20467. Up to 2800 conditions per place. [2023-11-26 11:56:33,044 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 63 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2023-11-26 11:56:33,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 88 transitions, 683 flow [2023-11-26 11:56:33,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:56:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:56:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2023-11-26 11:56:33,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.676829268292683 [2023-11-26 11:56:33,048 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 111 transitions. [2023-11-26 11:56:33,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 111 transitions. [2023-11-26 11:56:33,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:33,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 111 transitions. [2023-11-26 11:56:33,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:33,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:33,052 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:33,053 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 387 flow. Second operand 4 states and 111 transitions. [2023-11-26 11:56:33,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 88 transitions, 683 flow [2023-11-26 11:56:33,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 676 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-26 11:56:33,079 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 402 flow [2023-11-26 11:56:33,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=402, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-11-26 11:56:33,082 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2023-11-26 11:56:33,082 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 402 flow [2023-11-26 11:56:33,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:33,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:33,083 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] [2023-11-26 11:56:33,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:56:33,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:33,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash -663940120, now seen corresponding path program 1 times [2023-11-26 11:56:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:33,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766466279] [2023-11-26 11:56:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:33,341 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-26 11:56:33,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:33,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766466279] [2023-11-26 11:56:33,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766466279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:33,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:33,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:56:33,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276093085] [2023-11-26 11:56:33,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:33,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:56:33,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:33,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:56:33,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:56:33,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2023-11-26 11:56:33,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:33,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:33,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2023-11-26 11:56:33,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:34,300 INFO L124 PetriNetUnfolderBase]: 2450/4066 cut-off events. [2023-11-26 11:56:34,301 INFO L125 PetriNetUnfolderBase]: For 12541/12658 co-relation queries the response was YES. [2023-11-26 11:56:34,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15262 conditions, 4066 events. 2450/4066 cut-off events. For 12541/12658 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 24772 event pairs, 323 based on Foata normal form. 227/4025 useless extension candidates. Maximal degree in co-relation 15230. Up to 1137 conditions per place. [2023-11-26 11:56:34,348 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 69 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2023-11-26 11:56:34,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 758 flow [2023-11-26 11:56:34,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:56:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:56:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2023-11-26 11:56:34,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6878048780487804 [2023-11-26 11:56:34,351 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 141 transitions. [2023-11-26 11:56:34,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 141 transitions. [2023-11-26 11:56:34,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:34,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 141 transitions. [2023-11-26 11:56:34,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:34,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:34,354 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:34,354 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 402 flow. Second operand 5 states and 141 transitions. [2023-11-26 11:56:34,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 758 flow [2023-11-26 11:56:34,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 755 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:56:34,368 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 446 flow [2023-11-26 11:56:34,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=446, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2023-11-26 11:56:34,372 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2023-11-26 11:56:34,372 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 446 flow [2023-11-26 11:56:34,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:34,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:34,373 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] [2023-11-26 11:56:34,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:56:34,374 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:34,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1820720854, now seen corresponding path program 1 times [2023-11-26 11:56:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373126619] [2023-11-26 11:56:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:34,625 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-26 11:56:34,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:34,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373126619] [2023-11-26 11:56:34,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373126619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:34,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:34,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:56:34,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245916902] [2023-11-26 11:56:34,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:34,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:56:34,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:34,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:56:34,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:56:34,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2023-11-26 11:56:34,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:34,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:34,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2023-11-26 11:56:34,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:35,430 INFO L124 PetriNetUnfolderBase]: 1950/3230 cut-off events. [2023-11-26 11:56:35,430 INFO L125 PetriNetUnfolderBase]: For 12964/13081 co-relation queries the response was YES. [2023-11-26 11:56:35,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13162 conditions, 3230 events. 1950/3230 cut-off events. For 12964/13081 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19240 event pairs, 271 based on Foata normal form. 115/3092 useless extension candidates. Maximal degree in co-relation 13127. Up to 1137 conditions per place. [2023-11-26 11:56:35,460 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 53 selfloop transitions, 11 changer transitions 12/95 dead transitions. [2023-11-26 11:56:35,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 95 transitions, 754 flow [2023-11-26 11:56:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:56:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:56:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2023-11-26 11:56:35,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6300813008130082 [2023-11-26 11:56:35,463 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 155 transitions. [2023-11-26 11:56:35,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 155 transitions. [2023-11-26 11:56:35,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:35,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 155 transitions. [2023-11-26 11:56:35,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:35,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:35,466 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:35,466 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 446 flow. Second operand 6 states and 155 transitions. [2023-11-26 11:56:35,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 95 transitions, 754 flow [2023-11-26 11:56:35,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 95 transitions, 692 flow, removed 19 selfloop flow, removed 6 redundant places. [2023-11-26 11:56:35,489 INFO L231 Difference]: Finished difference. Result has 77 places, 58 transitions, 377 flow [2023-11-26 11:56:35,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=77, PETRI_TRANSITIONS=58} [2023-11-26 11:56:35,491 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2023-11-26 11:56:35,491 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 58 transitions, 377 flow [2023-11-26 11:56:35,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:35,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:35,492 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, 1, 1, 1] [2023-11-26 11:56:35,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:56:35,493 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:35,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:35,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1029186592, now seen corresponding path program 1 times [2023-11-26 11:56:35,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:35,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931735700] [2023-11-26 11:56:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:56:36,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931735700] [2023-11-26 11:56:36,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931735700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:36,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:36,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:56:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912375056] [2023-11-26 11:56:36,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:36,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:56:36,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:36,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:56:36,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:56:36,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2023-11-26 11:56:36,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 58 transitions, 377 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:36,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:36,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2023-11-26 11:56:36,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:37,636 INFO L124 PetriNetUnfolderBase]: 1935/3789 cut-off events. [2023-11-26 11:56:37,636 INFO L125 PetriNetUnfolderBase]: For 11315/11871 co-relation queries the response was YES. [2023-11-26 11:56:37,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13853 conditions, 3789 events. 1935/3789 cut-off events. For 11315/11871 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 28021 event pairs, 478 based on Foata normal form. 76/3590 useless extension candidates. Maximal degree in co-relation 13820. Up to 1571 conditions per place. [2023-11-26 11:56:37,666 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 32 selfloop transitions, 3 changer transitions 65/121 dead transitions. [2023-11-26 11:56:37,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 934 flow [2023-11-26 11:56:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:56:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 11:56:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2023-11-26 11:56:37,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5548780487804879 [2023-11-26 11:56:37,670 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 182 transitions. [2023-11-26 11:56:37,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 182 transitions. [2023-11-26 11:56:37,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:37,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 182 transitions. [2023-11-26 11:56:37,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:37,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:37,673 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:37,673 INFO L175 Difference]: Start difference. First operand has 77 places, 58 transitions, 377 flow. Second operand 8 states and 182 transitions. [2023-11-26 11:56:37,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 934 flow [2023-11-26 11:56:37,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 121 transitions, 803 flow, removed 49 selfloop flow, removed 10 redundant places. [2023-11-26 11:56:37,744 INFO L231 Difference]: Finished difference. Result has 80 places, 46 transitions, 247 flow [2023-11-26 11:56:37,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=247, PETRI_PLACES=80, PETRI_TRANSITIONS=46} [2023-11-26 11:56:37,746 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2023-11-26 11:56:37,746 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 46 transitions, 247 flow [2023-11-26 11:56:37,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:37,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:37,747 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, 1, 1, 1] [2023-11-26 11:56:37,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:56:37,747 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:37,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:37,748 INFO L85 PathProgramCache]: Analyzing trace with hash -426356946, now seen corresponding path program 2 times [2023-11-26 11:56:37,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:37,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525023125] [2023-11-26 11:56:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:39,490 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-26 11:56:39,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:39,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525023125] [2023-11-26 11:56:39,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525023125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:39,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:39,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 11:56:39,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258843305] [2023-11-26 11:56:39,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:39,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 11:56:39,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:39,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 11:56:39,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:56:39,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-26 11:56:39,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 46 transitions, 247 flow. Second operand has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 11 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:39,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:39,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-26 11:56:39,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:40,081 INFO L124 PetriNetUnfolderBase]: 647/1305 cut-off events. [2023-11-26 11:56:40,082 INFO L125 PetriNetUnfolderBase]: For 1648/1841 co-relation queries the response was YES. [2023-11-26 11:56:40,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3840 conditions, 1305 events. 647/1305 cut-off events. For 1648/1841 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8026 event pairs, 183 based on Foata normal form. 34/1191 useless extension candidates. Maximal degree in co-relation 3808. Up to 505 conditions per place. [2023-11-26 11:56:40,090 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 26 selfloop transitions, 6 changer transitions 31/86 dead transitions. [2023-11-26 11:56:40,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 86 transitions, 513 flow [2023-11-26 11:56:40,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:56:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:56:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2023-11-26 11:56:40,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5826558265582655 [2023-11-26 11:56:40,092 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 215 transitions. [2023-11-26 11:56:40,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 215 transitions. [2023-11-26 11:56:40,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:40,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 215 transitions. [2023-11-26 11:56:40,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.88888888888889) internal successors, (215), 9 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:40,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:40,095 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:40,095 INFO L175 Difference]: Start difference. First operand has 80 places, 46 transitions, 247 flow. Second operand 9 states and 215 transitions. [2023-11-26 11:56:40,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 86 transitions, 513 flow [2023-11-26 11:56:40,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 86 transitions, 477 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-11-26 11:56:40,106 INFO L231 Difference]: Finished difference. Result has 77 places, 47 transitions, 259 flow [2023-11-26 11:56:40,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=77, PETRI_TRANSITIONS=47} [2023-11-26 11:56:40,107 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2023-11-26 11:56:40,107 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 47 transitions, 259 flow [2023-11-26 11:56:40,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 11 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:40,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:40,108 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, 1, 1, 1] [2023-11-26 11:56:40,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:56:40,108 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 11:56:40,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash -427339812, now seen corresponding path program 3 times [2023-11-26 11:56:40,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:40,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797268694] [2023-11-26 11:56:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:40,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:40,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:40,265 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:56:40,266 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-26 11:56:40,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-26 11:56:40,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-26 11:56:40,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-26 11:56:40,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-26 11:56:40,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-26 11:56:40,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:56:40,269 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:40,276 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:56:40,276 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:56:40,340 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-26 11:56:40,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:56:40,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:56:40,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:56:40 BasicIcfg [2023-11-26 11:56:40,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:56:40,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:56:40,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:56:40,393 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:56:40,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:20" (3/4) ... [2023-11-26 11:56:40,394 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 11:56:40,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-26 11:56:40,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:56:40,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:56:40,561 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:56:40,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:56:40,562 INFO L158 Benchmark]: Toolchain (without parser) took 22010.98ms. Allocated memory was 155.2MB in the beginning and 687.9MB in the end (delta: 532.7MB). Free memory was 107.8MB in the beginning and 347.2MB in the end (delta: -239.4MB). Peak memory consumption was 294.4MB. Max. memory is 16.1GB. [2023-11-26 11:56:40,562 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 117.4MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:56:40,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.86ms. Allocated memory is still 155.2MB. Free memory was 107.8MB in the beginning and 83.8MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 11:56:40,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.29ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 80.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:56:40,564 INFO L158 Benchmark]: Boogie Preprocessor took 100.92ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 77.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:56:40,564 INFO L158 Benchmark]: RCFGBuilder took 1172.02ms. Allocated memory is still 155.2MB. Free memory was 77.5MB in the beginning and 84.6MB in the end (delta: -7.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-11-26 11:56:40,565 INFO L158 Benchmark]: TraceAbstraction took 19756.85ms. Allocated memory was 155.2MB in the beginning and 687.9MB in the end (delta: 532.7MB). Free memory was 84.6MB in the beginning and 359.8MB in the end (delta: -275.2MB). Peak memory consumption was 256.4MB. Max. memory is 16.1GB. [2023-11-26 11:56:40,565 INFO L158 Benchmark]: Witness Printer took 168.72ms. Allocated memory is still 687.9MB. Free memory was 359.8MB in the beginning and 347.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 11:56:40,568 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.39ms. Allocated memory is still 117.4MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.86ms. Allocated memory is still 155.2MB. Free memory was 107.8MB in the beginning and 83.8MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.29ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 80.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.92ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 77.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1172.02ms. Allocated memory is still 155.2MB. Free memory was 77.5MB in the beginning and 84.6MB in the end (delta: -7.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19756.85ms. Allocated memory was 155.2MB in the beginning and 687.9MB in the end (delta: 532.7MB). Free memory was 84.6MB in the beginning and 359.8MB in the end (delta: -275.2MB). Peak memory consumption was 256.4MB. Max. memory is 16.1GB. * Witness Printer took 168.72ms. Allocated memory is still 687.9MB. Free memory was 359.8MB in the beginning and 347.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - 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 The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - 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 The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 833]: 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: 831]: 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: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 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: 19.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 579 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 218 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1541 IncrementalHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 47 mSDtfsCounter, 1541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=8, InterpolantAutomatonStates: 77, 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, 7.0s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1965 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-26 11:56:40,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4f0eee-8168-4290-9488-d0cf8302ca31/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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