./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/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_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/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_2fead290-8329-47a4-8d15-0ff4b1650b0c/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 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:40:57,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:40:57,819 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:40:57,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:40:57,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:40:57,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:40:57,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:40:57,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:40:57,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:40:57,869 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:40:57,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:40:57,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:40:57,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:40:57,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:40:57,873 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:40:57,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:40:57,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:40:57,875 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:40:57,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:40:57,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:40:57,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:40:57,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:40:57,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:40:57,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:40:57,879 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:40:57,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:40:57,880 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:40:57,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:40:57,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:40:57,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:40:57,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:40:57,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:40:57,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:40:57,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:40:57,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:40:57,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:40:57,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:40:57,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:40:57,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:40:57,887 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:40:57,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:40:57,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:40:57,888 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_2fead290-8329-47a4-8d15-0ff4b1650b0c/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_2fead290-8329-47a4-8d15-0ff4b1650b0c/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 -> 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d [2023-11-26 10:40:58,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:40:58,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:40:58,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:40:58,194 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:40:58,195 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:40:58,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 10:41:01,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:41:01,691 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:41:01,692 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 10:41:01,714 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/data/08bc1df38/7f4ca86128824b63a6e7ad26e0d509e9/FLAG776eb0409 [2023-11-26 10:41:01,730 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/data/08bc1df38/7f4ca86128824b63a6e7ad26e0d509e9 [2023-11-26 10:41:01,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:41:01,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:41:01,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:41:01,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:41:01,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:41:01,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:41:01" (1/1) ... [2023-11-26 10:41:01,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bdde478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:01, skipping insertion in model container [2023-11-26 10:41:01,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:41:01" (1/1) ... [2023-11-26 10:41:01,795 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:41:01,999 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_2fead290-8329-47a4-8d15-0ff4b1650b0c/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-26 10:41:02,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:41:02,367 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:41:02,383 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_2fead290-8329-47a4-8d15-0ff4b1650b0c/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-26 10:41:02,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:41:02,530 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:41:02,530 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:41:02,538 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:41:02,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02 WrapperNode [2023-11-26 10:41:02,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:41:02,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:41:02,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:41:02,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:41:02,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,634 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2023-11-26 10:41:02,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:41:02,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:41:02,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:41:02,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:41:02,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,692 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 10:41:02,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:41:02,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:41:02,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:41:02,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:41:02,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (1/1) ... [2023-11-26 10:41:02,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:41:02,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:41:02,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:41:02,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:41:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:41:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:41:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:41:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 10:41:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:41:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:41:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:41:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:41:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 10:41:02,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 10:41:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 10:41:02,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 10:41:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 10:41:02,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 10:41:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:41:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:41:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:41:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 10:41:02,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:41:02,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:41:02,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:41:02,873 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 10:41:03,088 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:41:03,090 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:41:03,507 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:41:03,840 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:41:03,840 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:41:03,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:03 BoogieIcfgContainer [2023-11-26 10:41:03,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:41:03,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:41:03,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:41:03,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:41:03,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:41:01" (1/3) ... [2023-11-26 10:41:03,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3f59b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:41:03, skipping insertion in model container [2023-11-26 10:41:03,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:02" (2/3) ... [2023-11-26 10:41:03,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3f59b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:41:03, skipping insertion in model container [2023-11-26 10:41:03,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:03" (3/3) ... [2023-11-26 10:41:03,854 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 10:41:03,865 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:41:03,876 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:41:03,876 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-26 10:41:03,877 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:41:03,938 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:41:03,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2023-11-26 10:41:04,024 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-11-26 10:41:04,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:41:04,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-26 10:41:04,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2023-11-26 10:41:04,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2023-11-26 10:41:04,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:41:04,052 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;@69f22e95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:41:04,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-26 10:41:04,057 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:41:04,057 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-26 10:41:04,057 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:41:04,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:04,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-26 10:41:04,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:04,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash 11135225, now seen corresponding path program 1 times [2023-11-26 10:41:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639822040] [2023-11-26 10:41:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:04,591 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 10:41:04,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:04,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639822040] [2023-11-26 10:41:04,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639822040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:04,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:41:04,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477598574] [2023-11-26 10:41:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:04,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:04,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:04,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:04,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:04,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2023-11-26 10:41:04,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 10:41:04,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:04,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2023-11-26 10:41:04,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:05,069 INFO L124 PetriNetUnfolderBase]: 617/1111 cut-off events. [2023-11-26 10:41:05,070 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-26 10:41:05,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 1111 events. 617/1111 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6362 event pairs, 343 based on Foata normal form. 48/1137 useless extension candidates. Maximal degree in co-relation 2077. Up to 763 conditions per place. [2023-11-26 10:41:05,089 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-26 10:41:05,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2023-11-26 10:41:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-26 10:41:05,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2023-11-26 10:41:05,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-26 10:41:05,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-26 10:41:05,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:05,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-26 10:41:05,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 10:41:05,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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 10:41:05,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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 10:41:05,124 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 90 transitions. [2023-11-26 10:41:05,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2023-11-26 10:41:05,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 10:41:05,135 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2023-11-26 10:41:05,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-26 10:41:05,143 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-26 10:41:05,143 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2023-11-26 10:41:05,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 10:41:05,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:05,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:05,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:41:05,145 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:05,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash 638816621, now seen corresponding path program 1 times [2023-11-26 10:41:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:05,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713830198] [2023-11-26 10:41:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:05,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:05,717 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 10:41:05,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:05,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713830198] [2023-11-26 10:41:05,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713830198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:05,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:05,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:41:05,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111733324] [2023-11-26 10:41:05,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:05,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:41:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:05,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:41:05,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:41:05,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2023-11-26 10:41:05,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 10:41:05,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:05,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2023-11-26 10:41:05,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:07,332 INFO L124 PetriNetUnfolderBase]: 5113/8038 cut-off events. [2023-11-26 10:41:07,333 INFO L125 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2023-11-26 10:41:07,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16017 conditions, 8038 events. 5113/8038 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 53399 event pairs, 1099 based on Foata normal form. 0/7801 useless extension candidates. Maximal degree in co-relation 16007. Up to 2475 conditions per place. [2023-11-26 10:41:07,391 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 37 selfloop transitions, 6 changer transitions 79/130 dead transitions. [2023-11-26 10:41:07,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 130 transitions, 530 flow [2023-11-26 10:41:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:41:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 10:41:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2023-11-26 10:41:07,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6353276353276354 [2023-11-26 10:41:07,396 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 223 transitions. [2023-11-26 10:41:07,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 223 transitions. [2023-11-26 10:41:07,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:07,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 223 transitions. [2023-11-26 10:41:07,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.77777777777778) internal successors, (223), 9 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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 10:41:07,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 10:41:07,402 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 10:41:07,402 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 9 states and 223 transitions. [2023-11-26 10:41:07,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 130 transitions, 530 flow [2023-11-26 10:41:07,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 130 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:07,407 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 154 flow [2023-11-26 10:41:07,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2023-11-26 10:41:07,408 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-11-26 10:41:07,408 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 154 flow [2023-11-26 10:41:07,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 10:41:07,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:07,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:07,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:41:07,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:07,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:07,411 INFO L85 PathProgramCache]: Analyzing trace with hash 855097166, now seen corresponding path program 1 times [2023-11-26 10:41:07,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:07,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223523365] [2023-11-26 10:41:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:07,637 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 10:41:07,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:07,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223523365] [2023-11-26 10:41:07,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223523365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:07,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:07,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:41:07,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326478788] [2023-11-26 10:41:07,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:07,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:07,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:07,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:07,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2023-11-26 10:41:07,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 10:41:07,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:07,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2023-11-26 10:41:07,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:09,015 INFO L124 PetriNetUnfolderBase]: 3717/6057 cut-off events. [2023-11-26 10:41:09,015 INFO L125 PetriNetUnfolderBase]: For 7557/7569 co-relation queries the response was YES. [2023-11-26 10:41:09,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17140 conditions, 6057 events. 3717/6057 cut-off events. For 7557/7569 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 40517 event pairs, 311 based on Foata normal form. 185/6236 useless extension candidates. Maximal degree in co-relation 17122. Up to 2309 conditions per place. [2023-11-26 10:41:09,073 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 45 selfloop transitions, 10 changer transitions 62/125 dead transitions. [2023-11-26 10:41:09,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 125 transitions, 756 flow [2023-11-26 10:41:09,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:41:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 10:41:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2023-11-26 10:41:09,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5717948717948718 [2023-11-26 10:41:09,076 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 223 transitions. [2023-11-26 10:41:09,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 223 transitions. [2023-11-26 10:41:09,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:09,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 223 transitions. [2023-11-26 10:41:09,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.3) internal successors, (223), 10 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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 10:41:09,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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 10:41:09,081 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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 10:41:09,081 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 154 flow. Second operand 10 states and 223 transitions. [2023-11-26 10:41:09,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 125 transitions, 756 flow [2023-11-26 10:41:09,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 125 transitions, 668 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-11-26 10:41:09,126 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 222 flow [2023-11-26 10:41:09,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=222, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2023-11-26 10:41:09,127 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2023-11-26 10:41:09,127 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 222 flow [2023-11-26 10:41:09,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 10:41:09,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:09,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:09,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:41:09,128 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:09,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:09,129 INFO L85 PathProgramCache]: Analyzing trace with hash -977021828, now seen corresponding path program 1 times [2023-11-26 10:41:09,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:09,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059201964] [2023-11-26 10:41:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:09,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:09,359 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 10:41:09,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:09,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059201964] [2023-11-26 10:41:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059201964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:09,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:09,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:41:09,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935748902] [2023-11-26 10:41:09,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:09,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:09,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:09,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:09,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:09,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2023-11-26 10:41:09,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 10:41:09,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:09,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2023-11-26 10:41:09,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:10,766 INFO L124 PetriNetUnfolderBase]: 3540/5756 cut-off events. [2023-11-26 10:41:10,766 INFO L125 PetriNetUnfolderBase]: For 15856/15860 co-relation queries the response was YES. [2023-11-26 10:41:10,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18243 conditions, 5756 events. 3540/5756 cut-off events. For 15856/15860 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 37343 event pairs, 590 based on Foata normal form. 166/5920 useless extension candidates. Maximal degree in co-relation 18218. Up to 2187 conditions per place. [2023-11-26 10:41:10,828 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 50 selfloop transitions, 14 changer transitions 60/132 dead transitions. [2023-11-26 10:41:10,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 132 transitions, 888 flow [2023-11-26 10:41:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:41:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 10:41:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2023-11-26 10:41:10,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2023-11-26 10:41:10,831 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 230 transitions. [2023-11-26 10:41:10,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 230 transitions. [2023-11-26 10:41:10,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:10,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 230 transitions. [2023-11-26 10:41:10,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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 10:41:10,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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 10:41:10,837 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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 10:41:10,837 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 222 flow. Second operand 10 states and 230 transitions. [2023-11-26 10:41:10,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 132 transitions, 888 flow [2023-11-26 10:41:10,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 132 transitions, 832 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-11-26 10:41:10,912 INFO L231 Difference]: Finished difference. Result has 70 places, 47 transitions, 310 flow [2023-11-26 10:41:10,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=310, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2023-11-26 10:41:10,914 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2023-11-26 10:41:10,915 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 47 transitions, 310 flow [2023-11-26 10:41:10,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 10:41:10,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:10,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:10,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:41:10,917 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:10,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash 929120635, now seen corresponding path program 1 times [2023-11-26 10:41:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111967864] [2023-11-26 10:41:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:11,102 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 10:41:11,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:11,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111967864] [2023-11-26 10:41:11,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111967864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:11,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:41:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708240118] [2023-11-26 10:41:11,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:11,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:41:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:11,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:41:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:41:11,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-26 10:41:11,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 47 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 10:41:11,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:11,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-26 10:41:11,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:12,174 INFO L124 PetriNetUnfolderBase]: 3485/5984 cut-off events. [2023-11-26 10:41:12,174 INFO L125 PetriNetUnfolderBase]: For 10138/10477 co-relation queries the response was YES. [2023-11-26 10:41:12,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16070 conditions, 5984 events. 3485/5984 cut-off events. For 10138/10477 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 40991 event pairs, 520 based on Foata normal form. 427/6284 useless extension candidates. Maximal degree in co-relation 16039. Up to 2888 conditions per place. [2023-11-26 10:41:12,239 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 45 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-11-26 10:41:12,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 498 flow [2023-11-26 10:41:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:41:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 10:41:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2023-11-26 10:41:12,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2023-11-26 10:41:12,242 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 105 transitions. [2023-11-26 10:41:12,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 105 transitions. [2023-11-26 10:41:12,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:12,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 105 transitions. [2023-11-26 10:41:12,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 10:41:12,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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 10:41:12,244 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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 10:41:12,244 INFO L175 Difference]: Start difference. First operand has 70 places, 47 transitions, 310 flow. Second operand 4 states and 105 transitions. [2023-11-26 10:41:12,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 498 flow [2023-11-26 10:41:12,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 472 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-11-26 10:41:12,361 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 322 flow [2023-11-26 10:41:12,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-11-26 10:41:12,362 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2023-11-26 10:41:12,363 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 322 flow [2023-11-26 10:41:12,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 10:41:12,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:12,363 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 10:41:12,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:41:12,364 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:12,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1667391532, now seen corresponding path program 1 times [2023-11-26 10:41:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:12,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691871398] [2023-11-26 10:41:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:12,573 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 10:41:12,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:12,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691871398] [2023-11-26 10:41:12,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691871398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:12,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:12,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:41:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681781094] [2023-11-26 10:41:12,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:12,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:41:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:12,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:41:12,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:41:12,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-26 10:41:12,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 10:41:12,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:12,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-26 10:41:12,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:14,266 INFO L124 PetriNetUnfolderBase]: 4417/7826 cut-off events. [2023-11-26 10:41:14,266 INFO L125 PetriNetUnfolderBase]: For 11023/11282 co-relation queries the response was YES. [2023-11-26 10:41:14,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22266 conditions, 7826 events. 4417/7826 cut-off events. For 11023/11282 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 60816 event pairs, 1894 based on Foata normal form. 315/7673 useless extension candidates. Maximal degree in co-relation 22239. Up to 3142 conditions per place. [2023-11-26 10:41:14,353 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 52 selfloop transitions, 13 changer transitions 20/105 dead transitions. [2023-11-26 10:41:14,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 721 flow [2023-11-26 10:41:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:41:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 10:41:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2023-11-26 10:41:14,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6043956043956044 [2023-11-26 10:41:14,356 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 165 transitions. [2023-11-26 10:41:14,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 165 transitions. [2023-11-26 10:41:14,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:14,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 165 transitions. [2023-11-26 10:41:14,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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 10:41:14,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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 10:41:14,361 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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 10:41:14,361 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 322 flow. Second operand 7 states and 165 transitions. [2023-11-26 10:41:14,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 721 flow [2023-11-26 10:41:14,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 105 transitions, 715 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-26 10:41:14,395 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 410 flow [2023-11-26 10:41:14,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-11-26 10:41:14,397 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2023-11-26 10:41:14,397 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 410 flow [2023-11-26 10:41:14,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 10:41:14,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:14,398 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 10:41:14,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:41:14,398 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:14,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash -230061427, now seen corresponding path program 1 times [2023-11-26 10:41:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:14,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099909321] [2023-11-26 10:41:14,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:14,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:14,587 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 10:41:14,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:14,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099909321] [2023-11-26 10:41:14,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099909321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:14,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:14,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:41:14,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398354466] [2023-11-26 10:41:14,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:14,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:41:14,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:14,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:41:14,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:41:14,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-26 10:41:14,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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 10:41:14,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:14,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-26 10:41:14,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:15,630 INFO L124 PetriNetUnfolderBase]: 4165/6939 cut-off events. [2023-11-26 10:41:15,630 INFO L125 PetriNetUnfolderBase]: For 8729/9056 co-relation queries the response was YES. [2023-11-26 10:41:15,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19453 conditions, 6939 events. 4165/6939 cut-off events. For 8729/9056 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 46558 event pairs, 540 based on Foata normal form. 508/7286 useless extension candidates. Maximal degree in co-relation 19421. Up to 2012 conditions per place. [2023-11-26 10:41:15,689 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 8 changer transitions 3/95 dead transitions. [2023-11-26 10:41:15,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 95 transitions, 689 flow [2023-11-26 10:41:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:41:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:41:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2023-11-26 10:41:15,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6871794871794872 [2023-11-26 10:41:15,691 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 134 transitions. [2023-11-26 10:41:15,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 134 transitions. [2023-11-26 10:41:15,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:15,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 134 transitions. [2023-11-26 10:41:15,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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 10:41:15,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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 10:41:15,693 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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 10:41:15,693 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 410 flow. Second operand 5 states and 134 transitions. [2023-11-26 10:41:15,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 95 transitions, 689 flow [2023-11-26 10:41:15,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 663 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-11-26 10:41:15,729 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 412 flow [2023-11-26 10:41:15,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2023-11-26 10:41:15,730 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2023-11-26 10:41:15,731 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 412 flow [2023-11-26 10:41:15,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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 10:41:15,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:15,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:15,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:41:15,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:15,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash -105401509, now seen corresponding path program 1 times [2023-11-26 10:41:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:15,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225298970] [2023-11-26 10:41:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:16,028 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 10:41:16,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:16,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225298970] [2023-11-26 10:41:16,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225298970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:16,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:16,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:41:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490276226] [2023-11-26 10:41:16,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:16,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:16,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:16,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-26 10:41:16,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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 10:41:16,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:16,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-26 10:41:16,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:17,038 INFO L124 PetriNetUnfolderBase]: 3353/5499 cut-off events. [2023-11-26 10:41:17,039 INFO L125 PetriNetUnfolderBase]: For 9889/10176 co-relation queries the response was YES. [2023-11-26 10:41:17,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17214 conditions, 5499 events. 3353/5499 cut-off events. For 9889/10176 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 35663 event pairs, 510 based on Foata normal form. 276/5614 useless extension candidates. Maximal degree in co-relation 17179. Up to 2012 conditions per place. [2023-11-26 10:41:17,070 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 48 selfloop transitions, 11 changer transitions 9/87 dead transitions. [2023-11-26 10:41:17,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 87 transitions, 627 flow [2023-11-26 10:41:17,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:41:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:41:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2023-11-26 10:41:17,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6196581196581197 [2023-11-26 10:41:17,073 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 145 transitions. [2023-11-26 10:41:17,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 145 transitions. [2023-11-26 10:41:17,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:17,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 145 transitions. [2023-11-26 10:41:17,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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 10:41:17,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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 10:41:17,075 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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 10:41:17,075 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 412 flow. Second operand 6 states and 145 transitions. [2023-11-26 10:41:17,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 87 transitions, 627 flow [2023-11-26 10:41:17,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 590 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-11-26 10:41:17,095 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 346 flow [2023-11-26 10:41:17,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2023-11-26 10:41:17,096 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2023-11-26 10:41:17,096 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 346 flow [2023-11-26 10:41:17,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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 10:41:17,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:17,097 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] [2023-11-26 10:41:17,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:41:17,097 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:17,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1451227143, now seen corresponding path program 1 times [2023-11-26 10:41:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977461994] [2023-11-26 10:41:17,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:17,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:18,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:18,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977461994] [2023-11-26 10:41:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977461994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:18,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:18,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:41:18,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344591368] [2023-11-26 10:41:18,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:18,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:41:18,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:18,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:41:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:41:18,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-26 10:41:18,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 50 transitions, 346 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 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 10:41:18,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:18,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-26 10:41:18,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:18,988 INFO L124 PetriNetUnfolderBase]: 1567/3216 cut-off events. [2023-11-26 10:41:18,988 INFO L125 PetriNetUnfolderBase]: For 5965/6642 co-relation queries the response was YES. [2023-11-26 10:41:19,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9490 conditions, 3216 events. 1567/3216 cut-off events. For 5965/6642 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 24842 event pairs, 525 based on Foata normal form. 109/3021 useless extension candidates. Maximal degree in co-relation 9458. Up to 1123 conditions per place. [2023-11-26 10:41:19,010 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 33 selfloop transitions, 6 changer transitions 36/104 dead transitions. [2023-11-26 10:41:19,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 104 transitions, 689 flow [2023-11-26 10:41:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:41:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 10:41:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2023-11-26 10:41:19,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2023-11-26 10:41:19,013 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 207 transitions. [2023-11-26 10:41:19,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 207 transitions. [2023-11-26 10:41:19,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:19,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 207 transitions. [2023-11-26 10:41:19,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.0) internal successors, (207), 9 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 10:41:19,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 10:41:19,016 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 10:41:19,016 INFO L175 Difference]: Start difference. First operand has 73 places, 50 transitions, 346 flow. Second operand 9 states and 207 transitions. [2023-11-26 10:41:19,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 104 transitions, 689 flow [2023-11-26 10:41:19,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 104 transitions, 567 flow, removed 28 selfloop flow, removed 14 redundant places. [2023-11-26 10:41:19,087 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 313 flow [2023-11-26 10:41:19,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=313, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2023-11-26 10:41:19,088 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2023-11-26 10:41:19,088 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 313 flow [2023-11-26 10:41:19,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 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 10:41:19,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:19,089 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] [2023-11-26 10:41:19,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:41:19,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:19,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1429712993, now seen corresponding path program 2 times [2023-11-26 10:41:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:19,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833175883] [2023-11-26 10:41:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:20,110 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 10:41:20,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833175883] [2023-11-26 10:41:20,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833175883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:20,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:20,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:41:20,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44842167] [2023-11-26 10:41:20,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:20,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:41:20,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:41:20,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:41:20,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-26 10:41:20,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 313 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 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 10:41:20,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:20,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-26 10:41:20,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:20,965 INFO L124 PetriNetUnfolderBase]: 1553/3210 cut-off events. [2023-11-26 10:41:20,966 INFO L125 PetriNetUnfolderBase]: For 3073/3623 co-relation queries the response was YES. [2023-11-26 10:41:20,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8781 conditions, 3210 events. 1553/3210 cut-off events. For 3073/3623 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 25199 event pairs, 275 based on Foata normal form. 158/3017 useless extension candidates. Maximal degree in co-relation 8753. Up to 710 conditions per place. [2023-11-26 10:41:20,988 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 43 selfloop transitions, 9 changer transitions 29/110 dead transitions. [2023-11-26 10:41:20,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 679 flow [2023-11-26 10:41:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:41:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 10:41:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2023-11-26 10:41:20,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5794871794871795 [2023-11-26 10:41:20,991 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 226 transitions. [2023-11-26 10:41:20,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 226 transitions. [2023-11-26 10:41:20,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:20,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 226 transitions. [2023-11-26 10:41:20,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.6) internal successors, (226), 10 states have internal predecessors, (226), 0 states have call successors, (0), 0 states 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 10:41:20,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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 10:41:20,994 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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 10:41:20,995 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 313 flow. Second operand 10 states and 226 transitions. [2023-11-26 10:41:20,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 679 flow [2023-11-26 10:41:21,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 657 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-26 10:41:21,006 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 348 flow [2023-11-26 10:41:21,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=348, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2023-11-26 10:41:21,010 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2023-11-26 10:41:21,010 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 348 flow [2023-11-26 10:41:21,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 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 10:41:21,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:21,013 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] [2023-11-26 10:41:21,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:41:21,013 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 10:41:21,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1869562397, now seen corresponding path program 3 times [2023-11-26 10:41:21,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:21,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867160806] [2023-11-26 10:41:21,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:21,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:41:21,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:41:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:41:21,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:41:21,231 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:41:21,232 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-26 10:41:21,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-26 10:41:21,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-26 10:41:21,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-26 10:41:21,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-26 10:41:21,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-26 10:41:21,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:41:21,237 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:21,245 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:41:21,245 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:41:21,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:41:21,325 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:41:21,327 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 10:41:21,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:41:21 BasicIcfg [2023-11-26 10:41:21,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:41:21,369 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:41:21,369 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:41:21,369 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:41:21,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:03" (3/4) ... [2023-11-26 10:41:21,371 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 10:41:21,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:41:21,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:41:21,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 10:41:21,509 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:41:21,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:41:21,510 INFO L158 Benchmark]: Toolchain (without parser) took 19776.11ms. Allocated memory was 167.8MB in the beginning and 769.7MB in the end (delta: 601.9MB). Free memory was 124.1MB in the beginning and 227.9MB in the end (delta: -103.8MB). Peak memory consumption was 501.1MB. Max. memory is 16.1GB. [2023-11-26 10:41:21,510 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 63.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:41:21,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 803.71ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 100.1MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-26 10:41:21,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.49ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 97.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:41:21,513 INFO L158 Benchmark]: Boogie Preprocessor took 115.33ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 94.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:41:21,513 INFO L158 Benchmark]: RCFGBuilder took 1089.84ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 97.1MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-26 10:41:21,514 INFO L158 Benchmark]: TraceAbstraction took 17522.69ms. Allocated memory was 167.8MB in the beginning and 769.7MB in the end (delta: 601.9MB). Free memory was 96.3MB in the beginning and 239.4MB in the end (delta: -143.1MB). Peak memory consumption was 459.4MB. Max. memory is 16.1GB. [2023-11-26 10:41:21,514 INFO L158 Benchmark]: Witness Printer took 140.73ms. Allocated memory is still 769.7MB. Free memory was 239.4MB in the beginning and 227.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 10:41:21,516 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.27ms. Allocated memory is still 113.2MB. Free memory is still 63.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 803.71ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 100.1MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.49ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 97.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.33ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 94.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1089.84ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 97.1MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17522.69ms. Allocated memory was 167.8MB in the beginning and 769.7MB in the end (delta: 601.9MB). Free memory was 96.3MB in the beginning and 239.4MB in the end (delta: -143.1MB). Peak memory consumption was 459.4MB. Max. memory is 16.1GB. * Witness Printer took 140.73ms. Allocated memory is still 769.7MB. Free memory was 239.4MB in the beginning and 227.9MB in the end (delta: 11.5MB). 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~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation 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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: 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, 64 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: 17.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 575 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 556 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1616 IncrementalHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 48 mSDtfsCounter, 1616 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=7, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 10:41:21,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fead290-8329-47a4-8d15-0ff4b1650b0c/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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