./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI --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 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:58:27,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:58:27,299 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-24 21:58:27,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:58:27,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:58:27,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:58:27,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:58:27,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:58:27,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:58:27,338 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:58:27,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:58:27,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:58:27,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:58:27,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:58:27,342 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:58:27,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:58:27,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 21:58:27,344 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:58:27,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:58:27,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:58:27,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:58:27,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 21:58:27,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:58:27,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 21:58:27,349 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:58:27,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 21:58:27,351 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:58:27,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:58:27,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:58:27,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:58:27,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:58:27,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:58:27,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:58:27,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:58:27,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 21:58:27,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:58:27,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:58:27,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:58:27,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:58:27,356 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 21:58:27,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:58:27,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:58:27,358 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_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/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_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI 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 -> 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad [2023-11-24 21:58:27,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:58:27,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:58:27,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:58:27,746 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:58:27,746 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:58:27,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2023-11-24 21:58:30,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:58:31,276 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:58:31,277 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2023-11-24 21:58:31,294 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/data/5c8af76b5/68405880669941309bdd957434b841b7/FLAG5cca53e08 [2023-11-24 21:58:31,310 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/data/5c8af76b5/68405880669941309bdd957434b841b7 [2023-11-24 21:58:31,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:58:31,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:58:31,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:58:31,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:58:31,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:58:31,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:58:31" (1/1) ... [2023-11-24 21:58:31,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551de621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:31, skipping insertion in model container [2023-11-24 21:58:31,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:58:31" (1/1) ... [2023-11-24 21:58:31,375 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:58:31,604 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_8185b859-c616-4fa0-9bcf-2f3137e288e8/sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-24 21:58:31,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:58:31,876 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:58:31,893 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_8185b859-c616-4fa0-9bcf-2f3137e288e8/sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-24 21:58:31,952 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:58:32,000 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:58:32,000 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:58:32,008 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:58:32,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32 WrapperNode [2023-11-24 21:58:32,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:58:32,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:58:32,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:58:32,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:58:32,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,072 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-24 21:58:32,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:58:32,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:58:32,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:58:32,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:58:32,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,109 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-24 21:58:32,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:58:32,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:58:32,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:58:32,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:58:32,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (1/1) ... [2023-11-24 21:58:32,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:58:32,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:58:32,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:58:32,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:58:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:58:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:58:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:58:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:58:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:58:32,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:58:32,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:58:32,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:58:32,257 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:58:32,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:58:32,257 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:58:32,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:58:32,258 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:58:32,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:58:32,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:58:32,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:58:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:58:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:58:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:58:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:58:32,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:58:32,263 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:58:32,481 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:58:32,508 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:58:32,920 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:58:33,197 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:58:33,197 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:58:33,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:33 BoogieIcfgContainer [2023-11-24 21:58:33,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:58:33,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:58:33,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:58:33,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:58:33,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:58:31" (1/3) ... [2023-11-24 21:58:33,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b1c7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:58:33, skipping insertion in model container [2023-11-24 21:58:33,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:32" (2/3) ... [2023-11-24 21:58:33,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b1c7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:58:33, skipping insertion in model container [2023-11-24 21:58:33,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:33" (3/3) ... [2023-11-24 21:58:33,218 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2023-11-24 21:58:33,228 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 21:58:33,240 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:58:33,240 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-24 21:58:33,240 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:58:33,306 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:58:33,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2023-11-24 21:58:33,394 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2023-11-24 21:58:33,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:33,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-24 21:58:33,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2023-11-24 21:58:33,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2023-11-24 21:58:33,416 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:58:33,423 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;@2f2200a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:58:33,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-24 21:58:33,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:58:33,440 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-11-24 21:58:33,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:33,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:33,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:33,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:33,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:33,448 INFO L85 PathProgramCache]: Analyzing trace with hash -127959188, now seen corresponding path program 1 times [2023-11-24 21:58:33,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:33,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102993930] [2023-11-24 21:58:33,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:34,093 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-24 21:58:34,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:34,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102993930] [2023-11-24 21:58:34,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102993930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:34,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:34,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:34,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499587462] [2023-11-24 21:58:34,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:34,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:34,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:34,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:34,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:34,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 40 [2023-11-24 21:58:34,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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-24 21:58:34,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:34,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 40 [2023-11-24 21:58:34,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:34,508 INFO L124 PetriNetUnfolderBase]: 315/628 cut-off events. [2023-11-24 21:58:34,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:34,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 628 events. 315/628 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4109 event pairs, 60 based on Foata normal form. 24/635 useless extension candidates. Maximal degree in co-relation 1140. Up to 382 conditions per place. [2023-11-24 21:58:34,525 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 23 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-11-24 21:58:34,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 151 flow [2023-11-24 21:58:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-24 21:58:34,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2023-11-24 21:58:34,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-24 21:58:34,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-24 21:58:34,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:34,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-24 21:58:34,549 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-24 21:58:34,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:34,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:34,558 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 90 transitions. [2023-11-24 21:58:34,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 151 flow [2023-11-24 21:58:34,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:58:34,566 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2023-11-24 21:58:34,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-11-24 21:58:34,573 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-24 21:58:34,573 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2023-11-24 21:58:34,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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-24 21:58:34,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:34,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:34,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:58:34,574 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:34,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1130177280, now seen corresponding path program 1 times [2023-11-24 21:58:34,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:34,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820287286] [2023-11-24 21:58:34,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:36,041 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-24 21:58:36,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:36,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820287286] [2023-11-24 21:58:36,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820287286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:36,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:36,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:58:36,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435190178] [2023-11-24 21:58:36,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:36,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:58:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:36,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:58:36,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:58:36,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-24 21:58:36,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:36,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:36,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-24 21:58:36,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:37,279 INFO L124 PetriNetUnfolderBase]: 1575/2637 cut-off events. [2023-11-24 21:58:37,279 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-11-24 21:58:37,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5153 conditions, 2637 events. 1575/2637 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 17196 event pairs, 456 based on Foata normal form. 0/2568 useless extension candidates. Maximal degree in co-relation 5143. Up to 1298 conditions per place. [2023-11-24 21:58:37,303 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 35 selfloop transitions, 9 changer transitions 64/120 dead transitions. [2023-11-24 21:58:37,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 120 transitions, 482 flow [2023-11-24 21:58:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 21:58:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-24 21:58:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 291 transitions. [2023-11-24 21:58:37,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.60625 [2023-11-24 21:58:37,315 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 291 transitions. [2023-11-24 21:58:37,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 291 transitions. [2023-11-24 21:58:37,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:37,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 291 transitions. [2023-11-24 21:58:37,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 24.25) internal successors, (291), 12 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:37,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 40.0) internal successors, (520), 13 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:37,330 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 40.0) internal successors, (520), 13 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:37,331 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 12 states and 291 transitions. [2023-11-24 21:58:37,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 120 transitions, 482 flow [2023-11-24 21:58:37,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 120 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:37,340 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 158 flow [2023-11-24 21:58:37,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=158, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2023-11-24 21:58:37,346 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2023-11-24 21:58:37,347 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 158 flow [2023-11-24 21:58:37,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:37,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:37,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:37,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:58:37,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:37,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1130985827, now seen corresponding path program 1 times [2023-11-24 21:58:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:37,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184685010] [2023-11-24 21:58:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:38,641 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-24 21:58:38,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:38,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184685010] [2023-11-24 21:58:38,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184685010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:38,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:38,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:58:38,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742892572] [2023-11-24 21:58:38,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:38,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:58:38,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:38,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:58:38,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:58:38,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-24 21:58:38,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:38,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:38,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-24 21:58:38,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:39,757 INFO L124 PetriNetUnfolderBase]: 1671/2747 cut-off events. [2023-11-24 21:58:39,757 INFO L125 PetriNetUnfolderBase]: For 5270/5270 co-relation queries the response was YES. [2023-11-24 21:58:39,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9007 conditions, 2747 events. 1671/2747 cut-off events. For 5270/5270 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17166 event pairs, 238 based on Foata normal form. 72/2812 useless extension candidates. Maximal degree in co-relation 8988. Up to 1763 conditions per place. [2023-11-24 21:58:39,796 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 38 selfloop transitions, 15 changer transitions 49/113 dead transitions. [2023-11-24 21:58:39,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 113 transitions, 704 flow [2023-11-24 21:58:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:58:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:58:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2023-11-24 21:58:39,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5875 [2023-11-24 21:58:39,800 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 235 transitions. [2023-11-24 21:58:39,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 235 transitions. [2023-11-24 21:58:39,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:39,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 235 transitions. [2023-11-24 21:58:39,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:39,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:39,806 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:39,806 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 158 flow. Second operand 10 states and 235 transitions. [2023-11-24 21:58:39,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 113 transitions, 704 flow [2023-11-24 21:58:39,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 640 flow, removed 32 selfloop flow, removed 5 redundant places. [2023-11-24 21:58:39,842 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 261 flow [2023-11-24 21:58:39,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=261, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2023-11-24 21:58:39,843 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2023-11-24 21:58:39,843 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 261 flow [2023-11-24 21:58:39,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:39,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:39,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:39,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:58:39,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:39,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1644264994, now seen corresponding path program 1 times [2023-11-24 21:58:39,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:39,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800585239] [2023-11-24 21:58:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:40,747 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-24 21:58:40,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800585239] [2023-11-24 21:58:40,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800585239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:40,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:40,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:58:40,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810568958] [2023-11-24 21:58:40,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:40,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:58:40,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:40,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:58:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:58:40,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-24 21:58:40,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:40,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:40,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-24 21:58:40,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:41,667 INFO L124 PetriNetUnfolderBase]: 1898/3386 cut-off events. [2023-11-24 21:58:41,667 INFO L125 PetriNetUnfolderBase]: For 12128/12135 co-relation queries the response was YES. [2023-11-24 21:58:41,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13414 conditions, 3386 events. 1898/3386 cut-off events. For 12128/12135 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 23880 event pairs, 352 based on Foata normal form. 91/3459 useless extension candidates. Maximal degree in co-relation 13390. Up to 1343 conditions per place. [2023-11-24 21:58:41,713 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 46 selfloop transitions, 12 changer transitions 29/100 dead transitions. [2023-11-24 21:58:41,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 100 transitions, 778 flow [2023-11-24 21:58:41,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:58:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:58:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2023-11-24 21:58:41,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.60625 [2023-11-24 21:58:41,716 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 194 transitions. [2023-11-24 21:58:41,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 194 transitions. [2023-11-24 21:58:41,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:41,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 194 transitions. [2023-11-24 21:58:41,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 24.25) internal successors, (194), 8 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,719 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,719 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 261 flow. Second operand 8 states and 194 transitions. [2023-11-24 21:58:41,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 100 transitions, 778 flow [2023-11-24 21:58:41,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 100 transitions, 706 flow, removed 36 selfloop flow, removed 4 redundant places. [2023-11-24 21:58:41,757 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 354 flow [2023-11-24 21:58:41,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=354, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2023-11-24 21:58:41,759 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2023-11-24 21:58:41,760 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 354 flow [2023-11-24 21:58:41,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:41,760 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-24 21:58:41,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:58:41,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:41,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash 18686087, now seen corresponding path program 1 times [2023-11-24 21:58:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:41,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359982287] [2023-11-24 21:58:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:41,979 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-24 21:58:41,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359982287] [2023-11-24 21:58:41,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359982287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:41,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:41,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83059198] [2023-11-24 21:58:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:41,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:41,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:41,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:41,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-24 21:58:41,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 354 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:41,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-24 21:58:41,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:42,949 INFO L124 PetriNetUnfolderBase]: 2866/4772 cut-off events. [2023-11-24 21:58:42,950 INFO L125 PetriNetUnfolderBase]: For 9263/9662 co-relation queries the response was YES. [2023-11-24 21:58:42,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15592 conditions, 4772 events. 2866/4772 cut-off events. For 9263/9662 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 31362 event pairs, 476 based on Foata normal form. 366/4913 useless extension candidates. Maximal degree in co-relation 15564. Up to 2456 conditions per place. [2023-11-24 21:58:43,015 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 56 selfloop transitions, 5 changer transitions 1/82 dead transitions. [2023-11-24 21:58:43,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 613 flow [2023-11-24 21:58:43,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2023-11-24 21:58:43,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.675 [2023-11-24 21:58:43,017 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 108 transitions. [2023-11-24 21:58:43,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 108 transitions. [2023-11-24 21:58:43,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:43,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 108 transitions. [2023-11-24 21:58:43,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,019 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,020 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 354 flow. Second operand 4 states and 108 transitions. [2023-11-24 21:58:43,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 613 flow [2023-11-24 21:58:43,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 589 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-24 21:58:43,058 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 339 flow [2023-11-24 21:58:43,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=339, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-11-24 21:58:43,060 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2023-11-24 21:58:43,060 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 339 flow [2023-11-24 21:58:43,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:43,060 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-24 21:58:43,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:58:43,061 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:43,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:43,062 INFO L85 PathProgramCache]: Analyzing trace with hash -699554624, now seen corresponding path program 1 times [2023-11-24 21:58:43,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:43,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634300063] [2023-11-24 21:58:43,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:43,893 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-24 21:58:43,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:43,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634300063] [2023-11-24 21:58:43,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634300063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:43,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:58:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464712278] [2023-11-24 21:58:43,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:43,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:58:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:43,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:58:43,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:58:43,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2023-11-24 21:58:43,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 339 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:43,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2023-11-24 21:58:43,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:44,829 INFO L124 PetriNetUnfolderBase]: 1897/3591 cut-off events. [2023-11-24 21:58:44,830 INFO L125 PetriNetUnfolderBase]: For 6567/6729 co-relation queries the response was YES. [2023-11-24 21:58:44,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12395 conditions, 3591 events. 1897/3591 cut-off events. For 6567/6729 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 26222 event pairs, 499 based on Foata normal form. 97/3471 useless extension candidates. Maximal degree in co-relation 12368. Up to 2177 conditions per place. [2023-11-24 21:58:44,879 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 45 selfloop transitions, 12 changer transitions 10/92 dead transitions. [2023-11-24 21:58:44,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 667 flow [2023-11-24 21:58:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:58:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:58:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2023-11-24 21:58:44,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-24 21:58:44,882 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 192 transitions. [2023-11-24 21:58:44,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 192 transitions. [2023-11-24 21:58:44,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:44,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 192 transitions. [2023-11-24 21:58:44,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 24.0) internal successors, (192), 8 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,885 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,885 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 339 flow. Second operand 8 states and 192 transitions. [2023-11-24 21:58:44,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 667 flow [2023-11-24 21:58:44,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 92 transitions, 665 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:58:44,897 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 410 flow [2023-11-24 21:58:44,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2023-11-24 21:58:44,901 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2023-11-24 21:58:44,901 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 410 flow [2023-11-24 21:58:44,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:44,902 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-24 21:58:44,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:58:44,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:44,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1049140640, now seen corresponding path program 1 times [2023-11-24 21:58:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:44,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174838081] [2023-11-24 21:58:44,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:44,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:45,115 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-24 21:58:45,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:45,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174838081] [2023-11-24 21:58:45,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174838081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:45,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:45,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:58:45,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846002048] [2023-11-24 21:58:45,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:45,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:45,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:45,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:45,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-24 21:58:45,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:45,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:45,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-24 21:58:45,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:45,813 INFO L124 PetriNetUnfolderBase]: 2054/3464 cut-off events. [2023-11-24 21:58:45,813 INFO L125 PetriNetUnfolderBase]: For 6754/7584 co-relation queries the response was YES. [2023-11-24 21:58:45,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12009 conditions, 3464 events. 2054/3464 cut-off events. For 6754/7584 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21342 event pairs, 261 based on Foata normal form. 307/3583 useless extension candidates. Maximal degree in co-relation 11978. Up to 1069 conditions per place. [2023-11-24 21:58:45,844 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 60 selfloop transitions, 8 changer transitions 8/96 dead transitions. [2023-11-24 21:58:45,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 754 flow [2023-11-24 21:58:45,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:58:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:58:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2023-11-24 21:58:45,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.685 [2023-11-24 21:58:45,847 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 137 transitions. [2023-11-24 21:58:45,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 137 transitions. [2023-11-24 21:58:45,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:45,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 137 transitions. [2023-11-24 21:58:45,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:45,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:45,849 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:45,849 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 410 flow. Second operand 5 states and 137 transitions. [2023-11-24 21:58:45,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 754 flow [2023-11-24 21:58:45,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 722 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:45,865 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 387 flow [2023-11-24 21:58:45,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2023-11-24 21:58:45,866 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2023-11-24 21:58:45,866 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 387 flow [2023-11-24 21:58:45,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:45,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:45,867 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] [2023-11-24 21:58:45,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:58:45,867 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:45,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1622245436, now seen corresponding path program 1 times [2023-11-24 21:58:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515278852] [2023-11-24 21:58:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:46,093 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-24 21:58:46,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:46,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515278852] [2023-11-24 21:58:46,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515278852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:46,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:46,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:58:46,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556952296] [2023-11-24 21:58:46,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:46,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:58:46,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:46,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:58:46,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:58:46,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-24 21:58:46,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:46,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-24 21:58:46,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:46,696 INFO L124 PetriNetUnfolderBase]: 1574/2644 cut-off events. [2023-11-24 21:58:46,696 INFO L125 PetriNetUnfolderBase]: For 7603/9067 co-relation queries the response was YES. [2023-11-24 21:58:46,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10237 conditions, 2644 events. 1574/2644 cut-off events. For 7603/9067 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 15812 event pairs, 211 based on Foata normal form. 204/2667 useless extension candidates. Maximal degree in co-relation 10204. Up to 964 conditions per place. [2023-11-24 21:58:46,718 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 44 selfloop transitions, 11 changer transitions 18/88 dead transitions. [2023-11-24 21:58:46,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 88 transitions, 677 flow [2023-11-24 21:58:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:58:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:58:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2023-11-24 21:58:46,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2023-11-24 21:58:46,724 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 152 transitions. [2023-11-24 21:58:46,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 152 transitions. [2023-11-24 21:58:46,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:46,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 152 transitions. [2023-11-24 21:58:46,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,727 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,727 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 387 flow. Second operand 6 states and 152 transitions. [2023-11-24 21:58:46,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 88 transitions, 677 flow [2023-11-24 21:58:46,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 605 flow, removed 24 selfloop flow, removed 8 redundant places. [2023-11-24 21:58:46,741 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 305 flow [2023-11-24 21:58:46,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2023-11-24 21:58:46,745 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2023-11-24 21:58:46,745 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 305 flow [2023-11-24 21:58:46,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:46,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:46,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:58:46,746 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:46,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash 649407807, now seen corresponding path program 1 times [2023-11-24 21:58:46,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:46,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472994418] [2023-11-24 21:58:46,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:46,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:47,069 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-24 21:58:47,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:47,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472994418] [2023-11-24 21:58:47,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472994418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:47,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:47,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:58:47,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243652467] [2023-11-24 21:58:47,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:47,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:58:47,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:47,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:58:47,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:58:47,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-24 21:58:47,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:47,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-24 21:58:47,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:47,460 INFO L124 PetriNetUnfolderBase]: 719/1595 cut-off events. [2023-11-24 21:58:47,461 INFO L125 PetriNetUnfolderBase]: For 3661/3900 co-relation queries the response was YES. [2023-11-24 21:58:47,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5107 conditions, 1595 events. 719/1595 cut-off events. For 3661/3900 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11133 event pairs, 140 based on Foata normal form. 30/1459 useless extension candidates. Maximal degree in co-relation 5078. Up to 529 conditions per place. [2023-11-24 21:58:47,472 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 24 selfloop transitions, 1 changer transitions 30/78 dead transitions. [2023-11-24 21:58:47,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 527 flow [2023-11-24 21:58:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:58:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:58:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2023-11-24 21:58:47,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-24 21:58:47,474 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 144 transitions. [2023-11-24 21:58:47,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 144 transitions. [2023-11-24 21:58:47,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:47,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 144 transitions. [2023-11-24 21:58:47,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,476 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,477 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 305 flow. Second operand 6 states and 144 transitions. [2023-11-24 21:58:47,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 527 flow [2023-11-24 21:58:47,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 78 transitions, 468 flow, removed 22 selfloop flow, removed 6 redundant places. [2023-11-24 21:58:47,497 INFO L231 Difference]: Finished difference. Result has 74 places, 44 transitions, 232 flow [2023-11-24 21:58:47,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=74, PETRI_TRANSITIONS=44} [2023-11-24 21:58:47,498 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2023-11-24 21:58:47,499 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 44 transitions, 232 flow [2023-11-24 21:58:47,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:47,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:47,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:58:47,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:47,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash 421700953, now seen corresponding path program 2 times [2023-11-24 21:58:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:47,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113954868] [2023-11-24 21:58:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:48,940 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-24 21:58:48,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113954868] [2023-11-24 21:58:48,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113954868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:48,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 21:58:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644896612] [2023-11-24 21:58:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:48,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 21:58:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:48,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 21:58:48,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-24 21:58:48,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2023-11-24 21:58:48,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 44 transitions, 232 flow. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:48,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:48,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2023-11-24 21:58:48,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:49,513 INFO L124 PetriNetUnfolderBase]: 654/1363 cut-off events. [2023-11-24 21:58:49,514 INFO L125 PetriNetUnfolderBase]: For 1313/1416 co-relation queries the response was YES. [2023-11-24 21:58:49,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 1363 events. 654/1363 cut-off events. For 1313/1416 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8909 event pairs, 278 based on Foata normal form. 30/1214 useless extension candidates. Maximal degree in co-relation 3736. Up to 345 conditions per place. [2023-11-24 21:58:49,523 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 30 selfloop transitions, 5 changer transitions 22/79 dead transitions. [2023-11-24 21:58:49,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 79 transitions, 472 flow [2023-11-24 21:58:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:58:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:58:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2023-11-24 21:58:49,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2023-11-24 21:58:49,526 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 206 transitions. [2023-11-24 21:58:49,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 206 transitions. [2023-11-24 21:58:49,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:49,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 206 transitions. [2023-11-24 21:58:49,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 22.88888888888889) internal successors, (206), 9 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:49,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:49,529 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:49,529 INFO L175 Difference]: Start difference. First operand has 74 places, 44 transitions, 232 flow. Second operand 9 states and 206 transitions. [2023-11-24 21:58:49,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 79 transitions, 472 flow [2023-11-24 21:58:49,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 79 transitions, 422 flow, removed 12 selfloop flow, removed 11 redundant places. [2023-11-24 21:58:49,540 INFO L231 Difference]: Finished difference. Result has 72 places, 43 transitions, 223 flow [2023-11-24 21:58:49,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=223, PETRI_PLACES=72, PETRI_TRANSITIONS=43} [2023-11-24 21:58:49,541 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2023-11-24 21:58:49,542 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 43 transitions, 223 flow [2023-11-24 21:58:49,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:49,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:49,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:49,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:58:49,543 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:58:49,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1929403635, now seen corresponding path program 3 times [2023-11-24 21:58:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:49,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523067304] [2023-11-24 21:58:49,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:58:49,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:58:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:58:49,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:58:49,691 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:58:49,693 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-24 21:58:49,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-24 21:58:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-24 21:58:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-24 21:58:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-24 21:58:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-24 21:58:49,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:58:49,696 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:49,703 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:58:49,703 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:58:49,774 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-24 21:58:49,776 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:58:49,780 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:58:49,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:58:49 BasicIcfg [2023-11-24 21:58:49,823 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:58:49,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:58:49,824 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:58:49,824 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:58:49,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:33" (3/4) ... [2023-11-24 21:58:49,825 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-24 21:58:49,860 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-24 21:58:49,863 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:58:49,864 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:58:49,951 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/witness.graphml [2023-11-24 21:58:49,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:58:49,952 INFO L158 Benchmark]: Toolchain (without parser) took 18637.73ms. Allocated memory was 140.5MB in the beginning and 467.7MB in the end (delta: 327.2MB). Free memory was 92.1MB in the beginning and 324.1MB in the end (delta: -232.0MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2023-11-24 21:58:49,952 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 140.5MB. Free memory was 112.0MB in the beginning and 111.9MB in the end (delta: 80.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:58:49,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.06ms. Allocated memory is still 140.5MB. Free memory was 92.1MB in the beginning and 68.7MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-24 21:58:49,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.32ms. Allocated memory is still 140.5MB. Free memory was 68.7MB in the beginning and 65.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:58:49,953 INFO L158 Benchmark]: Boogie Preprocessor took 71.38ms. Allocated memory is still 140.5MB. Free memory was 65.9MB in the beginning and 62.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:58:49,954 INFO L158 Benchmark]: RCFGBuilder took 1052.46ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 62.4MB in the beginning and 140.3MB in the end (delta: -77.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-24 21:58:49,954 INFO L158 Benchmark]: TraceAbstraction took 16621.79ms. Allocated memory was 205.5MB in the beginning and 467.7MB in the end (delta: 262.1MB). Free memory was 140.3MB in the beginning and 335.6MB in the end (delta: -195.3MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2023-11-24 21:58:49,955 INFO L158 Benchmark]: Witness Printer took 127.94ms. Allocated memory is still 467.7MB. Free memory was 335.6MB in the beginning and 324.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-24 21:58:49,959 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.34ms. Allocated memory is still 140.5MB. Free memory was 112.0MB in the beginning and 111.9MB in the end (delta: 80.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.06ms. Allocated memory is still 140.5MB. Free memory was 92.1MB in the beginning and 68.7MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.32ms. Allocated memory is still 140.5MB. Free memory was 68.7MB in the beginning and 65.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.38ms. Allocated memory is still 140.5MB. Free memory was 65.9MB in the beginning and 62.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1052.46ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 62.4MB in the beginning and 140.3MB in the end (delta: -77.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16621.79ms. Allocated memory was 205.5MB in the beginning and 467.7MB in the end (delta: 262.1MB). Free memory was 140.3MB in the beginning and 335.6MB in the end (delta: -195.3MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Witness Printer took 127.94ms. Allocated memory is still 467.7MB. Free memory was 335.6MB in the beginning and 324.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_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=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_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=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 820]: 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: 816]: 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, 66 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: 16.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 486 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 459 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1219 IncrementalHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 53 mSDtfsCounter, 1219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=6, InterpolantAutomatonStates: 71, 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, 6.9s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1685 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-24 21:58:49,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8185b859-c616-4fa0-9bcf-2f3137e288e8/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE