./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ --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 0f0c41cc4bbd081542690b2b24113aecb06bc89521cb806ea9d2ea12042870bc --- 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-dbf71c6-m [2022-10-17 10:13:00,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:13:00,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:13:00,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:13:00,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:13:00,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:13:00,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:13:00,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:13:00,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:13:00,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:13:00,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:13:00,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:13:00,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:13:00,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:13:00,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:13:00,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:13:00,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:13:00,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:13:00,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:13:00,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:13:00,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:13:00,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:13:00,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:13:00,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:13:00,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:13:00,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:13:00,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:13:00,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:13:00,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:13:00,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:13:00,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:13:00,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:13:00,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:13:00,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:13:00,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:13:00,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:13:00,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:13:00,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:13:00,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:13:00,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:13:00,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:13:00,323 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:13:00,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:13:00,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:13:00,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:13:00,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:13:00,383 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:13:00,384 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:13:00,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:13:00,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:13:00,385 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:13:00,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:13:00,387 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:13:00,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:13:00,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:13:00,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:13:00,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:13:00,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:13:00,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:13:00,389 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:13:00,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:13:00,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:13:00,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:13:00,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:13:00,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:13:00,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:13:00,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:13:00,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:13:00,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:13:00,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:13:00,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:13:00,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:13:00,402 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:13:00,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:13:00,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:13:00,403 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_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/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_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ 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 -> 0f0c41cc4bbd081542690b2b24113aecb06bc89521cb806ea9d2ea12042870bc [2022-10-17 10:13:00,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:13:00,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:13:00,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:13:00,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:13:00,726 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:13:00,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2022-10-17 10:13:00,803 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/data/c92ff646b/ed11840cd3e747878853982e7b849a96/FLAG30649802d [2022-10-17 10:13:01,344 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:13:01,345 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2022-10-17 10:13:01,379 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/data/c92ff646b/ed11840cd3e747878853982e7b849a96/FLAG30649802d [2022-10-17 10:13:01,662 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/data/c92ff646b/ed11840cd3e747878853982e7b849a96 [2022-10-17 10:13:01,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:13:01,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:13:01,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:13:01,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:13:01,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:13:01,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:13:01" (1/1) ... [2022-10-17 10:13:01,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b61fe2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:01, skipping insertion in model container [2022-10-17 10:13:01,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:13:01" (1/1) ... [2022-10-17 10:13:01,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:13:01,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:13:01,946 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_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-10-17 10:13:02,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:13:02,161 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:13:02,172 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_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-10-17 10:13:02,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:13:02,248 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:13:02,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02 WrapperNode [2022-10-17 10:13:02,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:13:02,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:13:02,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:13:02,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:13:02,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,306 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-10-17 10:13:02,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:13:02,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:13:02,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:13:02,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:13:02,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,345 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:13:02,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:13:02,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:13:02,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:13:02,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (1/1) ... [2022-10-17 10:13:02,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:13:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:13:02,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:13:02,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:13:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:13:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 10:13:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:13:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:13:02,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:13:02,431 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 10:13:02,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 10:13:02,431 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 10:13:02,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 10:13:02,432 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 10:13:02,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 10:13:02,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:13:02,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 10:13:02,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:13:02,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:13:02,434 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 10:13:02,568 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:13:02,570 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:13:03,215 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:13:03,632 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:13:03,632 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 10:13:03,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:13:03 BoogieIcfgContainer [2022-10-17 10:13:03,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:13:03,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:13:03,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:13:03,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:13:03,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:13:01" (1/3) ... [2022-10-17 10:13:03,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2786d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:13:03, skipping insertion in model container [2022-10-17 10:13:03,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:13:02" (2/3) ... [2022-10-17 10:13:03,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2786d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:13:03, skipping insertion in model container [2022-10-17 10:13:03,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:13:03" (3/3) ... [2022-10-17 10:13:03,647 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2022-10-17 10:13:03,656 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 10:13:03,666 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:13:03,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 10:13:03,666 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 10:13:03,746 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 10:13:03,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-10-17 10:13:03,844 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-10-17 10:13:03,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:13:03,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-10-17 10:13:03,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-10-17 10:13:03,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-10-17 10:13:03,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:13:03,871 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;@2b5195f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:13:03,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-17 10:13:03,897 INFO L130 PetriNetUnfolder]: 0/73 cut-off events. [2022-10-17 10:13:03,898 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:13:03,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:13:03,898 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] [2022-10-17 10:13:03,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:13:03,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:13:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash -643770443, now seen corresponding path program 1 times [2022-10-17 10:13:03,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:13:03,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023848017] [2022-10-17 10:13:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:13:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:13:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:13:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:13:04,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:13:04,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023848017] [2022-10-17 10:13:04,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023848017] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:13:04,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:13:04,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:13:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797859120] [2022-10-17 10:13:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:13:04,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:13:04,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:13:04,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:13:04,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:13:04,656 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 113 [2022-10-17 10:13:04,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-10-17 10:13:04,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:13:04,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 113 [2022-10-17 10:13:04,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:13:04,845 INFO L130 PetriNetUnfolder]: 10/178 cut-off events. [2022-10-17 10:13:04,847 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-10-17 10:13:04,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 178 events. 10/178 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 337 event pairs, 4 based on Foata normal form. 5/174 useless extension candidates. Maximal degree in co-relation 165. Up to 17 conditions per place. [2022-10-17 10:13:04,854 INFO L137 encePairwiseOnDemand]: 108/113 looper letters, 8 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2022-10-17 10:13:04,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 245 flow [2022-10-17 10:13:04,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:13:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 10:13:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-10-17 10:13:04,870 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-10-17 10:13:04,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2022-10-17 10:13:04,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2022-10-17 10:13:04,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:13:04,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2022-10-17 10:13:04,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-10-17 10:13:04,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-10-17 10:13:04,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-10-17 10:13:04,889 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 318 transitions. [2022-10-17 10:13:04,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 245 flow [2022-10-17 10:13:04,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 108 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-10-17 10:13:04,898 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-10-17 10:13:04,902 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-10-17 10:13:04,905 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-10-17 10:13:04,906 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-10-17 10:13:04,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-10-17 10:13:04,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:13:04,907 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] [2022-10-17 10:13:04,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:13:04,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:13:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:13:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash -185023354, now seen corresponding path program 1 times [2022-10-17 10:13:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:13:04,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754265843] [2022-10-17 10:13:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:13:04,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:13:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:13:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:13:05,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:13:05,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754265843] [2022-10-17 10:13:05,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754265843] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:13:05,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:13:05,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:13:05,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861733327] [2022-10-17 10:13:05,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:13:05,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:13:05,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:13:05,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:13:05,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:13:05,300 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-10-17 10:13:05,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 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-10-17 10:13:05,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:13:05,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-10-17 10:13:05,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:13:06,283 INFO L130 PetriNetUnfolder]: 653/2092 cut-off events. [2022-10-17 10:13:06,283 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-10-17 10:13:06,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3295 conditions, 2092 events. 653/2092 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16661 event pairs, 155 based on Foata normal form. 0/2024 useless extension candidates. Maximal degree in co-relation 3241. Up to 437 conditions per place. [2022-10-17 10:13:06,307 INFO L137 encePairwiseOnDemand]: 104/113 looper letters, 26 selfloop transitions, 5 changer transitions 58/164 dead transitions. [2022-10-17 10:13:06,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 164 transitions, 510 flow [2022-10-17 10:13:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:13:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:13:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2022-10-17 10:13:06,340 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8662733529990168 [2022-10-17 10:13:06,340 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2022-10-17 10:13:06,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2022-10-17 10:13:06,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:13:06,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2022-10-17 10:13:06,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 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-10-17 10:13:06,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-10-17 10:13:06,354 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-10-17 10:13:06,354 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 9 states and 881 transitions. [2022-10-17 10:13:06,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 164 transitions, 510 flow [2022-10-17 10:13:06,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 164 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 10:13:06,359 INFO L231 Difference]: Finished difference. Result has 129 places, 98 transitions, 268 flow [2022-10-17 10:13:06,360 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=268, PETRI_PLACES=129, PETRI_TRANSITIONS=98} [2022-10-17 10:13:06,361 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2022-10-17 10:13:06,361 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 98 transitions, 268 flow [2022-10-17 10:13:06,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 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-10-17 10:13:06,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:13:06,362 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] [2022-10-17 10:13:06,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:13:06,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:13:06,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:13:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash 52028421, now seen corresponding path program 1 times [2022-10-17 10:13:06,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:13:06,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637150121] [2022-10-17 10:13:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:13:06,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:13:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:13:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:13:06,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:13:06,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637150121] [2022-10-17 10:13:06,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637150121] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:13:06,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:13:06,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:13:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364633281] [2022-10-17 10:13:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:13:06,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:13:06,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:13:06,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:13:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:13:06,729 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-10-17 10:13:06,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 98 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-10-17 10:13:06,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:13:06,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-10-17 10:13:06,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:13:07,750 INFO L130 PetriNetUnfolder]: 1259/2658 cut-off events. [2022-10-17 10:13:07,751 INFO L131 PetriNetUnfolder]: For 2440/2721 co-relation queries the response was YES. [2022-10-17 10:13:07,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6088 conditions, 2658 events. 1259/2658 cut-off events. For 2440/2721 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 19225 event pairs, 71 based on Foata normal form. 40/2522 useless extension candidates. Maximal degree in co-relation 6028. Up to 770 conditions per place. [2022-10-17 10:13:07,775 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 34 selfloop transitions, 7 changer transitions 38/158 dead transitions. [2022-10-17 10:13:07,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 158 transitions, 634 flow [2022-10-17 10:13:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:13:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:13:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 983 transitions. [2022-10-17 10:13:07,781 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8699115044247787 [2022-10-17 10:13:07,781 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 983 transitions. [2022-10-17 10:13:07,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 983 transitions. [2022-10-17 10:13:07,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:13:07,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 983 transitions. [2022-10-17 10:13:07,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.3) internal successors, (983), 10 states have internal predecessors, (983), 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-10-17 10:13:07,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-10-17 10:13:07,794 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-10-17 10:13:07,794 INFO L175 Difference]: Start difference. First operand has 129 places, 98 transitions, 268 flow. Second operand 10 states and 983 transitions. [2022-10-17 10:13:07,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 158 transitions, 634 flow [2022-10-17 10:13:07,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 158 transitions, 604 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-10-17 10:13:07,812 INFO L231 Difference]: Finished difference. Result has 124 places, 102 transitions, 314 flow [2022-10-17 10:13:07,813 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=314, PETRI_PLACES=124, PETRI_TRANSITIONS=102} [2022-10-17 10:13:07,815 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 6 predicate places. [2022-10-17 10:13:07,815 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 102 transitions, 314 flow [2022-10-17 10:13:07,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-10-17 10:13:07,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:13:07,817 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] [2022-10-17 10:13:07,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:13:07,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:13:07,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:13:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash -694698910, now seen corresponding path program 1 times [2022-10-17 10:13:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:13:07,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990718945] [2022-10-17 10:13:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:13:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:13:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:13:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:13:08,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:13:08,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990718945] [2022-10-17 10:13:08,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990718945] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:13:08,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:13:08,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:13:08,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494993067] [2022-10-17 10:13:08,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:13:08,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:13:08,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:13:08,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:13:08,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:13:08,312 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-10-17 10:13:08,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 102 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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-10-17 10:13:08,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:13:08,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-10-17 10:13:08,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:13:09,042 INFO L130 PetriNetUnfolder]: 593/1534 cut-off events. [2022-10-17 10:13:09,043 INFO L131 PetriNetUnfolder]: For 2747/2884 co-relation queries the response was YES. [2022-10-17 10:13:09,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 1534 events. 593/1534 cut-off events. For 2747/2884 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10840 event pairs, 49 based on Foata normal form. 78/1561 useless extension candidates. Maximal degree in co-relation 4647. Up to 433 conditions per place. [2022-10-17 10:13:09,058 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 42 selfloop transitions, 18 changer transitions 28/167 dead transitions. [2022-10-17 10:13:09,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 167 transitions, 855 flow [2022-10-17 10:13:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:13:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:13:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1082 transitions. [2022-10-17 10:13:09,063 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8704746580852776 [2022-10-17 10:13:09,063 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1082 transitions. [2022-10-17 10:13:09,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1082 transitions. [2022-10-17 10:13:09,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:13:09,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1082 transitions. [2022-10-17 10:13:09,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.36363636363636) internal successors, (1082), 11 states have internal predecessors, (1082), 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-10-17 10:13:09,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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-10-17 10:13:09,075 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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-10-17 10:13:09,076 INFO L175 Difference]: Start difference. First operand has 124 places, 102 transitions, 314 flow. Second operand 11 states and 1082 transitions. [2022-10-17 10:13:09,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 167 transitions, 855 flow [2022-10-17 10:13:09,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 167 transitions, 833 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-10-17 10:13:09,090 INFO L231 Difference]: Finished difference. Result has 129 places, 117 transitions, 485 flow [2022-10-17 10:13:09,091 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=485, PETRI_PLACES=129, PETRI_TRANSITIONS=117} [2022-10-17 10:13:09,092 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2022-10-17 10:13:09,097 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 117 transitions, 485 flow [2022-10-17 10:13:09,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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-10-17 10:13:09,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:13:09,098 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] [2022-10-17 10:13:09,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:13:09,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:13:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:13:09,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1358772222, now seen corresponding path program 1 times [2022-10-17 10:13:09,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:13:09,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450215994] [2022-10-17 10:13:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:13:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:13:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:13:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:13:09,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:13:09,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450215994] [2022-10-17 10:13:09,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450215994] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:13:09,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:13:09,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:13:09,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169570817] [2022-10-17 10:13:09,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:13:09,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:13:09,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:13:09,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:13:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:13:09,501 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-10-17 10:13:09,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 117 transitions, 485 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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-10-17 10:13:09,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:13:09,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-10-17 10:13:09,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:13:10,183 INFO L130 PetriNetUnfolder]: 494/1373 cut-off events. [2022-10-17 10:13:10,184 INFO L131 PetriNetUnfolder]: For 4184/4377 co-relation queries the response was YES. [2022-10-17 10:13:10,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4872 conditions, 1373 events. 494/1373 cut-off events. For 4184/4377 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10396 event pairs, 26 based on Foata normal form. 68/1391 useless extension candidates. Maximal degree in co-relation 4803. Up to 367 conditions per place. [2022-10-17 10:13:10,200 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 37 selfloop transitions, 22 changer transitions 26/164 dead transitions. [2022-10-17 10:13:10,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 164 transitions, 923 flow [2022-10-17 10:13:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-17 10:13:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-10-17 10:13:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1346 transitions. [2022-10-17 10:13:10,206 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8508217446270544 [2022-10-17 10:13:10,206 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1346 transitions. [2022-10-17 10:13:10,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1346 transitions. [2022-10-17 10:13:10,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:13:10,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1346 transitions. [2022-10-17 10:13:10,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.14285714285714) internal successors, (1346), 14 states have internal predecessors, (1346), 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-10-17 10:13:10,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-10-17 10:13:10,218 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-10-17 10:13:10,219 INFO L175 Difference]: Start difference. First operand has 129 places, 117 transitions, 485 flow. Second operand 14 states and 1346 transitions. [2022-10-17 10:13:10,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 164 transitions, 923 flow [2022-10-17 10:13:10,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 164 transitions, 853 flow, removed 32 selfloop flow, removed 2 redundant places. [2022-10-17 10:13:10,263 INFO L231 Difference]: Finished difference. Result has 147 places, 118 transitions, 503 flow [2022-10-17 10:13:10,263 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=503, PETRI_PLACES=147, PETRI_TRANSITIONS=118} [2022-10-17 10:13:10,264 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 29 predicate places. [2022-10-17 10:13:10,264 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 118 transitions, 503 flow [2022-10-17 10:13:10,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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-10-17 10:13:10,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:13:10,265 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-10-17 10:13:10,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:13:10,266 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:13:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:13:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1134324157, now seen corresponding path program 1 times [2022-10-17 10:13:10,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:13:10,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491095561] [2022-10-17 10:13:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:13:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:13:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:13:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:13:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:13:10,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491095561] [2022-10-17 10:13:10,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491095561] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:13:10,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:13:10,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:13:10,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411528364] [2022-10-17 10:13:10,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:13:10,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:13:10,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:13:10,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:13:10,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:13:10,662 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-10-17 10:13:10,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 118 transitions, 503 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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-10-17 10:13:10,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:13:10,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-10-17 10:13:10,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:13:11,087 INFO L130 PetriNetUnfolder]: 191/1214 cut-off events. [2022-10-17 10:13:11,088 INFO L131 PetriNetUnfolder]: For 3112/3160 co-relation queries the response was YES. [2022-10-17 10:13:11,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3643 conditions, 1214 events. 191/1214 cut-off events. For 3112/3160 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11673 event pairs, 4 based on Foata normal form. 5/1159 useless extension candidates. Maximal degree in co-relation 3565. Up to 183 conditions per place. [2022-10-17 10:13:11,101 INFO L137 encePairwiseOnDemand]: 107/113 looper letters, 19 selfloop transitions, 1 changer transitions 15/133 dead transitions. [2022-10-17 10:13:11,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 133 transitions, 635 flow [2022-10-17 10:13:11,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:13:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-10-17 10:13:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2022-10-17 10:13:11,105 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8445006321112516 [2022-10-17 10:13:11,105 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2022-10-17 10:13:11,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2022-10-17 10:13:11,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:13:11,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2022-10-17 10:13:11,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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-10-17 10:13:11,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-10-17 10:13:11,111 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-10-17 10:13:11,112 INFO L175 Difference]: Start difference. First operand has 147 places, 118 transitions, 503 flow. Second operand 7 states and 668 transitions. [2022-10-17 10:13:11,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 133 transitions, 635 flow [2022-10-17 10:13:11,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 133 transitions, 527 flow, removed 36 selfloop flow, removed 16 redundant places. [2022-10-17 10:13:11,148 INFO L231 Difference]: Finished difference. Result has 139 places, 117 transitions, 424 flow [2022-10-17 10:13:11,149 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=424, PETRI_PLACES=139, PETRI_TRANSITIONS=117} [2022-10-17 10:13:11,150 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 21 predicate places. [2022-10-17 10:13:11,150 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 117 transitions, 424 flow [2022-10-17 10:13:11,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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-10-17 10:13:11,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:13:11,151 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-10-17 10:13:11,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:13:11,151 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:13:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:13:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1613419581, now seen corresponding path program 2 times [2022-10-17 10:13:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:13:11,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752171357] [2022-10-17 10:13:11,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:13:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:13:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:13:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:13:11,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:13:11,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752171357] [2022-10-17 10:13:11,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752171357] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:13:11,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:13:11,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:13:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917845116] [2022-10-17 10:13:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:13:11,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:13:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:13:11,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:13:11,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:13:11,922 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-10-17 10:13:11,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 117 transitions, 424 flow. Second operand has 8 states, 8 states have (on average 92.25) internal successors, (738), 8 states have internal predecessors, (738), 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-10-17 10:13:11,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:13:11,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-10-17 10:13:11,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:13:12,264 INFO L130 PetriNetUnfolder]: 151/998 cut-off events. [2022-10-17 10:13:12,265 INFO L131 PetriNetUnfolder]: For 1033/1041 co-relation queries the response was YES. [2022-10-17 10:13:12,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 998 events. 151/998 cut-off events. For 1033/1041 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9155 event pairs, 3 based on Foata normal form. 1/950 useless extension candidates. Maximal degree in co-relation 2417. Up to 154 conditions per place. [2022-10-17 10:13:12,273 INFO L137 encePairwiseOnDemand]: 105/113 looper letters, 16 selfloop transitions, 4 changer transitions 20/128 dead transitions. [2022-10-17 10:13:12,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 128 transitions, 522 flow [2022-10-17 10:13:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:13:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:13:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 838 transitions. [2022-10-17 10:13:12,277 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.823992133726647 [2022-10-17 10:13:12,277 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 838 transitions. [2022-10-17 10:13:12,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 838 transitions. [2022-10-17 10:13:12,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:13:12,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 838 transitions. [2022-10-17 10:13:12,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 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-10-17 10:13:12,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-10-17 10:13:12,285 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-10-17 10:13:12,285 INFO L175 Difference]: Start difference. First operand has 139 places, 117 transitions, 424 flow. Second operand 9 states and 838 transitions. [2022-10-17 10:13:12,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 128 transitions, 522 flow [2022-10-17 10:13:12,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 128 transitions, 501 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-10-17 10:13:12,299 INFO L231 Difference]: Finished difference. Result has 144 places, 108 transitions, 359 flow [2022-10-17 10:13:12,300 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=144, PETRI_TRANSITIONS=108} [2022-10-17 10:13:12,301 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2022-10-17 10:13:12,301 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 108 transitions, 359 flow [2022-10-17 10:13:12,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.25) internal successors, (738), 8 states have internal predecessors, (738), 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-10-17 10:13:12,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:13:12,302 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-10-17 10:13:12,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:13:12,303 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:13:12,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:13:12,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2008935003, now seen corresponding path program 3 times [2022-10-17 10:13:12,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:13:12,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443853162] [2022-10-17 10:13:12,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:13:12,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:13:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:13:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:13:12,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:13:12,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443853162] [2022-10-17 10:13:12,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443853162] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:13:12,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:13:12,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:13:12,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718410511] [2022-10-17 10:13:12,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:13:12,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:13:12,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:13:12,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:13:12,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:13:12,637 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-10-17 10:13:12,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 108 transitions, 359 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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-10-17 10:13:12,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:13:12,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-10-17 10:13:12,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:13:12,890 INFO L130 PetriNetUnfolder]: 74/604 cut-off events. [2022-10-17 10:13:12,891 INFO L131 PetriNetUnfolder]: For 491/494 co-relation queries the response was YES. [2022-10-17 10:13:12,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 604 events. 74/604 cut-off events. For 491/494 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4737 event pairs, 2 based on Foata normal form. 1/576 useless extension candidates. Maximal degree in co-relation 1244. Up to 108 conditions per place. [2022-10-17 10:13:12,896 INFO L137 encePairwiseOnDemand]: 105/113 looper letters, 15 selfloop transitions, 4 changer transitions 21/120 dead transitions. [2022-10-17 10:13:12,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 120 transitions, 483 flow [2022-10-17 10:13:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:13:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-10-17 10:13:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 657 transitions. [2022-10-17 10:13:12,899 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8305941845764855 [2022-10-17 10:13:12,899 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 657 transitions. [2022-10-17 10:13:12,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 657 transitions. [2022-10-17 10:13:12,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:13:12,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 657 transitions. [2022-10-17 10:13:12,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 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-10-17 10:13:12,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-10-17 10:13:12,907 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-10-17 10:13:12,908 INFO L175 Difference]: Start difference. First operand has 144 places, 108 transitions, 359 flow. Second operand 7 states and 657 transitions. [2022-10-17 10:13:12,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 120 transitions, 483 flow [2022-10-17 10:13:12,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 120 transitions, 426 flow, removed 17 selfloop flow, removed 13 redundant places. [2022-10-17 10:13:12,916 INFO L231 Difference]: Finished difference. Result has 131 places, 99 transitions, 286 flow [2022-10-17 10:13:12,916 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=286, PETRI_PLACES=131, PETRI_TRANSITIONS=99} [2022-10-17 10:13:12,919 INFO L287 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2022-10-17 10:13:12,919 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 99 transitions, 286 flow [2022-10-17 10:13:12,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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-10-17 10:13:12,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:13:12,920 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-10-17 10:13:12,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:13:12,921 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:13:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:13:12,921 INFO L85 PathProgramCache]: Analyzing trace with hash 42807631, now seen corresponding path program 4 times [2022-10-17 10:13:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:13:12,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989044282] [2022-10-17 10:13:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:13:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:13:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:13:12,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:13:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:13:13,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:13:13,090 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:13:13,091 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-10-17 10:13:13,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-10-17 10:13:13,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-10-17 10:13:13,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-10-17 10:13:13,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-10-17 10:13:13,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-10-17 10:13:13,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:13:13,094 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-10-17 10:13:13,110 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 10:13:13,110 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:13:13,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:13:13 BasicIcfg [2022-10-17 10:13:13,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:13:13,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:13:13,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:13:13,301 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:13:13,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:13:03" (3/4) ... [2022-10-17 10:13:13,304 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 10:13:13,421 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:13:13,422 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:13:13,422 INFO L158 Benchmark]: Toolchain (without parser) took 11756.72ms. Allocated memory was 98.6MB in the beginning and 436.2MB in the end (delta: 337.6MB). Free memory was 76.6MB in the beginning and 256.0MB in the end (delta: -179.4MB). Peak memory consumption was 157.5MB. Max. memory is 16.1GB. [2022-10-17 10:13:13,423 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 98.6MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:13:13,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.28ms. Allocated memory is still 98.6MB. Free memory was 76.3MB in the beginning and 59.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-10-17 10:13:13,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.32ms. Allocated memory is still 98.6MB. Free memory was 58.8MB in the beginning and 56.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:13:13,424 INFO L158 Benchmark]: Boogie Preprocessor took 44.30ms. Allocated memory is still 98.6MB. Free memory was 56.5MB in the beginning and 54.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:13:13,425 INFO L158 Benchmark]: RCFGBuilder took 1281.73ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 54.2MB in the beginning and 65.7MB in the end (delta: -11.6MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2022-10-17 10:13:13,425 INFO L158 Benchmark]: TraceAbstraction took 9662.91ms. Allocated memory was 119.5MB in the beginning and 436.2MB in the end (delta: 316.7MB). Free memory was 65.7MB in the beginning and 287.4MB in the end (delta: -221.7MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2022-10-17 10:13:13,426 INFO L158 Benchmark]: Witness Printer took 120.85ms. Allocated memory is still 436.2MB. Free memory was 287.4MB in the beginning and 256.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-10-17 10:13:13,428 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.29ms. Allocated memory is still 98.6MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.28ms. Allocated memory is still 98.6MB. Free memory was 76.3MB in the beginning and 59.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.32ms. Allocated memory is still 98.6MB. Free memory was 58.8MB in the beginning and 56.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.30ms. Allocated memory is still 98.6MB. Free memory was 56.5MB in the beginning and 54.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1281.73ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 54.2MB in the beginning and 65.7MB in the end (delta: -11.6MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9662.91ms. Allocated memory was 119.5MB in the beginning and 436.2MB in the end (delta: 316.7MB). Free memory was 65.7MB in the beginning and 287.4MB in the end (delta: -221.7MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. * Witness Printer took 120.85ms. Allocated memory is still 436.2MB. Free memory was 287.4MB in the beginning and 256.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1394; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1394, ((void *)0), P0, ((void *)0))=-2, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1395; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1395, ((void *)0), P1, ((void *)0))=-1, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1396; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1396, ((void *)0), P2, ((void *)0))=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L790] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L790] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 826]: 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: 828]: 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: 824]: 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 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 309 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 299 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 557 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 746 IncrementalHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 61 mSDtfsCounter, 746 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=503occurred in iteration=5, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 622 ConstructedInterpolants, 0 QuantifiedInterpolants, 2307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-10-17 10:13:13,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e8039d3-7056-46a8-b2a1-fe4c32d0a741/bin/uautomizer-J5u9QxTXDZ/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