./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:34:37,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:34:37,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:34:37,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:34:37,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:34:37,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:34:37,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:34:37,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:34:37,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:34:37,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:34:37,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:34:37,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:34:37,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:34:37,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:34:37,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:34:37,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:34:37,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:34:37,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:34:37,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:34:37,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:34:37,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:34:37,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:34:37,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:34:37,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:34:37,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:34:37,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:34:37,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:34:37,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:34:37,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:34:37,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:34:37,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:34:37,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:34:37,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:34:37,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:34:37,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:34:37,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:34:37,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:34:37,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:34:37,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:34:37,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:34:37,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:34:37,287 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:34:37,311 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:34:37,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:34:37,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:34:37,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:34:37,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:34:37,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:34:37,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:34:37,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:34:37,315 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:34:37,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:34:37,316 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:34:37,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:34:37,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:34:37,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:34:37,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:34:37,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:34:37,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:34:37,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:34:37,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:34:37,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:34:37,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:34:37,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:34:37,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:34:37,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:34:37,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:34:37,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:34:37,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:34:37,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:34:37,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:34:37,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:34:37,322 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:34:37,322 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:34:37,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:34:37,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/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_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd [2022-11-02 20:34:37,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:34:37,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:34:37,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:34:37,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:34:37,668 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:34:37,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-02 20:34:37,751 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/data/4afd35761/79d8ea5d84b54adfb73bca1ae2c61fb2/FLAG1c7915e23 [2022-11-02 20:34:38,493 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:34:38,495 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-02 20:34:38,514 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/data/4afd35761/79d8ea5d84b54adfb73bca1ae2c61fb2/FLAG1c7915e23 [2022-11-02 20:34:38,726 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/data/4afd35761/79d8ea5d84b54adfb73bca1ae2c61fb2 [2022-11-02 20:34:38,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:34:38,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:34:38,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:34:38,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:34:38,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:34:38,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:34:38" (1/1) ... [2022-11-02 20:34:38,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdb1e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:38, skipping insertion in model container [2022-11-02 20:34:38,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:34:38" (1/1) ... [2022-11-02 20:34:38,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:34:38,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:34:39,011 WARN L230 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_e66cf238-99f9-4a11-b3df-2211ee21901c/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-02 20:34:39,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:34:39,347 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:34:39,365 WARN L230 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_e66cf238-99f9-4a11-b3df-2211ee21901c/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-02 20:34:39,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:34:39,468 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:34:39,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39 WrapperNode [2022-11-02 20:34:39,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:34:39,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:34:39,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:34:39,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:34:39,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,564 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 192 [2022-11-02 20:34:39,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:34:39,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:34:39,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:34:39,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:34:39,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,632 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:34:39,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:34:39,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:34:39,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:34:39,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (1/1) ... [2022-11-02 20:34:39,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:34:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:39,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:34:39,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:34:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:34:39,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:34:39,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:34:39,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:34:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:34:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 20:34:39,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 20:34:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 20:34:39,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 20:34:39,756 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 20:34:39,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 20:34:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-02 20:34:39,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-02 20:34:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:34:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:34:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:34:39,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:34:39,761 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:34:40,061 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:34:40,063 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:34:40,638 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:34:41,192 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:34:41,193 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:34:41,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:34:41 BoogieIcfgContainer [2022-11-02 20:34:41,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:34:41,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:34:41,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:34:41,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:34:41,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:34:38" (1/3) ... [2022-11-02 20:34:41,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb9117e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:34:41, skipping insertion in model container [2022-11-02 20:34:41,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:39" (2/3) ... [2022-11-02 20:34:41,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb9117e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:34:41, skipping insertion in model container [2022-11-02 20:34:41,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:34:41" (3/3) ... [2022-11-02 20:34:41,212 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-02 20:34:41,223 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:34:41,236 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:34:41,237 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:34:41,237 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:34:41,348 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:34:41,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-11-02 20:34:41,472 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-02 20:34:41,473 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:34:41,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-11-02 20:34:41,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-11-02 20:34:41,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-11-02 20:34:41,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:34:41,531 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=LoopsAndPotentialCycles, 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;@3113dbdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:34:41,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-02 20:34:41,586 INFO L130 PetriNetUnfolder]: 0/90 cut-off events. [2022-11-02 20:34:41,586 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:34:41,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:34:41,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:41,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:34:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash 524967423, now seen corresponding path program 1 times [2022-11-02 20:34:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:41,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595871991] [2022-11-02 20:34:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:42,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:42,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595871991] [2022-11-02 20:34:42,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595871991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:42,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:42,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:34:42,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399786213] [2022-11-02 20:34:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:42,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:42,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:42,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:42,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:42,456 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 133 [2022-11-02 20:34:42,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:42,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:34:42,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 133 [2022-11-02 20:34:42,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:34:42,590 INFO L130 PetriNetUnfolder]: 10/201 cut-off events. [2022-11-02 20:34:42,590 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:34:42,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 201 events. 10/201 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 362 event pairs, 4 based on Foata normal form. 5/197 useless extension candidates. Maximal degree in co-relation 187. Up to 17 conditions per place. [2022-11-02 20:34:42,595 INFO L137 encePairwiseOnDemand]: 128/133 looper letters, 9 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2022-11-02 20:34:42,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 127 transitions, 288 flow [2022-11-02 20:34:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:34:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-11-02 20:34:42,616 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9423558897243107 [2022-11-02 20:34:42,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2022-11-02 20:34:42,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2022-11-02 20:34:42,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:34:42,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2022-11-02 20:34:42,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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) [2022-11-02 20:34:42,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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) [2022-11-02 20:34:42,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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) [2022-11-02 20:34:42,650 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 3 states and 376 transitions. [2022-11-02 20:34:42,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 127 transitions, 288 flow [2022-11-02 20:34:42,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 127 transitions, 284 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:34:42,661 INFO L231 Difference]: Finished difference. Result has 136 places, 125 transitions, 262 flow [2022-11-02 20:34:42,664 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2022-11-02 20:34:42,671 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, -4 predicate places. [2022-11-02 20:34:42,671 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 262 flow [2022-11-02 20:34:42,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:42,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:34:42,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:34:42,676 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:34:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:42,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1408801840, now seen corresponding path program 1 times [2022-11-02 20:34:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:42,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162657836] [2022-11-02 20:34:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:43,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162657836] [2022-11-02 20:34:43,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162657836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:43,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:43,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:34:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30043085] [2022-11-02 20:34:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:43,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:34:43,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:43,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:34:43,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:34:43,426 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2022-11-02 20:34:43,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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) [2022-11-02 20:34:43,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:34:43,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2022-11-02 20:34:43,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:34:45,575 INFO L130 PetriNetUnfolder]: 1843/5139 cut-off events. [2022-11-02 20:34:45,576 INFO L131 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2022-11-02 20:34:45,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8169 conditions, 5139 events. 1843/5139 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 46752 event pairs, 504 based on Foata normal form. 0/4987 useless extension candidates. Maximal degree in co-relation 8110. Up to 1243 conditions per place. [2022-11-02 20:34:45,628 INFO L137 encePairwiseOnDemand]: 123/133 looper letters, 30 selfloop transitions, 6 changer transitions 66/191 dead transitions. [2022-11-02 20:34:45,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 191 transitions, 590 flow [2022-11-02 20:34:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:34:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:34:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1045 transitions. [2022-11-02 20:34:45,637 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.873015873015873 [2022-11-02 20:34:45,638 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1045 transitions. [2022-11-02 20:34:45,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1045 transitions. [2022-11-02 20:34:45,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:34:45,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1045 transitions. [2022-11-02 20:34:45,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 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) [2022-11-02 20:34:45,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 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) [2022-11-02 20:34:45,649 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 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) [2022-11-02 20:34:45,650 INFO L175 Difference]: Start difference. First operand has 136 places, 125 transitions, 262 flow. Second operand 9 states and 1045 transitions. [2022-11-02 20:34:45,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 191 transitions, 590 flow [2022-11-02 20:34:45,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 191 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:34:45,661 INFO L231 Difference]: Finished difference. Result has 150 places, 116 transitions, 318 flow [2022-11-02 20:34:45,662 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=318, PETRI_PLACES=150, PETRI_TRANSITIONS=116} [2022-11-02 20:34:45,663 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places. [2022-11-02 20:34:45,663 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 116 transitions, 318 flow [2022-11-02 20:34:45,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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) [2022-11-02 20:34:45,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:34:45,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-02 20:34:45,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:34:45,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:34:45,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1797657935, now seen corresponding path program 1 times [2022-11-02 20:34:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:45,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495566087] [2022-11-02 20:34:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:45,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:46,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495566087] [2022-11-02 20:34:46,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495566087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:46,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:46,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:34:46,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777431127] [2022-11-02 20:34:46,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:46,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:34:46,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:46,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:34:46,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:34:46,167 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-11-02 20:34:46,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 116 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:46,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:34:46,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-11-02 20:34:46,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:34:49,978 INFO L130 PetriNetUnfolder]: 5923/10758 cut-off events. [2022-11-02 20:34:49,978 INFO L131 PetriNetUnfolder]: For 10369/12050 co-relation queries the response was YES. [2022-11-02 20:34:50,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25445 conditions, 10758 events. 5923/10758 cut-off events. For 10369/12050 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 91487 event pairs, 376 based on Foata normal form. 56/9974 useless extension candidates. Maximal degree in co-relation 25381. Up to 3472 conditions per place. [2022-11-02 20:34:50,165 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 51 selfloop transitions, 16 changer transitions 22/184 dead transitions. [2022-11-02 20:34:50,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 184 transitions, 722 flow [2022-11-02 20:34:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:34:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:34:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1173 transitions. [2022-11-02 20:34:50,169 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8819548872180452 [2022-11-02 20:34:50,169 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1173 transitions. [2022-11-02 20:34:50,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1173 transitions. [2022-11-02 20:34:50,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:34:50,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1173 transitions. [2022-11-02 20:34:50,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.3) internal successors, (1173), 10 states have internal predecessors, (1173), 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) [2022-11-02 20:34:50,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 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) [2022-11-02 20:34:50,177 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 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) [2022-11-02 20:34:50,177 INFO L175 Difference]: Start difference. First operand has 150 places, 116 transitions, 318 flow. Second operand 10 states and 1173 transitions. [2022-11-02 20:34:50,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 184 transitions, 722 flow [2022-11-02 20:34:50,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 184 transitions, 690 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-02 20:34:50,202 INFO L231 Difference]: Finished difference. Result has 143 places, 130 transitions, 421 flow [2022-11-02 20:34:50,202 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=421, PETRI_PLACES=143, PETRI_TRANSITIONS=130} [2022-11-02 20:34:50,203 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 3 predicate places. [2022-11-02 20:34:50,203 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 130 transitions, 421 flow [2022-11-02 20:34:50,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:50,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:34:50,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-02 20:34:50,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:34:50,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:34:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2096063132, now seen corresponding path program 1 times [2022-11-02 20:34:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:50,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513264848] [2022-11-02 20:34:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:50,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:50,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513264848] [2022-11-02 20:34:50,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513264848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:50,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:50,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:34:50,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49878985] [2022-11-02 20:34:50,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:50,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:34:50,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:50,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:34:50,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:34:50,506 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-11-02 20:34:50,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 130 transitions, 421 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 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) [2022-11-02 20:34:50,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:34:50,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-11-02 20:34:50,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:34:54,275 INFO L130 PetriNetUnfolder]: 5279/9910 cut-off events. [2022-11-02 20:34:54,276 INFO L131 PetriNetUnfolder]: For 23959/26175 co-relation queries the response was YES. [2022-11-02 20:34:54,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33687 conditions, 9910 events. 5279/9910 cut-off events. For 23959/26175 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 87291 event pairs, 194 based on Foata normal form. 348/9702 useless extension candidates. Maximal degree in co-relation 33616. Up to 3108 conditions per place. [2022-11-02 20:34:54,399 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 83 selfloop transitions, 32 changer transitions 7/217 dead transitions. [2022-11-02 20:34:54,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 217 transitions, 1145 flow [2022-11-02 20:34:54,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:34:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:34:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1524 transitions. [2022-11-02 20:34:54,404 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8814343551185656 [2022-11-02 20:34:54,405 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1524 transitions. [2022-11-02 20:34:54,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1524 transitions. [2022-11-02 20:34:54,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:34:54,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1524 transitions. [2022-11-02 20:34:54,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.23076923076923) internal successors, (1524), 13 states have internal predecessors, (1524), 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) [2022-11-02 20:34:54,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 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) [2022-11-02 20:34:54,416 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 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) [2022-11-02 20:34:54,417 INFO L175 Difference]: Start difference. First operand has 143 places, 130 transitions, 421 flow. Second operand 13 states and 1524 transitions. [2022-11-02 20:34:54,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 217 transitions, 1145 flow [2022-11-02 20:34:54,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 217 transitions, 1137 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-02 20:34:54,539 INFO L231 Difference]: Finished difference. Result has 157 places, 148 transitions, 678 flow [2022-11-02 20:34:54,539 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=678, PETRI_PLACES=157, PETRI_TRANSITIONS=148} [2022-11-02 20:34:54,540 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 17 predicate places. [2022-11-02 20:34:54,541 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 148 transitions, 678 flow [2022-11-02 20:34:54,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 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) [2022-11-02 20:34:54,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:34:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:54,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:34:54,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:34:54,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash 532703970, now seen corresponding path program 1 times [2022-11-02 20:34:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:54,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596755411] [2022-11-02 20:34:54,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:54,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:54,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596755411] [2022-11-02 20:34:54,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596755411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:54,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:54,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:34:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277128425] [2022-11-02 20:34:54,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:54,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:34:54,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:54,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:34:54,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:34:54,938 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-11-02 20:34:54,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 148 transitions, 678 flow. Second operand has 8 states, 8 states have (on average 110.75) internal successors, (886), 8 states have internal predecessors, (886), 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) [2022-11-02 20:34:54,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:34:54,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-11-02 20:34:54,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:34:58,043 INFO L130 PetriNetUnfolder]: 4780/9613 cut-off events. [2022-11-02 20:34:58,043 INFO L131 PetriNetUnfolder]: For 46754/49882 co-relation queries the response was YES. [2022-11-02 20:34:58,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40885 conditions, 9613 events. 4780/9613 cut-off events. For 46754/49882 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 90419 event pairs, 211 based on Foata normal form. 447/9506 useless extension candidates. Maximal degree in co-relation 40809. Up to 3037 conditions per place. [2022-11-02 20:34:58,141 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 80 selfloop transitions, 50 changer transitions 27/252 dead transitions. [2022-11-02 20:34:58,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 252 transitions, 1740 flow [2022-11-02 20:34:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:34:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:34:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1878 transitions. [2022-11-02 20:34:58,147 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8825187969924813 [2022-11-02 20:34:58,148 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1878 transitions. [2022-11-02 20:34:58,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1878 transitions. [2022-11-02 20:34:58,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:34:58,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1878 transitions. [2022-11-02 20:34:58,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.375) internal successors, (1878), 16 states have internal predecessors, (1878), 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) [2022-11-02 20:34:58,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 133.0) internal successors, (2261), 17 states have internal predecessors, (2261), 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) [2022-11-02 20:34:58,161 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 133.0) internal successors, (2261), 17 states have internal predecessors, (2261), 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) [2022-11-02 20:34:58,161 INFO L175 Difference]: Start difference. First operand has 157 places, 148 transitions, 678 flow. Second operand 16 states and 1878 transitions. [2022-11-02 20:34:58,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 252 transitions, 1740 flow [2022-11-02 20:34:58,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 252 transitions, 1641 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-11-02 20:34:58,798 INFO L231 Difference]: Finished difference. Result has 172 places, 172 transitions, 1013 flow [2022-11-02 20:34:58,798 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1013, PETRI_PLACES=172, PETRI_TRANSITIONS=172} [2022-11-02 20:34:58,799 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 32 predicate places. [2022-11-02 20:34:58,800 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 172 transitions, 1013 flow [2022-11-02 20:34:58,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.75) internal successors, (886), 8 states have internal predecessors, (886), 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) [2022-11-02 20:34:58,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:34:58,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:58,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:34:58,801 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:34:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1284480976, now seen corresponding path program 1 times [2022-11-02 20:34:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:58,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237132767] [2022-11-02 20:34:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:59,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:59,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237132767] [2022-11-02 20:34:59,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237132767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:59,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:59,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:34:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287286804] [2022-11-02 20:34:59,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:59,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:34:59,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:59,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:34:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:34:59,322 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 133 [2022-11-02 20:34:59,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 172 transitions, 1013 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 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) [2022-11-02 20:34:59,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:34:59,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 133 [2022-11-02 20:34:59,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:00,887 INFO L130 PetriNetUnfolder]: 2038/7337 cut-off events. [2022-11-02 20:35:00,888 INFO L131 PetriNetUnfolder]: For 34723/35326 co-relation queries the response was YES. [2022-11-02 20:35:00,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27412 conditions, 7337 events. 2038/7337 cut-off events. For 34723/35326 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 91512 event pairs, 61 based on Foata normal form. 11/6871 useless extension candidates. Maximal degree in co-relation 27330. Up to 1877 conditions per place. [2022-11-02 20:35:00,968 INFO L137 encePairwiseOnDemand]: 127/133 looper letters, 38 selfloop transitions, 3 changer transitions 13/206 dead transitions. [2022-11-02 20:35:00,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 206 transitions, 1257 flow [2022-11-02 20:35:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:35:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:35:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2022-11-02 20:35:00,972 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8818474758324383 [2022-11-02 20:35:00,972 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2022-11-02 20:35:00,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2022-11-02 20:35:00,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:00,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2022-11-02 20:35:00,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 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) [2022-11-02 20:35:00,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 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) [2022-11-02 20:35:00,979 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 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) [2022-11-02 20:35:00,980 INFO L175 Difference]: Start difference. First operand has 172 places, 172 transitions, 1013 flow. Second operand 7 states and 821 transitions. [2022-11-02 20:35:00,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 206 transitions, 1257 flow [2022-11-02 20:35:02,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 206 transitions, 956 flow, removed 114 selfloop flow, removed 11 redundant places. [2022-11-02 20:35:02,449 INFO L231 Difference]: Finished difference. Result has 172 places, 174 transitions, 749 flow [2022-11-02 20:35:02,449 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=749, PETRI_PLACES=172, PETRI_TRANSITIONS=174} [2022-11-02 20:35:02,450 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 32 predicate places. [2022-11-02 20:35:02,450 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 174 transitions, 749 flow [2022-11-02 20:35:02,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 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) [2022-11-02 20:35:02,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:02,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:02,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:35:02,452 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:35:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:02,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1706663116, now seen corresponding path program 2 times [2022-11-02 20:35:02,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:02,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749419683] [2022-11-02 20:35:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:02,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:02,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749419683] [2022-11-02 20:35:02,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749419683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:02,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:02,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:35:02,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889936644] [2022-11-02 20:35:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:02,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:35:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:02,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:35:02,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:35:02,892 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-11-02 20:35:02,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 174 transitions, 749 flow. Second operand has 9 states, 9 states have (on average 110.77777777777777) internal successors, (997), 9 states have internal predecessors, (997), 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) [2022-11-02 20:35:02,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:02,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-11-02 20:35:02,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:07,029 INFO L130 PetriNetUnfolder]: 7267/14682 cut-off events. [2022-11-02 20:35:07,030 INFO L131 PetriNetUnfolder]: For 26707/31563 co-relation queries the response was YES. [2022-11-02 20:35:07,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47096 conditions, 14682 events. 7267/14682 cut-off events. For 26707/31563 co-relation queries the response was YES. Maximal size of possible extension queue 1430. Compared 149142 event pairs, 266 based on Foata normal form. 522/14364 useless extension candidates. Maximal degree in co-relation 47068. Up to 1866 conditions per place. [2022-11-02 20:35:07,168 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 60 selfloop transitions, 45 changer transitions 54/256 dead transitions. [2022-11-02 20:35:07,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 256 transitions, 1502 flow [2022-11-02 20:35:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:35:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-02 20:35:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2196 transitions. [2022-11-02 20:35:07,176 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8690146418678275 [2022-11-02 20:35:07,176 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2196 transitions. [2022-11-02 20:35:07,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2196 transitions. [2022-11-02 20:35:07,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:07,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2196 transitions. [2022-11-02 20:35:07,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 115.57894736842105) internal successors, (2196), 19 states have internal predecessors, (2196), 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) [2022-11-02 20:35:07,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 133.0) internal successors, (2660), 20 states have internal predecessors, (2660), 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) [2022-11-02 20:35:07,193 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 133.0) internal successors, (2660), 20 states have internal predecessors, (2660), 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) [2022-11-02 20:35:07,194 INFO L175 Difference]: Start difference. First operand has 172 places, 174 transitions, 749 flow. Second operand 19 states and 2196 transitions. [2022-11-02 20:35:07,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 256 transitions, 1502 flow [2022-11-02 20:35:08,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 256 transitions, 1489 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-02 20:35:08,260 INFO L231 Difference]: Finished difference. Result has 190 places, 163 transitions, 792 flow [2022-11-02 20:35:08,260 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=792, PETRI_PLACES=190, PETRI_TRANSITIONS=163} [2022-11-02 20:35:08,261 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 50 predicate places. [2022-11-02 20:35:08,261 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 163 transitions, 792 flow [2022-11-02 20:35:08,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.77777777777777) internal successors, (997), 9 states have internal predecessors, (997), 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) [2022-11-02 20:35:08,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:08,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:08,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:35:08,263 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:35:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:08,263 INFO L85 PathProgramCache]: Analyzing trace with hash -93174182, now seen corresponding path program 1 times [2022-11-02 20:35:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:08,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903861197] [2022-11-02 20:35:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:08,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:08,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:08,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903861197] [2022-11-02 20:35:08,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903861197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:08,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:08,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:35:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254363577] [2022-11-02 20:35:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:08,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:35:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:35:08,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:35:08,682 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 133 [2022-11-02 20:35:08,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 163 transitions, 792 flow. Second operand has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 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) [2022-11-02 20:35:08,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:08,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 133 [2022-11-02 20:35:08,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:10,217 INFO L130 PetriNetUnfolder]: 2285/10285 cut-off events. [2022-11-02 20:35:10,217 INFO L131 PetriNetUnfolder]: For 20545/21268 co-relation queries the response was YES. [2022-11-02 20:35:10,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30137 conditions, 10285 events. 2285/10285 cut-off events. For 20545/21268 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 147245 event pairs, 29 based on Foata normal form. 16/9734 useless extension candidates. Maximal degree in co-relation 30046. Up to 1388 conditions per place. [2022-11-02 20:35:10,336 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 30 selfloop transitions, 10 changer transitions 28/200 dead transitions. [2022-11-02 20:35:10,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 200 transitions, 1126 flow [2022-11-02 20:35:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:35:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:35:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 997 transitions. [2022-11-02 20:35:10,341 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8329156223893066 [2022-11-02 20:35:10,341 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 997 transitions. [2022-11-02 20:35:10,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 997 transitions. [2022-11-02 20:35:10,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:10,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 997 transitions. [2022-11-02 20:35:10,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.77777777777777) internal successors, (997), 9 states have internal predecessors, (997), 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) [2022-11-02 20:35:10,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 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) [2022-11-02 20:35:10,349 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 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) [2022-11-02 20:35:10,350 INFO L175 Difference]: Start difference. First operand has 190 places, 163 transitions, 792 flow. Second operand 9 states and 997 transitions. [2022-11-02 20:35:10,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 200 transitions, 1126 flow [2022-11-02 20:35:11,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 200 transitions, 967 flow, removed 46 selfloop flow, removed 17 redundant places. [2022-11-02 20:35:11,188 INFO L231 Difference]: Finished difference. Result has 183 places, 164 transitions, 727 flow [2022-11-02 20:35:11,189 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=727, PETRI_PLACES=183, PETRI_TRANSITIONS=164} [2022-11-02 20:35:11,190 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 43 predicate places. [2022-11-02 20:35:11,190 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 164 transitions, 727 flow [2022-11-02 20:35:11,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 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) [2022-11-02 20:35:11,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:11,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:11,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:35:11,191 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:35:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash -191961298, now seen corresponding path program 2 times [2022-11-02 20:35:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:11,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607628331] [2022-11-02 20:35:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:11,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:11,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607628331] [2022-11-02 20:35:11,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607628331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:11,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:11,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:35:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127773352] [2022-11-02 20:35:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:11,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:35:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:35:11,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:35:11,588 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2022-11-02 20:35:11,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 164 transitions, 727 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 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) [2022-11-02 20:35:11,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:11,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2022-11-02 20:35:11,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:12,723 INFO L130 PetriNetUnfolder]: 1560/7373 cut-off events. [2022-11-02 20:35:12,723 INFO L131 PetriNetUnfolder]: For 10074/10281 co-relation queries the response was YES. [2022-11-02 20:35:12,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19166 conditions, 7373 events. 1560/7373 cut-off events. For 10074/10281 co-relation queries the response was YES. Maximal size of possible extension queue 911. Compared 100593 event pairs, 44 based on Foata normal form. 1/7013 useless extension candidates. Maximal degree in co-relation 19136. Up to 927 conditions per place. [2022-11-02 20:35:12,846 INFO L137 encePairwiseOnDemand]: 124/133 looper letters, 21 selfloop transitions, 5 changer transitions 21/179 dead transitions. [2022-11-02 20:35:12,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 179 transitions, 875 flow [2022-11-02 20:35:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:35:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:35:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 783 transitions. [2022-11-02 20:35:12,850 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.841031149301826 [2022-11-02 20:35:12,850 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 783 transitions. [2022-11-02 20:35:12,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 783 transitions. [2022-11-02 20:35:12,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:12,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 783 transitions. [2022-11-02 20:35:12,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 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) [2022-11-02 20:35:13,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 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) [2022-11-02 20:35:13,006 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 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) [2022-11-02 20:35:13,006 INFO L175 Difference]: Start difference. First operand has 183 places, 164 transitions, 727 flow. Second operand 7 states and 783 transitions. [2022-11-02 20:35:13,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 179 transitions, 875 flow [2022-11-02 20:35:13,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 179 transitions, 846 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-11-02 20:35:13,349 INFO L231 Difference]: Finished difference. Result has 183 places, 157 transitions, 680 flow [2022-11-02 20:35:13,349 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=680, PETRI_PLACES=183, PETRI_TRANSITIONS=157} [2022-11-02 20:35:13,350 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 43 predicate places. [2022-11-02 20:35:13,350 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 157 transitions, 680 flow [2022-11-02 20:35:13,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 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) [2022-11-02 20:35:13,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:13,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:13,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:35:13,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:35:13,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1786709052, now seen corresponding path program 3 times [2022-11-02 20:35:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:13,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713565687] [2022-11-02 20:35:13,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:35:13,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:35:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:35:13,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:35:13,511 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:35:13,513 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-02 20:35:13,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-02 20:35:13,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-02 20:35:13,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-02 20:35:13,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-02 20:35:13,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-02 20:35:13,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-02 20:35:13,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:35:13,517 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-11-02 20:35:13,525 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:35:13,526 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:35:13,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:35:13 BasicIcfg [2022-11-02 20:35:13,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:35:13,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:35:13,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:35:13,740 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:35:13,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:34:41" (3/4) ... [2022-11-02 20:35:13,743 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:35:13,948 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:35:13,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:35:13,949 INFO L158 Benchmark]: Toolchain (without parser) took 35218.26ms. Allocated memory was 111.1MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 74.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 349.4MB. Max. memory is 16.1GB. [2022-11-02 20:35:13,950 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 111.1MB. Free memory was 84.6MB in the beginning and 84.6MB in the end (delta: 30.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:35:13,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 737.07ms. Allocated memory is still 111.1MB. Free memory was 74.2MB in the beginning and 72.5MB in the end (delta: 1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:35:13,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.42ms. Allocated memory is still 111.1MB. Free memory was 72.5MB in the beginning and 69.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:35:13,951 INFO L158 Benchmark]: Boogie Preprocessor took 84.71ms. Allocated memory is still 111.1MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:35:13,951 INFO L158 Benchmark]: RCFGBuilder took 1539.43ms. Allocated memory was 111.1MB in the beginning and 163.6MB in the end (delta: 52.4MB). Free memory was 67.7MB in the beginning and 122.6MB in the end (delta: -54.9MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-11-02 20:35:13,952 INFO L158 Benchmark]: TraceAbstraction took 32535.65ms. Allocated memory was 163.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 122.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 301.6MB. Max. memory is 16.1GB. [2022-11-02 20:35:13,953 INFO L158 Benchmark]: Witness Printer took 209.25ms. Allocated memory is still 2.3GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-02 20:35:13,955 INFO L339 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 111.1MB. Free memory was 84.6MB in the beginning and 84.6MB in the end (delta: 30.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 737.07ms. Allocated memory is still 111.1MB. Free memory was 74.2MB in the beginning and 72.5MB in the end (delta: 1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.42ms. Allocated memory is still 111.1MB. Free memory was 72.5MB in the beginning and 69.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.71ms. Allocated memory is still 111.1MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1539.43ms. Allocated memory was 111.1MB in the beginning and 163.6MB in the end (delta: 52.4MB). Free memory was 67.7MB in the beginning and 122.6MB in the end (delta: -54.9MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * TraceAbstraction took 32535.65ms. Allocated memory was 163.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 122.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 301.6MB. Max. memory is 16.1GB. * Witness Printer took 209.25ms. Allocated memory is still 2.3GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1365; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1365, ((void *)0), P0, ((void *)0))=-3, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1366; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1366, ((void *)0), P1, ((void *)0))=-2, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1367; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1367, ((void *)0), P2, ((void *)0))=-1, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1368; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1368, ((void *)0), P3, ((void *)0))=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 432 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 825 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1079 IncrementalHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 89 mSDtfsCounter, 1079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1013occurred in iteration=5, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 813 ConstructedInterpolants, 0 QuantifiedInterpolants, 3281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2022-11-02 20:35:14,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e66cf238-99f9-4a11-b3df-2211ee21901c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE