./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:13:27,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:13:27,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:13:27,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:13:27,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:13:27,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:13:27,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:13:27,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:13:27,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:13:28,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:13:28,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:13:28,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:13:28,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:13:28,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:13:28,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:13:28,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:13:28,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:13:28,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:13:28,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:13:28,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:13:28,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:13:28,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:13:28,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:13:28,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:13:28,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:13:28,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:13:28,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:13:28,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:13:28,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:13:28,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:13:28,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:13:28,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:13:28,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:13:28,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:13:28,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:13:28,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:13:28,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:13:28,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:13:28,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:13:28,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:13:28,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:13:28,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:13:28,104 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:13:28,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:13:28,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:13:28,109 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:13:28,110 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:13:28,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:13:28,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:13:28,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:13:28,112 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:13:28,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:13:28,114 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:13:28,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:13:28,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:13:28,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:13:28,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:13:28,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:13:28,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:13:28,117 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:13:28,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:13:28,117 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:13:28,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:13:28,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:13:28,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:13:28,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:13:28,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:13:28,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:13:28,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:13:28,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:13:28,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:13:28,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:13:28,121 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:13:28,121 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:13:28,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:13:28,122 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_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/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_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd [2022-11-18 20:13:28,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:13:28,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:13:28,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:13:28,477 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:13:28,478 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:13:28,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-18 20:13:28,578 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/data/2391cbe9d/2622f68c82c344838d416fe83016fcf9/FLAG75ba30363 [2022-11-18 20:13:29,170 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:13:29,171 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-18 20:13:29,183 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/data/2391cbe9d/2622f68c82c344838d416fe83016fcf9/FLAG75ba30363 [2022-11-18 20:13:29,483 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/data/2391cbe9d/2622f68c82c344838d416fe83016fcf9 [2022-11-18 20:13:29,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:13:29,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:13:29,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:13:29,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:13:29,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:13:29,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:13:29" (1/1) ... [2022-11-18 20:13:29,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d97cbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:29, skipping insertion in model container [2022-11-18 20:13:29,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:13:29" (1/1) ... [2022-11-18 20:13:29,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:13:29,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:13:29,883 WARN L234 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_5f211af2-b51b-4117-a326-4e21c8c01f9b/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-18 20:13:30,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:13:30,152 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:13:30,166 WARN L234 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_5f211af2-b51b-4117-a326-4e21c8c01f9b/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-18 20:13:30,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:13:30,289 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:13:30,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30 WrapperNode [2022-11-18 20:13:30,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:13:30,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:13:30,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:13:30,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:13:30,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,374 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-18 20:13:30,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:13:30,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:13:30,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:13:30,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:13:30,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,435 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:13:30,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:13:30,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:13:30,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:13:30,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (1/1) ... [2022-11-18 20:13:30,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:13:30,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:30,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:13:30,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:13:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:13:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:13:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:13:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:13:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:13:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:13:30,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:13:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:13:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:13:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:13:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:13:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 20:13:30,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 20:13:30,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:13:30,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:13:30,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:13:30,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:13:30,563 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:13:30,769 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:13:30,772 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:13:31,192 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:13:31,391 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:13:31,391 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:13:31,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:13:31 BoogieIcfgContainer [2022-11-18 20:13:31,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:13:31,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:13:31,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:13:31,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:13:31,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:13:29" (1/3) ... [2022-11-18 20:13:31,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589e4c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:13:31, skipping insertion in model container [2022-11-18 20:13:31,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:30" (2/3) ... [2022-11-18 20:13:31,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589e4c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:13:31, skipping insertion in model container [2022-11-18 20:13:31,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:13:31" (3/3) ... [2022-11-18 20:13:31,405 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-18 20:13:31,417 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:13:31,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:13:31,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:13:31,431 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:13:31,545 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:13:31,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-11-18 20:13:31,682 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-18 20:13:31,682 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:13:31,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-11-18 20:13:31,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-11-18 20:13:31,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-11-18 20:13:31,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:13:31,713 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;@42eda710, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:13:31,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 20:13:31,759 INFO L130 PetriNetUnfolder]: 0/89 cut-off events. [2022-11-18 20:13:31,759 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:13:31,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:31,761 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:31,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:13:31,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1798411277, now seen corresponding path program 1 times [2022-11-18 20:13:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:31,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91532417] [2022-11-18 20:13:31,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:31,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:32,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:32,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91532417] [2022-11-18 20:13:32,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91532417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:32,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:32,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:13:32,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451310332] [2022-11-18 20:13:32,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:32,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:13:32,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:32,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:13:32,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:13:32,609 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 133 [2022-11-18 20:13:32,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:32,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:32,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 133 [2022-11-18 20:13:32,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:13:32,718 INFO L130 PetriNetUnfolder]: 10/201 cut-off events. [2022-11-18 20:13:32,719 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-18 20:13:32,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 201 events. 10/201 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 360 event pairs, 4 based on Foata normal form. 5/197 useless extension candidates. Maximal degree in co-relation 187. Up to 17 conditions per place. [2022-11-18 20:13:32,722 INFO L137 encePairwiseOnDemand]: 128/133 looper letters, 9 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2022-11-18 20:13:32,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 127 transitions, 288 flow [2022-11-18 20:13:32,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:13:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:13:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-11-18 20:13:32,737 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9423558897243107 [2022-11-18 20:13:32,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2022-11-18 20:13:32,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2022-11-18 20:13:32,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:13:32,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2022-11-18 20:13:32,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:32,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:32,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:32,755 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 3 states and 376 transitions. [2022-11-18 20:13:32,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 127 transitions, 288 flow [2022-11-18 20:13:32,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 127 transitions, 284 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:13:32,763 INFO L231 Difference]: Finished difference. Result has 136 places, 125 transitions, 262 flow [2022-11-18 20:13:32,766 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2022-11-18 20:13:32,769 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, -4 predicate places. [2022-11-18 20:13:32,770 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 262 flow [2022-11-18 20:13:32,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:32,770 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:32,771 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:32,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:13:32,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:13:32,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:32,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1773794062, now seen corresponding path program 1 times [2022-11-18 20:13:32,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:32,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872593837] [2022-11-18 20:13:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:33,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:33,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872593837] [2022-11-18 20:13:33,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872593837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:33,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:33,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:13:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988791639] [2022-11-18 20:13:33,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:33,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:13:33,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:13:33,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:13:33,289 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 133 [2022-11-18 20:13:33,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:33,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:33,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 133 [2022-11-18 20:13:33,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:13:34,099 INFO L130 PetriNetUnfolder]: 538/1743 cut-off events. [2022-11-18 20:13:34,099 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-11-18 20:13:34,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 1743 events. 538/1743 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12790 event pairs, 216 based on Foata normal form. 0/1694 useless extension candidates. Maximal degree in co-relation 2643. Up to 442 conditions per place. [2022-11-18 20:13:34,113 INFO L137 encePairwiseOnDemand]: 126/133 looper letters, 23 selfloop transitions, 3 changer transitions 53/173 dead transitions. [2022-11-18 20:13:34,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 173 transitions, 510 flow [2022-11-18 20:13:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:13:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:13:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1067 transitions. [2022-11-18 20:13:34,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8913951545530493 [2022-11-18 20:13:34,120 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1067 transitions. [2022-11-18 20:13:34,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1067 transitions. [2022-11-18 20:13:34,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:13:34,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1067 transitions. [2022-11-18 20:13:34,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.55555555555556) internal successors, (1067), 9 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:34,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:34,130 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:34,130 INFO L175 Difference]: Start difference. First operand has 136 places, 125 transitions, 262 flow. Second operand 9 states and 1067 transitions. [2022-11-18 20:13:34,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 173 transitions, 510 flow [2022-11-18 20:13:34,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 173 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:13:34,136 INFO L231 Difference]: Finished difference. Result has 149 places, 113 transitions, 273 flow [2022-11-18 20:13:34,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=273, PETRI_PLACES=149, PETRI_TRANSITIONS=113} [2022-11-18 20:13:34,137 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 9 predicate places. [2022-11-18 20:13:34,137 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 113 transitions, 273 flow [2022-11-18 20:13:34,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:34,138 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:34,138 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:34,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:13:34,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:13:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:34,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1504335123, now seen corresponding path program 1 times [2022-11-18 20:13:34,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:34,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525852194] [2022-11-18 20:13:34,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:34,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:34,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525852194] [2022-11-18 20:13:34,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525852194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:34,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:34,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:13:34,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222318531] [2022-11-18 20:13:34,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:34,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:13:34,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:13:34,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:13:34,437 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-11-18 20:13:34,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 113 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:34,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:34,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-11-18 20:13:34,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:13:35,409 INFO L130 PetriNetUnfolder]: 1792/3573 cut-off events. [2022-11-18 20:13:35,410 INFO L131 PetriNetUnfolder]: For 1111/1111 co-relation queries the response was YES. [2022-11-18 20:13:35,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7173 conditions, 3573 events. 1792/3573 cut-off events. For 1111/1111 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 27834 event pairs, 103 based on Foata normal form. 0/3374 useless extension candidates. Maximal degree in co-relation 7110. Up to 1069 conditions per place. [2022-11-18 20:13:35,449 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 58 selfloop transitions, 18 changer transitions 5/174 dead transitions. [2022-11-18 20:13:35,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 174 transitions, 563 flow [2022-11-18 20:13:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:13:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:13:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1173 transitions. [2022-11-18 20:13:35,456 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8819548872180452 [2022-11-18 20:13:35,457 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1173 transitions. [2022-11-18 20:13:35,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1173 transitions. [2022-11-18 20:13:35,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:13:35,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1173 transitions. [2022-11-18 20:13:35,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.3) internal successors, (1173), 10 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:35,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:35,465 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:35,465 INFO L175 Difference]: Start difference. First operand has 149 places, 113 transitions, 273 flow. Second operand 10 states and 1173 transitions. [2022-11-18 20:13:35,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 174 transitions, 563 flow [2022-11-18 20:13:35,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 174 transitions, 554 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-18 20:13:35,487 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 396 flow [2022-11-18 20:13:35,488 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=396, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-18 20:13:35,490 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 0 predicate places. [2022-11-18 20:13:35,491 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 396 flow [2022-11-18 20:13:35,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:35,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:35,492 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:35,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:13:35,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:13:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash 473728832, now seen corresponding path program 1 times [2022-11-18 20:13:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:35,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12829181] [2022-11-18 20:13:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:35,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:35,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12829181] [2022-11-18 20:13:35,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12829181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:35,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:35,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:13:35,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90966767] [2022-11-18 20:13:35,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:35,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:13:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:13:35,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:13:35,951 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2022-11-18 20:13:35,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:35,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:35,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2022-11-18 20:13:35,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:13:37,528 INFO L130 PetriNetUnfolder]: 2165/6075 cut-off events. [2022-11-18 20:13:37,528 INFO L131 PetriNetUnfolder]: For 5177/5873 co-relation queries the response was YES. [2022-11-18 20:13:37,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14872 conditions, 6075 events. 2165/6075 cut-off events. For 5177/5873 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 60276 event pairs, 709 based on Foata normal form. 132/5847 useless extension candidates. Maximal degree in co-relation 14801. Up to 1312 conditions per place. [2022-11-18 20:13:37,611 INFO L137 encePairwiseOnDemand]: 123/133 looper letters, 57 selfloop transitions, 25 changer transitions 0/187 dead transitions. [2022-11-18 20:13:37,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 187 transitions, 756 flow [2022-11-18 20:13:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:13:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:13:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1035 transitions. [2022-11-18 20:13:37,615 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8646616541353384 [2022-11-18 20:13:37,616 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1035 transitions. [2022-11-18 20:13:37,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1035 transitions. [2022-11-18 20:13:37,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:13:37,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1035 transitions. [2022-11-18 20:13:37,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:37,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:37,624 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:37,624 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 396 flow. Second operand 9 states and 1035 transitions. [2022-11-18 20:13:37,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 187 transitions, 756 flow [2022-11-18 20:13:37,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 187 transitions, 754 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:13:37,660 INFO L231 Difference]: Finished difference. Result has 155 places, 152 transitions, 636 flow [2022-11-18 20:13:37,660 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=636, PETRI_PLACES=155, PETRI_TRANSITIONS=152} [2022-11-18 20:13:37,661 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 15 predicate places. [2022-11-18 20:13:37,661 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 152 transitions, 636 flow [2022-11-18 20:13:37,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:37,662 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:37,663 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:37,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:13:37,663 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:13:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:37,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1693941964, now seen corresponding path program 1 times [2022-11-18 20:13:37,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:37,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258547953] [2022-11-18 20:13:37,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:37,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:37,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:37,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258547953] [2022-11-18 20:13:37,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258547953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:37,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:37,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:13:37,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511738667] [2022-11-18 20:13:37,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:37,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:13:37,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:13:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:13:37,991 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-11-18 20:13:37,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 152 transitions, 636 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:37,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:37,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-11-18 20:13:37,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:13:41,115 INFO L130 PetriNetUnfolder]: 5502/10955 cut-off events. [2022-11-18 20:13:41,116 INFO L131 PetriNetUnfolder]: For 27969/30270 co-relation queries the response was YES. [2022-11-18 20:13:41,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37887 conditions, 10955 events. 5502/10955 cut-off events. For 27969/30270 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 100576 event pairs, 214 based on Foata normal form. 306/10745 useless extension candidates. Maximal degree in co-relation 37810. Up to 3245 conditions per place. [2022-11-18 20:13:41,269 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 86 selfloop transitions, 30 changer transitions 11/239 dead transitions. [2022-11-18 20:13:41,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 239 transitions, 1390 flow [2022-11-18 20:13:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:13:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:13:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1526 transitions. [2022-11-18 20:13:41,274 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8825910931174089 [2022-11-18 20:13:41,275 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1526 transitions. [2022-11-18 20:13:41,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1526 transitions. [2022-11-18 20:13:41,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:13:41,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1526 transitions. [2022-11-18 20:13:41,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.38461538461539) internal successors, (1526), 13 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:41,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:41,286 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:41,286 INFO L175 Difference]: Start difference. First operand has 155 places, 152 transitions, 636 flow. Second operand 13 states and 1526 transitions. [2022-11-18 20:13:41,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 239 transitions, 1390 flow [2022-11-18 20:13:41,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 239 transitions, 1362 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-11-18 20:13:41,408 INFO L231 Difference]: Finished difference. Result has 173 places, 166 transitions, 845 flow [2022-11-18 20:13:41,409 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=845, PETRI_PLACES=173, PETRI_TRANSITIONS=166} [2022-11-18 20:13:41,409 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 33 predicate places. [2022-11-18 20:13:41,410 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 166 transitions, 845 flow [2022-11-18 20:13:41,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:41,411 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:41,411 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:41,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:13:41,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:13:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 971863392, now seen corresponding path program 1 times [2022-11-18 20:13:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:41,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005413545] [2022-11-18 20:13:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:41,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:41,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005413545] [2022-11-18 20:13:41,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005413545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:41,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:41,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:13:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378803419] [2022-11-18 20:13:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:41,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:13:41,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:41,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:13:41,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:13:41,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-11-18 20:13:41,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 166 transitions, 845 flow. Second operand has 8 states, 8 states have (on average 110.75) internal successors, (886), 8 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:41,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:41,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-11-18 20:13:41,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:13:44,593 INFO L130 PetriNetUnfolder]: 4572/9929 cut-off events. [2022-11-18 20:13:44,593 INFO L131 PetriNetUnfolder]: For 43939/46852 co-relation queries the response was YES. [2022-11-18 20:13:44,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41335 conditions, 9929 events. 4572/9929 cut-off events. For 43939/46852 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 98741 event pairs, 132 based on Foata normal form. 408/9874 useless extension candidates. Maximal degree in co-relation 41249. Up to 3025 conditions per place. [2022-11-18 20:13:44,708 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 80 selfloop transitions, 48 changer transitions 41/270 dead transitions. [2022-11-18 20:13:44,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 270 transitions, 1935 flow [2022-11-18 20:13:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:13:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:13:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1876 transitions. [2022-11-18 20:13:44,713 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.881578947368421 [2022-11-18 20:13:44,713 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1876 transitions. [2022-11-18 20:13:44,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1876 transitions. [2022-11-18 20:13:44,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:13:44,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1876 transitions. [2022-11-18 20:13:44,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.25) internal successors, (1876), 16 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:44,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 133.0) internal successors, (2261), 17 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:44,724 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 133.0) internal successors, (2261), 17 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:44,725 INFO L175 Difference]: Start difference. First operand has 173 places, 166 transitions, 845 flow. Second operand 16 states and 1876 transitions. [2022-11-18 20:13:44,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 270 transitions, 1935 flow [2022-11-18 20:13:45,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 270 transitions, 1834 flow, removed 44 selfloop flow, removed 4 redundant places. [2022-11-18 20:13:45,714 INFO L231 Difference]: Finished difference. Result has 188 places, 176 transitions, 1090 flow [2022-11-18 20:13:45,715 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1090, PETRI_PLACES=188, PETRI_TRANSITIONS=176} [2022-11-18 20:13:45,715 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 48 predicate places. [2022-11-18 20:13:45,716 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 176 transitions, 1090 flow [2022-11-18 20:13:45,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.75) internal successors, (886), 8 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:45,717 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:45,717 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:45,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:13:45,717 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:13:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1527514292, now seen corresponding path program 1 times [2022-11-18 20:13:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:45,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949654357] [2022-11-18 20:13:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:46,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:46,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949654357] [2022-11-18 20:13:46,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949654357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:46,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:46,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:13:46,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724726065] [2022-11-18 20:13:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:46,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:13:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:46,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:13:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:13:46,038 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 133 [2022-11-18 20:13:46,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 176 transitions, 1090 flow. Second operand has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:46,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:46,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 133 [2022-11-18 20:13:46,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:13:47,711 INFO L130 PetriNetUnfolder]: 1712/6548 cut-off events. [2022-11-18 20:13:47,711 INFO L131 PetriNetUnfolder]: For 29818/30341 co-relation queries the response was YES. [2022-11-18 20:13:47,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24243 conditions, 6548 events. 1712/6548 cut-off events. For 29818/30341 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 78434 event pairs, 56 based on Foata normal form. 14/6217 useless extension candidates. Maximal degree in co-relation 24148. Up to 1496 conditions per place. [2022-11-18 20:13:47,819 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 51 selfloop transitions, 18 changer transitions 35/245 dead transitions. [2022-11-18 20:13:47,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 245 transitions, 1722 flow [2022-11-18 20:13:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:13:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-18 20:13:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1550 transitions. [2022-11-18 20:13:47,826 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.832438238453276 [2022-11-18 20:13:47,826 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1550 transitions. [2022-11-18 20:13:47,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1550 transitions. [2022-11-18 20:13:47,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:13:47,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1550 transitions. [2022-11-18 20:13:47,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 110.71428571428571) internal successors, (1550), 14 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:47,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 133.0) internal successors, (1995), 15 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:47,839 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 133.0) internal successors, (1995), 15 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:47,839 INFO L175 Difference]: Start difference. First operand has 188 places, 176 transitions, 1090 flow. Second operand 14 states and 1550 transitions. [2022-11-18 20:13:47,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 245 transitions, 1722 flow [2022-11-18 20:13:49,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 245 transitions, 1401 flow, removed 127 selfloop flow, removed 14 redundant places. [2022-11-18 20:13:49,210 INFO L231 Difference]: Finished difference. Result has 193 places, 184 transitions, 971 flow [2022-11-18 20:13:49,211 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=971, PETRI_PLACES=193, PETRI_TRANSITIONS=184} [2022-11-18 20:13:49,211 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 53 predicate places. [2022-11-18 20:13:49,212 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 184 transitions, 971 flow [2022-11-18 20:13:49,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:49,212 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:49,212 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:49,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:13:49,213 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:13:49,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash 894886546, now seen corresponding path program 2 times [2022-11-18 20:13:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:49,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942335305] [2022-11-18 20:13:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:49,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942335305] [2022-11-18 20:13:49,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942335305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:49,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:49,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:13:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491941346] [2022-11-18 20:13:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:49,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:13:49,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:49,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:13:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:13:49,792 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-11-18 20:13:49,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 184 transitions, 971 flow. Second operand has 9 states, 9 states have (on average 110.77777777777777) internal successors, (997), 9 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:49,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:49,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-11-18 20:13:49,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:13:53,079 INFO L130 PetriNetUnfolder]: 5745/12094 cut-off events. [2022-11-18 20:13:53,080 INFO L131 PetriNetUnfolder]: For 48924/57887 co-relation queries the response was YES. [2022-11-18 20:13:53,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44026 conditions, 12094 events. 5745/12094 cut-off events. For 48924/57887 co-relation queries the response was YES. Maximal size of possible extension queue 1103. Compared 121825 event pairs, 73 based on Foata normal form. 410/11934 useless extension candidates. Maximal degree in co-relation 43987. Up to 1539 conditions per place. [2022-11-18 20:13:53,193 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 78 selfloop transitions, 51 changer transitions 40/277 dead transitions. [2022-11-18 20:13:53,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 277 transitions, 2052 flow [2022-11-18 20:13:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:13:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 20:13:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2194 transitions. [2022-11-18 20:13:53,200 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8682231895528294 [2022-11-18 20:13:53,200 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2194 transitions. [2022-11-18 20:13:53,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2194 transitions. [2022-11-18 20:13:53,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:13:53,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2194 transitions. [2022-11-18 20:13:53,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 115.47368421052632) internal successors, (2194), 19 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:53,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 133.0) internal successors, (2660), 20 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:53,215 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 133.0) internal successors, (2660), 20 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:53,215 INFO L175 Difference]: Start difference. First operand has 193 places, 184 transitions, 971 flow. Second operand 19 states and 2194 transitions. [2022-11-18 20:13:53,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 277 transitions, 2052 flow [2022-11-18 20:13:54,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 277 transitions, 1782 flow, removed 109 selfloop flow, removed 11 redundant places. [2022-11-18 20:13:54,166 INFO L231 Difference]: Finished difference. Result has 195 places, 181 transitions, 985 flow [2022-11-18 20:13:54,167 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=985, PETRI_PLACES=195, PETRI_TRANSITIONS=181} [2022-11-18 20:13:54,167 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 55 predicate places. [2022-11-18 20:13:54,168 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 181 transitions, 985 flow [2022-11-18 20:13:54,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.77777777777777) internal successors, (997), 9 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:54,168 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:54,169 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:54,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:13:54,169 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:13:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1245731400, now seen corresponding path program 1 times [2022-11-18 20:13:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:54,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340674094] [2022-11-18 20:13:54,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:54,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340674094] [2022-11-18 20:13:55,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340674094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:55,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:55,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:13:55,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725280353] [2022-11-18 20:13:55,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:55,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:13:55,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:55,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:13:55,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:13:55,363 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 133 [2022-11-18 20:13:55,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 181 transitions, 985 flow. Second operand has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:55,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:55,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 133 [2022-11-18 20:13:55,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:13:57,382 INFO L130 PetriNetUnfolder]: 3224/11551 cut-off events. [2022-11-18 20:13:57,383 INFO L131 PetriNetUnfolder]: For 25155/26873 co-relation queries the response was YES. [2022-11-18 20:13:57,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35789 conditions, 11551 events. 3224/11551 cut-off events. For 25155/26873 co-relation queries the response was YES. Maximal size of possible extension queue 1449. Compared 158134 event pairs, 21 based on Foata normal form. 5/10804 useless extension candidates. Maximal degree in co-relation 35690. Up to 1192 conditions per place. [2022-11-18 20:13:57,502 INFO L137 encePairwiseOnDemand]: 121/133 looper letters, 36 selfloop transitions, 19 changer transitions 6/213 dead transitions. [2022-11-18 20:13:57,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 213 transitions, 1318 flow [2022-11-18 20:13:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:13:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 20:13:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1292 transitions. [2022-11-18 20:13:57,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2022-11-18 20:13:57,508 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1292 transitions. [2022-11-18 20:13:57,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1292 transitions. [2022-11-18 20:13:57,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:13:57,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1292 transitions. [2022-11-18 20:13:57,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 107.66666666666667) internal successors, (1292), 12 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:57,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 133.0) internal successors, (1729), 13 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:57,518 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 133.0) internal successors, (1729), 13 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:57,518 INFO L175 Difference]: Start difference. First operand has 195 places, 181 transitions, 985 flow. Second operand 12 states and 1292 transitions. [2022-11-18 20:13:57,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 213 transitions, 1318 flow [2022-11-18 20:13:58,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 213 transitions, 1170 flow, removed 37 selfloop flow, removed 16 redundant places. [2022-11-18 20:13:58,828 INFO L231 Difference]: Finished difference. Result has 195 places, 197 transitions, 1081 flow [2022-11-18 20:13:58,829 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1081, PETRI_PLACES=195, PETRI_TRANSITIONS=197} [2022-11-18 20:13:58,829 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 55 predicate places. [2022-11-18 20:13:58,829 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 197 transitions, 1081 flow [2022-11-18 20:13:58,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:58,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:58,830 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:58,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:13:58,830 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:13:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash -822410772, now seen corresponding path program 2 times [2022-11-18 20:13:58,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:58,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607270500] [2022-11-18 20:13:58,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:59,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607270500] [2022-11-18 20:13:59,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607270500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:59,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:59,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:13:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927345260] [2022-11-18 20:13:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:59,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:13:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:13:59,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:13:59,153 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 133 [2022-11-18 20:13:59,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 197 transitions, 1081 flow. Second operand has 7 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:59,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:59,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 133 [2022-11-18 20:13:59,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:14:01,944 INFO L130 PetriNetUnfolder]: 4510/16214 cut-off events. [2022-11-18 20:14:01,945 INFO L131 PetriNetUnfolder]: For 25604/26149 co-relation queries the response was YES. [2022-11-18 20:14:02,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45707 conditions, 16214 events. 4510/16214 cut-off events. For 25604/26149 co-relation queries the response was YES. Maximal size of possible extension queue 2059. Compared 233970 event pairs, 26 based on Foata normal form. 19/15186 useless extension candidates. Maximal degree in co-relation 45671. Up to 1640 conditions per place. [2022-11-18 20:14:02,100 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 41 selfloop transitions, 26 changer transitions 37/239 dead transitions. [2022-11-18 20:14:02,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 239 transitions, 1576 flow [2022-11-18 20:14:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:14:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 20:14:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 887 transitions. [2022-11-18 20:14:02,103 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8336466165413534 [2022-11-18 20:14:02,104 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 887 transitions. [2022-11-18 20:14:02,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 887 transitions. [2022-11-18 20:14:02,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:14:02,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 887 transitions. [2022-11-18 20:14:02,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:02,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 133.0) internal successors, (1197), 9 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:02,111 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 133.0) internal successors, (1197), 9 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:02,111 INFO L175 Difference]: Start difference. First operand has 195 places, 197 transitions, 1081 flow. Second operand 8 states and 887 transitions. [2022-11-18 20:14:02,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 239 transitions, 1576 flow [2022-11-18 20:14:04,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 239 transitions, 1558 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-18 20:14:04,245 INFO L231 Difference]: Finished difference. Result has 200 places, 192 transitions, 1145 flow [2022-11-18 20:14:04,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1145, PETRI_PLACES=200, PETRI_TRANSITIONS=192} [2022-11-18 20:14:04,246 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 60 predicate places. [2022-11-18 20:14:04,246 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 192 transitions, 1145 flow [2022-11-18 20:14:04,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:04,247 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:14:04,247 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:04,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:14:04,247 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:14:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1679813930, now seen corresponding path program 3 times [2022-11-18 20:14:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:04,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372339909] [2022-11-18 20:14:04,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:04,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:14:04,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:04,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372339909] [2022-11-18 20:14:04,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372339909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:14:04,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:14:04,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:14:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436722900] [2022-11-18 20:14:04,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:14:04,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:14:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:04,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:14:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:14:04,656 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 133 [2022-11-18 20:14:04,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 192 transitions, 1145 flow. Second operand has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:04,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:14:04,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 133 [2022-11-18 20:14:04,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:14:06,691 INFO L130 PetriNetUnfolder]: 2322/9704 cut-off events. [2022-11-18 20:14:06,692 INFO L131 PetriNetUnfolder]: For 16870/17072 co-relation queries the response was YES. [2022-11-18 20:14:06,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27489 conditions, 9704 events. 2322/9704 cut-off events. For 16870/17072 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 136730 event pairs, 42 based on Foata normal form. 4/9066 useless extension candidates. Maximal degree in co-relation 27450. Up to 1050 conditions per place. [2022-11-18 20:14:06,775 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 34 selfloop transitions, 16 changer transitions 38/223 dead transitions. [2022-11-18 20:14:06,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 223 transitions, 1600 flow [2022-11-18 20:14:06,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:14:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:14:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 989 transitions. [2022-11-18 20:14:06,779 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8262322472848789 [2022-11-18 20:14:06,779 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 989 transitions. [2022-11-18 20:14:06,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 989 transitions. [2022-11-18 20:14:06,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:14:06,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 989 transitions. [2022-11-18 20:14:06,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.88888888888889) internal successors, (989), 9 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:06,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:06,786 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:06,786 INFO L175 Difference]: Start difference. First operand has 200 places, 192 transitions, 1145 flow. Second operand 9 states and 989 transitions. [2022-11-18 20:14:06,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 223 transitions, 1600 flow [2022-11-18 20:14:07,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 223 transitions, 1525 flow, removed 36 selfloop flow, removed 7 redundant places. [2022-11-18 20:14:07,846 INFO L231 Difference]: Finished difference. Result has 197 places, 175 transitions, 959 flow [2022-11-18 20:14:07,847 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=959, PETRI_PLACES=197, PETRI_TRANSITIONS=175} [2022-11-18 20:14:07,847 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 57 predicate places. [2022-11-18 20:14:07,848 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 175 transitions, 959 flow [2022-11-18 20:14:07,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:07,848 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:14:07,849 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:07,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:14:07,849 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:14:07,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:07,850 INFO L85 PathProgramCache]: Analyzing trace with hash 438237034, now seen corresponding path program 4 times [2022-11-18 20:14:07,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:07,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6258626] [2022-11-18 20:14:07,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:14:08,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:08,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6258626] [2022-11-18 20:14:08,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6258626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:14:08,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:14:08,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:14:08,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953480050] [2022-11-18 20:14:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:14:08,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:14:08,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:08,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:14:08,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:14:08,135 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2022-11-18 20:14:08,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 175 transitions, 959 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:08,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:14:08,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2022-11-18 20:14:08,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:14:09,041 INFO L130 PetriNetUnfolder]: 1443/6141 cut-off events. [2022-11-18 20:14:09,041 INFO L131 PetriNetUnfolder]: For 9965/10093 co-relation queries the response was YES. [2022-11-18 20:14:09,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17062 conditions, 6141 events. 1443/6141 cut-off events. For 9965/10093 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 80061 event pairs, 19 based on Foata normal form. 1/5777 useless extension candidates. Maximal degree in co-relation 17024. Up to 696 conditions per place. [2022-11-18 20:14:09,107 INFO L137 encePairwiseOnDemand]: 125/133 looper letters, 23 selfloop transitions, 7 changer transitions 20/187 dead transitions. [2022-11-18 20:14:09,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 187 transitions, 1126 flow [2022-11-18 20:14:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:14:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 20:14:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2022-11-18 20:14:09,110 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2022-11-18 20:14:09,110 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 779 transitions. [2022-11-18 20:14:09,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 779 transitions. [2022-11-18 20:14:09,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:14:09,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 779 transitions. [2022-11-18 20:14:09,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:09,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:09,120 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:09,120 INFO L175 Difference]: Start difference. First operand has 197 places, 175 transitions, 959 flow. Second operand 7 states and 779 transitions. [2022-11-18 20:14:09,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 187 transitions, 1126 flow [2022-11-18 20:14:09,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 187 transitions, 1019 flow, removed 17 selfloop flow, removed 12 redundant places. [2022-11-18 20:14:09,388 INFO L231 Difference]: Finished difference. Result has 191 places, 166 transitions, 806 flow [2022-11-18 20:14:09,389 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=806, PETRI_PLACES=191, PETRI_TRANSITIONS=166} [2022-11-18 20:14:09,389 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 51 predicate places. [2022-11-18 20:14:09,389 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 166 transitions, 806 flow [2022-11-18 20:14:09,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:09,390 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:14:09,390 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:09,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:14:09,391 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:14:09,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1182586248, now seen corresponding path program 5 times [2022-11-18 20:14:09,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:09,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089514003] [2022-11-18 20:14:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:14:09,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:14:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:14:09,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:14:09,598 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:14:09,599 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-18 20:14:09,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-18 20:14:09,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-18 20:14:09,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-18 20:14:09,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-18 20:14:09,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-18 20:14:09,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-18 20:14:09,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:14:09,608 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:09,615 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:14:09,615 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:14:09,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:14:09 BasicIcfg [2022-11-18 20:14:09,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:14:09,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:14:09,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:14:09,839 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:14:09,839 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:13:31" (3/4) ... [2022-11-18 20:14:09,841 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:14:09,956 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:14:09,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:14:09,957 INFO L158 Benchmark]: Toolchain (without parser) took 40469.13ms. Allocated memory was 146.8MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 110.4MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-18 20:14:09,957 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 86.0MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:14:09,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 798.01ms. Allocated memory is still 146.8MB. Free memory was 110.4MB in the beginning and 105.3MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:14:09,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.42ms. Allocated memory is still 146.8MB. Free memory was 105.3MB in the beginning and 102.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:14:09,958 INFO L158 Benchmark]: Boogie Preprocessor took 71.81ms. Allocated memory is still 146.8MB. Free memory was 102.9MB in the beginning and 100.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:14:09,959 INFO L158 Benchmark]: RCFGBuilder took 939.93ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 100.8MB in the beginning and 150.5MB in the end (delta: -49.7MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2022-11-18 20:14:09,959 INFO L158 Benchmark]: TraceAbstraction took 38441.32ms. Allocated memory was 184.5MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 150.5MB in the beginning and 6.0GB in the end (delta: -5.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-18 20:14:09,960 INFO L158 Benchmark]: Witness Printer took 117.95ms. Allocated memory is still 7.1GB. Free memory was 6.0GB in the beginning and 5.9GB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-18 20:14:09,962 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.33ms. Allocated memory is still 86.0MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 798.01ms. Allocated memory is still 146.8MB. Free memory was 110.4MB in the beginning and 105.3MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.42ms. Allocated memory is still 146.8MB. Free memory was 105.3MB in the beginning and 102.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.81ms. Allocated memory is still 146.8MB. Free memory was 102.9MB in the beginning and 100.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 939.93ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 100.8MB in the beginning and 150.5MB in the end (delta: -49.7MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38441.32ms. Allocated memory was 184.5MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 150.5MB in the beginning and 6.0GB in the end (delta: -5.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 117.95ms. Allocated memory is still 7.1GB. Free memory was 6.0GB in the beginning and 5.9GB in the end (delta: 32.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: [L738] 0 _Bool z$r_buff1_thd4; VAL [z$r_buff1_thd4=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [z$r_buff1_thd2=0, z$r_buff1_thd4=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [z$r_buff1_thd0=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L745] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L743] 0 int z$w_buff1; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L746] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L727] 0 _Bool z$flush_delayed; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L741] 0 int z$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L718] 0 int a = 0; VAL [__unbuffered_p1_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1365; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1365, ((void *)0), P0, ((void *)0))=-3, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1366; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1366, ((void *)0), P1, ((void *)0))=-2, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1367; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1367, ((void *)0), P2, ((void *)0))=-1, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1368; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1368, ((void *)0), P3, ((void *)0))=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 38.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 854 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 854 mSDsluCounter, 698 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1447 IncrementalHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 150 mSDtfsCounter, 1447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1145occurred in iteration=10, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1217 NumberOfCodeBlocks, 1217 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1103 ConstructedInterpolants, 0 QuantifiedInterpolants, 4195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 20:14:09,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f211af2-b51b-4117-a326-4e21c8c01f9b/bin/uautomizer-TMbwUNV5ro/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