./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN --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 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 --- 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-6b4ec56 [2022-11-20 10:52:35,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:52:35,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:52:35,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:52:35,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:52:35,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:52:35,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:52:35,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:52:35,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:52:35,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:52:35,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:52:35,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:52:35,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:52:35,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:52:35,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:52:35,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:52:35,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:52:35,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:52:35,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:52:35,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:52:35,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:52:35,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:52:35,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:52:35,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:52:35,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:52:35,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:52:35,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:52:35,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:52:35,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:52:35,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:52:35,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:52:35,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:52:35,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:52:35,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:52:35,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:52:35,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:52:35,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:52:35,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:52:35,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:52:35,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:52:35,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:52:35,689 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:52:35,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:52:35,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:52:35,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:52:35,733 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:52:35,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:52:35,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:52:35,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:52:35,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:52:35,736 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:52:35,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:52:35,737 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:52:35,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:52:35,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:52:35,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:52:35,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:52:35,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:52:35,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:52:35,738 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:52:35,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:52:35,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:52:35,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:52:35,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:52:35,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:52:35,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:52:35,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:52:35,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:52:35,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:52:35,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:52:35,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:52:35,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:52:35,741 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:52:35,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:52:35,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:52:35,742 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_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/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_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN 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 -> 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 [2022-11-20 10:52:35,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:52:36,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:52:36,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:52:36,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:52:36,037 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:52:36,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2022-11-20 10:52:39,179 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:52:39,483 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:52:39,483 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2022-11-20 10:52:39,500 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/data/a338cc9e6/e31730e69d8d4a6fa916c089b2f0d744/FLAG82829afd6 [2022-11-20 10:52:39,516 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/data/a338cc9e6/e31730e69d8d4a6fa916c089b2f0d744 [2022-11-20 10:52:39,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:52:39,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:52:39,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:52:39,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:52:39,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:52:39,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:52:39" (1/1) ... [2022-11-20 10:52:39,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34483470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:39, skipping insertion in model container [2022-11-20 10:52:39,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:52:39" (1/1) ... [2022-11-20 10:52:39,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:52:39,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:52:39,807 WARN L237 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_a30eb69e-f517-4ac7-8162-fb9d10bca325/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i[999,1012] [2022-11-20 10:52:40,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:52:40,138 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:52:40,151 WARN L237 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_a30eb69e-f517-4ac7-8162-fb9d10bca325/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i[999,1012] [2022-11-20 10:52:40,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:52:40,271 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:52:40,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40 WrapperNode [2022-11-20 10:52:40,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:52:40,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:52:40,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:52:40,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:52:40,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,359 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-11-20 10:52:40,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:52:40,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:52:40,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:52:40,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:52:40,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,418 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:52:40,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:52:40,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:52:40,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:52:40,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (1/1) ... [2022-11-20 10:52:40,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:52:40,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:40,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:52:40,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:52:40,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:52:40,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:52:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:52:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:52:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:52:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:52:40,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:52:40,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:52:40,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:52:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:52:40,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:52:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:52:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:52:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:52:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:52:40,536 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:52:40,783 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:52:40,786 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:52:41,149 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:52:41,359 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:52:41,360 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:52:41,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:52:41 BoogieIcfgContainer [2022-11-20 10:52:41,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:52:41,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:52:41,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:52:41,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:52:41,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:52:39" (1/3) ... [2022-11-20 10:52:41,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305b16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:52:41, skipping insertion in model container [2022-11-20 10:52:41,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:40" (2/3) ... [2022-11-20 10:52:41,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305b16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:52:41, skipping insertion in model container [2022-11-20 10:52:41,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:52:41" (3/3) ... [2022-11-20 10:52:41,376 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2022-11-20 10:52:41,386 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:52:41,395 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:52:41,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 10:52:41,395 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:52:41,446 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:52:41,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-11-20 10:52:41,544 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-11-20 10:52:41,545 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:52:41,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-20 10:52:41,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2022-11-20 10:52:41,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2022-11-20 10:52:41,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:52:41,571 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;@1b68ed68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:52:41,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 10:52:41,588 INFO L130 PetriNetUnfolder]: 0/60 cut-off events. [2022-11-20 10:52:41,588 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:52:41,589 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:41,589 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] [2022-11-20 10:52:41,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:52:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:41,597 INFO L85 PathProgramCache]: Analyzing trace with hash -374570384, now seen corresponding path program 1 times [2022-11-20 10:52:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316394022] [2022-11-20 10:52:41,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:42,350 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-20 10:52:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:42,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316394022] [2022-11-20 10:52:42,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316394022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:42,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:42,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:52:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208918953] [2022-11-20 10:52:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:42,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:52:42,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:42,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:52:42,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:52:42,427 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 116 [2022-11-20 10:52:42,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-20 10:52:42,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:42,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 116 [2022-11-20 10:52:42,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:42,613 INFO L130 PetriNetUnfolder]: 37/224 cut-off events. [2022-11-20 10:52:42,614 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-20 10:52:42,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 224 events. 37/224 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 709 event pairs, 7 based on Foata normal form. 13/221 useless extension candidates. Maximal degree in co-relation 264. Up to 51 conditions per place. [2022-11-20 10:52:42,618 INFO L137 encePairwiseOnDemand]: 111/116 looper letters, 11 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-11-20 10:52:42,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 113 transitions, 264 flow [2022-11-20 10:52:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:52:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:52:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-11-20 10:52:42,639 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9396551724137931 [2022-11-20 10:52:42,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2022-11-20 10:52:42,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2022-11-20 10:52:42,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:42,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2022-11-20 10:52:42,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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-20 10:52:42,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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-20 10:52:42,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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-20 10:52:42,665 INFO L175 Difference]: Start difference. First operand has 121 places, 113 transitions, 235 flow. Second operand 3 states and 327 transitions. [2022-11-20 10:52:42,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 113 transitions, 264 flow [2022-11-20 10:52:42,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 260 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:52:42,674 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 228 flow [2022-11-20 10:52:42,677 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2022-11-20 10:52:42,683 INFO L288 CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places. [2022-11-20 10:52:42,684 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 228 flow [2022-11-20 10:52:42,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-20 10:52:42,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:42,685 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] [2022-11-20 10:52:42,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:52:42,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:52:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1294320850, now seen corresponding path program 1 times [2022-11-20 10:52:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:42,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320687034] [2022-11-20 10:52:42,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:42,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:43,231 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-20 10:52:43,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:43,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320687034] [2022-11-20 10:52:43,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320687034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:43,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:43,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:52:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324962492] [2022-11-20 10:52:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:43,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:52:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:43,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:52:43,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:52:43,242 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2022-11-20 10:52:43,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-20 10:52:43,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:43,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2022-11-20 10:52:43,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:44,456 INFO L130 PetriNetUnfolder]: 1034/2695 cut-off events. [2022-11-20 10:52:44,456 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-11-20 10:52:44,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4458 conditions, 2695 events. 1034/2695 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 20932 event pairs, 164 based on Foata normal form. 0/2613 useless extension candidates. Maximal degree in co-relation 4402. Up to 586 conditions per place. [2022-11-20 10:52:44,473 INFO L137 encePairwiseOnDemand]: 107/116 looper letters, 31 selfloop transitions, 5 changer transitions 75/186 dead transitions. [2022-11-20 10:52:44,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 186 transitions, 596 flow [2022-11-20 10:52:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:52:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:52:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1260 transitions. [2022-11-20 10:52:44,483 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8355437665782494 [2022-11-20 10:52:44,484 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1260 transitions. [2022-11-20 10:52:44,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1260 transitions. [2022-11-20 10:52:44,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:44,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1260 transitions. [2022-11-20 10:52:44,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.92307692307692) internal successors, (1260), 13 states have internal predecessors, (1260), 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-20 10:52:44,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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-20 10:52:44,495 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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-20 10:52:44,495 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 228 flow. Second operand 13 states and 1260 transitions. [2022-11-20 10:52:44,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 186 transitions, 596 flow [2022-11-20 10:52:44,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 186 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:52:44,502 INFO L231 Difference]: Finished difference. Result has 140 places, 100 transitions, 272 flow [2022-11-20 10:52:44,503 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=272, PETRI_PLACES=140, PETRI_TRANSITIONS=100} [2022-11-20 10:52:44,504 INFO L288 CegarLoopForPetriNet]: 121 programPoint places, 19 predicate places. [2022-11-20 10:52:44,504 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 100 transitions, 272 flow [2022-11-20 10:52:44,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-20 10:52:44,505 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:44,506 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] [2022-11-20 10:52:44,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:52:44,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:52:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash -888938989, now seen corresponding path program 1 times [2022-11-20 10:52:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:44,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369596622] [2022-11-20 10:52:44,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:44,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:44,863 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-20 10:52:44,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:44,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369596622] [2022-11-20 10:52:44,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369596622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:44,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:44,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:52:44,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542791090] [2022-11-20 10:52:44,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:44,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:52:44,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:44,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:52:44,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:52:44,872 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-11-20 10:52:44,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 100 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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-20 10:52:44,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:44,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-11-20 10:52:44,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:45,786 INFO L130 PetriNetUnfolder]: 1594/3272 cut-off events. [2022-11-20 10:52:45,786 INFO L131 PetriNetUnfolder]: For 3176/3346 co-relation queries the response was YES. [2022-11-20 10:52:45,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7518 conditions, 3272 events. 1594/3272 cut-off events. For 3176/3346 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 24238 event pairs, 125 based on Foata normal form. 16/3117 useless extension candidates. Maximal degree in co-relation 7453. Up to 911 conditions per place. [2022-11-20 10:52:45,809 INFO L137 encePairwiseOnDemand]: 106/116 looper letters, 37 selfloop transitions, 7 changer transitions 43/167 dead transitions. [2022-11-20 10:52:45,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 167 transitions, 668 flow [2022-11-20 10:52:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:52:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 10:52:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1011 transitions. [2022-11-20 10:52:45,813 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.871551724137931 [2022-11-20 10:52:45,813 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1011 transitions. [2022-11-20 10:52:45,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1011 transitions. [2022-11-20 10:52:45,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:45,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1011 transitions. [2022-11-20 10:52:45,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.1) internal successors, (1011), 10 states have internal predecessors, (1011), 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-20 10:52:45,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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-20 10:52:45,821 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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-20 10:52:45,821 INFO L175 Difference]: Start difference. First operand has 140 places, 100 transitions, 272 flow. Second operand 10 states and 1011 transitions. [2022-11-20 10:52:45,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 167 transitions, 668 flow [2022-11-20 10:52:45,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 167 transitions, 654 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-20 10:52:45,831 INFO L231 Difference]: Finished difference. Result has 130 places, 104 transitions, 320 flow [2022-11-20 10:52:45,831 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=320, PETRI_PLACES=130, PETRI_TRANSITIONS=104} [2022-11-20 10:52:45,832 INFO L288 CegarLoopForPetriNet]: 121 programPoint places, 9 predicate places. [2022-11-20 10:52:45,832 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 104 transitions, 320 flow [2022-11-20 10:52:45,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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-20 10:52:45,833 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:45,833 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] [2022-11-20 10:52:45,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:52:45,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:52:45,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1450486993, now seen corresponding path program 1 times [2022-11-20 10:52:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:45,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078920087] [2022-11-20 10:52:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:46,238 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-20 10:52:46,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:46,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078920087] [2022-11-20 10:52:46,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078920087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:46,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:46,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:52:46,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725388334] [2022-11-20 10:52:46,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:46,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:52:46,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:46,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:52:46,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:52:46,251 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-11-20 10:52:46,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 104 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 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-20 10:52:46,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:46,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-11-20 10:52:46,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:46,965 INFO L130 PetriNetUnfolder]: 735/1857 cut-off events. [2022-11-20 10:52:46,965 INFO L131 PetriNetUnfolder]: For 2966/3021 co-relation queries the response was YES. [2022-11-20 10:52:46,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5511 conditions, 1857 events. 735/1857 cut-off events. For 2966/3021 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13715 event pairs, 89 based on Foata normal form. 61/1870 useless extension candidates. Maximal degree in co-relation 5441. Up to 459 conditions per place. [2022-11-20 10:52:46,978 INFO L137 encePairwiseOnDemand]: 106/116 looper letters, 45 selfloop transitions, 18 changer transitions 34/177 dead transitions. [2022-11-20 10:52:46,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 177 transitions, 911 flow [2022-11-20 10:52:46,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:52:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:52:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1113 transitions. [2022-11-20 10:52:46,983 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.872257053291536 [2022-11-20 10:52:46,983 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1113 transitions. [2022-11-20 10:52:46,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1113 transitions. [2022-11-20 10:52:46,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:46,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1113 transitions. [2022-11-20 10:52:46,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 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-20 10:52:46,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 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-20 10:52:46,992 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 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-20 10:52:46,992 INFO L175 Difference]: Start difference. First operand has 130 places, 104 transitions, 320 flow. Second operand 11 states and 1113 transitions. [2022-11-20 10:52:46,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 177 transitions, 911 flow [2022-11-20 10:52:47,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 177 transitions, 889 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-11-20 10:52:47,006 INFO L231 Difference]: Finished difference. Result has 135 places, 119 transitions, 491 flow [2022-11-20 10:52:47,006 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=491, PETRI_PLACES=135, PETRI_TRANSITIONS=119} [2022-11-20 10:52:47,007 INFO L288 CegarLoopForPetriNet]: 121 programPoint places, 14 predicate places. [2022-11-20 10:52:47,008 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 119 transitions, 491 flow [2022-11-20 10:52:47,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 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-20 10:52:47,009 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:47,009 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-20 10:52:47,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:52:47,009 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:52:47,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1219450131, now seen corresponding path program 1 times [2022-11-20 10:52:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:47,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484481936] [2022-11-20 10:52:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:47,377 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-20 10:52:47,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:47,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484481936] [2022-11-20 10:52:47,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484481936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:47,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:47,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:52:47,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796300970] [2022-11-20 10:52:47,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:47,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:52:47,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:47,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:52:47,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:52:47,381 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-11-20 10:52:47,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 119 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 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-20 10:52:47,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:47,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-11-20 10:52:47,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:48,050 INFO L130 PetriNetUnfolder]: 410/1938 cut-off events. [2022-11-20 10:52:48,051 INFO L131 PetriNetUnfolder]: For 4087/4180 co-relation queries the response was YES. [2022-11-20 10:52:48,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5732 conditions, 1938 events. 410/1938 cut-off events. For 4087/4180 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17863 event pairs, 41 based on Foata normal form. 19/1865 useless extension candidates. Maximal degree in co-relation 5656. Up to 485 conditions per place. [2022-11-20 10:52:48,068 INFO L137 encePairwiseOnDemand]: 103/116 looper letters, 49 selfloop transitions, 17 changer transitions 22/180 dead transitions. [2022-11-20 10:52:48,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 180 transitions, 904 flow [2022-11-20 10:52:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:52:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:52:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1043 transitions. [2022-11-20 10:52:48,072 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.817398119122257 [2022-11-20 10:52:48,072 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1043 transitions. [2022-11-20 10:52:48,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1043 transitions. [2022-11-20 10:52:48,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:48,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1043 transitions. [2022-11-20 10:52:48,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.81818181818181) internal successors, (1043), 11 states have internal predecessors, (1043), 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-20 10:52:48,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 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-20 10:52:48,079 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 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-20 10:52:48,080 INFO L175 Difference]: Start difference. First operand has 135 places, 119 transitions, 491 flow. Second operand 11 states and 1043 transitions. [2022-11-20 10:52:48,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 180 transitions, 904 flow [2022-11-20 10:52:48,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 180 transitions, 850 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-11-20 10:52:48,143 INFO L231 Difference]: Finished difference. Result has 153 places, 131 transitions, 605 flow [2022-11-20 10:52:48,144 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=605, PETRI_PLACES=153, PETRI_TRANSITIONS=131} [2022-11-20 10:52:48,147 INFO L288 CegarLoopForPetriNet]: 121 programPoint places, 32 predicate places. [2022-11-20 10:52:48,147 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 131 transitions, 605 flow [2022-11-20 10:52:48,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 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-20 10:52:48,148 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:48,148 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-20 10:52:48,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:52:48,149 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:52:48,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash -901988081, now seen corresponding path program 2 times [2022-11-20 10:52:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:48,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806496478] [2022-11-20 10:52:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:48,550 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-20 10:52:48,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:48,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806496478] [2022-11-20 10:52:48,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806496478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:48,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:48,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:52:48,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970460368] [2022-11-20 10:52:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:48,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:52:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:48,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:52:48,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:52:48,556 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-11-20 10:52:48,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 131 transitions, 605 flow. Second operand has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 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-20 10:52:48,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:48,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-11-20 10:52:48,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:49,330 INFO L130 PetriNetUnfolder]: 501/2334 cut-off events. [2022-11-20 10:52:49,331 INFO L131 PetriNetUnfolder]: For 4470/4602 co-relation queries the response was YES. [2022-11-20 10:52:49,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2334 events. 501/2334 cut-off events. For 4470/4602 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23243 event pairs, 48 based on Foata normal form. 19/2238 useless extension candidates. Maximal degree in co-relation 6500. Up to 303 conditions per place. [2022-11-20 10:52:49,350 INFO L137 encePairwiseOnDemand]: 103/116 looper letters, 53 selfloop transitions, 18 changer transitions 22/185 dead transitions. [2022-11-20 10:52:49,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 185 transitions, 1050 flow [2022-11-20 10:52:49,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:52:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:52:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2022-11-20 10:52:49,354 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8352490421455939 [2022-11-20 10:52:49,354 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2022-11-20 10:52:49,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2022-11-20 10:52:49,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:49,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2022-11-20 10:52:49,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 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-20 10:52:49,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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-20 10:52:49,361 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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-20 10:52:49,361 INFO L175 Difference]: Start difference. First operand has 153 places, 131 transitions, 605 flow. Second operand 9 states and 872 transitions. [2022-11-20 10:52:49,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 185 transitions, 1050 flow [2022-11-20 10:52:49,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 185 transitions, 988 flow, removed 31 selfloop flow, removed 6 redundant places. [2022-11-20 10:52:49,387 INFO L231 Difference]: Finished difference. Result has 153 places, 130 transitions, 625 flow [2022-11-20 10:52:49,387 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=625, PETRI_PLACES=153, PETRI_TRANSITIONS=130} [2022-11-20 10:52:49,390 INFO L288 CegarLoopForPetriNet]: 121 programPoint places, 32 predicate places. [2022-11-20 10:52:49,391 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 130 transitions, 625 flow [2022-11-20 10:52:49,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 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-20 10:52:49,392 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:49,392 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-20 10:52:49,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:52:49,392 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:52:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:49,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1110883427, now seen corresponding path program 3 times [2022-11-20 10:52:49,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:49,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204759086] [2022-11-20 10:52:49,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:49,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:49,775 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-20 10:52:49,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:49,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204759086] [2022-11-20 10:52:49,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204759086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:49,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:49,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:52:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776437672] [2022-11-20 10:52:49,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:49,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:52:49,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:52:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:52:49,788 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-11-20 10:52:49,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 130 transitions, 625 flow. Second operand has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 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-20 10:52:49,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:49,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-11-20 10:52:49,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:50,424 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L810-->L817: Formula: (let ((.cse3 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_75 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_86) v_~x$w_buff0_used~0_85) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_74 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_75)) (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse2 v_~x$w_buff1~0_25 v_~x~0_39)) v_~x~0_38) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_74 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_75, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_85} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][136], [131#true, 259#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 265#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 290#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 263#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 261#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1)), 94#L797true, 69#L768true, Black: 208#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 194#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 200#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#true, Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 204#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 147#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 23#L843-1true, Black: 134#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 133#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 224#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 153#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 100#L817true, Black: 218#(= ~z~0 1), Black: 216#true, Black: 219#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P0Thread1of1ForFork0InUse, Black: 170#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 206#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork1InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse]) [2022-11-20 10:52:50,425 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-20 10:52:50,425 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-20 10:52:50,426 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-20 10:52:50,426 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-20 10:52:50,528 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L810-->L817: Formula: (let ((.cse3 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_75 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_86) v_~x$w_buff0_used~0_85) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_74 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_75)) (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse2 v_~x$w_buff1~0_25 v_~x~0_39)) v_~x~0_38) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_74 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_75, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_85} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][136], [131#true, 259#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 265#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 290#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 263#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 261#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1)), 94#L797true, 69#L768true, Black: 208#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 194#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 200#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#true, Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 204#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 147#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 134#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 133#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 224#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 153#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 100#L817true, Black: 218#(= ~z~0 1), Black: 216#true, Black: 219#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 170#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork0InUse, 206#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork1InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 55#L3true]) [2022-11-20 10:52:50,528 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-11-20 10:52:50,528 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-20 10:52:50,528 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-20 10:52:50,529 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-20 10:52:50,576 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L810-->L817: Formula: (let ((.cse3 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_75 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_86) v_~x$w_buff0_used~0_85) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_74 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_75)) (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse2 v_~x$w_buff1~0_25 v_~x~0_39)) v_~x~0_38) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_74 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_75, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_85} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][147], [292#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 131#true, 259#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 265#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 263#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 261#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1)), 94#L797true, 69#L768true, 208#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 194#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 200#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#true, Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 204#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 147#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 134#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 133#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 224#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 153#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 100#L817true, 71#L4true, Black: 218#(= ~z~0 1), Black: 216#true, Black: 219#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 170#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork0InUse, Black: 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork1InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-11-20 10:52:50,577 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-20 10:52:50,577 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-20 10:52:50,577 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-20 10:52:50,577 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-20 10:52:50,626 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L810-->L817: Formula: (let ((.cse3 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_75 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_86) v_~x$w_buff0_used~0_85) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_74 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_75)) (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse2 v_~x$w_buff1~0_25 v_~x~0_39)) v_~x~0_38) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_74 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_75, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_85} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][147], [292#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 131#true, 259#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 265#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 263#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 261#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EBX~0 1)), 94#L797true, 69#L768true, 208#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 194#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 200#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#true, Black: 202#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 204#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 147#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 134#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 133#(= ~__unbuffered_p2_EAX~0 0), 172#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 224#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 153#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 100#L817true, Black: 218#(= ~z~0 1), Black: 216#true, Black: 219#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 76#L4-1true, Black: 170#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork0InUse, Black: 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork1InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-11-20 10:52:50,626 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-20 10:52:50,627 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-20 10:52:50,627 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-20 10:52:50,627 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-20 10:52:50,694 INFO L130 PetriNetUnfolder]: 984/2588 cut-off events. [2022-11-20 10:52:50,694 INFO L131 PetriNetUnfolder]: For 6956/7207 co-relation queries the response was YES. [2022-11-20 10:52:50,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8558 conditions, 2588 events. 984/2588 cut-off events. For 6956/7207 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 22029 event pairs, 106 based on Foata normal form. 71/2572 useless extension candidates. Maximal degree in co-relation 8527. Up to 367 conditions per place. [2022-11-20 10:52:50,711 INFO L137 encePairwiseOnDemand]: 106/116 looper letters, 29 selfloop transitions, 14 changer transitions 54/186 dead transitions. [2022-11-20 10:52:50,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 186 transitions, 1201 flow [2022-11-20 10:52:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:52:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 10:52:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1381 transitions. [2022-11-20 10:52:50,716 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8503694581280788 [2022-11-20 10:52:50,716 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1381 transitions. [2022-11-20 10:52:50,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1381 transitions. [2022-11-20 10:52:50,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:50,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1381 transitions. [2022-11-20 10:52:50,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 98.64285714285714) internal successors, (1381), 14 states have internal predecessors, (1381), 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-20 10:52:50,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 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-20 10:52:50,731 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 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-20 10:52:50,732 INFO L175 Difference]: Start difference. First operand has 153 places, 130 transitions, 625 flow. Second operand 14 states and 1381 transitions. [2022-11-20 10:52:50,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 186 transitions, 1201 flow [2022-11-20 10:52:50,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 186 transitions, 1073 flow, removed 35 selfloop flow, removed 9 redundant places. [2022-11-20 10:52:50,762 INFO L231 Difference]: Finished difference. Result has 160 places, 119 transitions, 523 flow [2022-11-20 10:52:50,762 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=523, PETRI_PLACES=160, PETRI_TRANSITIONS=119} [2022-11-20 10:52:50,763 INFO L288 CegarLoopForPetriNet]: 121 programPoint places, 39 predicate places. [2022-11-20 10:52:50,763 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 119 transitions, 523 flow [2022-11-20 10:52:50,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 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-20 10:52:50,764 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:50,765 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] [2022-11-20 10:52:50,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:52:50,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:52:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1845268149, now seen corresponding path program 1 times [2022-11-20 10:52:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:50,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201427500] [2022-11-20 10:52:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:51,088 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-20 10:52:51,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:51,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201427500] [2022-11-20 10:52:51,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201427500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:51,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:51,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:52:51,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411893699] [2022-11-20 10:52:51,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:51,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:52:51,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:51,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:52:51,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:52:51,092 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-11-20 10:52:51,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 119 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 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-20 10:52:51,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:51,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-11-20 10:52:51,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:51,433 INFO L130 PetriNetUnfolder]: 192/1345 cut-off events. [2022-11-20 10:52:51,433 INFO L131 PetriNetUnfolder]: For 3014/3079 co-relation queries the response was YES. [2022-11-20 10:52:51,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3794 conditions, 1345 events. 192/1345 cut-off events. For 3014/3079 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 13796 event pairs, 28 based on Foata normal form. 9/1266 useless extension candidates. Maximal degree in co-relation 3706. Up to 252 conditions per place. [2022-11-20 10:52:51,442 INFO L137 encePairwiseOnDemand]: 110/116 looper letters, 18 selfloop transitions, 2 changer transitions 20/130 dead transitions. [2022-11-20 10:52:51,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 130 transitions, 643 flow [2022-11-20 10:52:51,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:52:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:52:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 588 transitions. [2022-11-20 10:52:51,444 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8448275862068966 [2022-11-20 10:52:51,444 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 588 transitions. [2022-11-20 10:52:51,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 588 transitions. [2022-11-20 10:52:51,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:51,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 588 transitions. [2022-11-20 10:52:51,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 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-20 10:52:51,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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-20 10:52:51,449 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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-20 10:52:51,449 INFO L175 Difference]: Start difference. First operand has 160 places, 119 transitions, 523 flow. Second operand 6 states and 588 transitions. [2022-11-20 10:52:51,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 130 transitions, 643 flow [2022-11-20 10:52:51,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 130 transitions, 539 flow, removed 30 selfloop flow, removed 21 redundant places. [2022-11-20 10:52:51,472 INFO L231 Difference]: Finished difference. Result has 140 places, 108 transitions, 345 flow [2022-11-20 10:52:51,473 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=140, PETRI_TRANSITIONS=108} [2022-11-20 10:52:51,475 INFO L288 CegarLoopForPetriNet]: 121 programPoint places, 19 predicate places. [2022-11-20 10:52:51,475 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 108 transitions, 345 flow [2022-11-20 10:52:51,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 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-20 10:52:51,476 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:51,476 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] [2022-11-20 10:52:51,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:52:51,476 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:52:51,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:51,477 INFO L85 PathProgramCache]: Analyzing trace with hash 405789935, now seen corresponding path program 2 times [2022-11-20 10:52:51,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:51,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546992898] [2022-11-20 10:52:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:51,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:52,421 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-20 10:52:52,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:52,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546992898] [2022-11-20 10:52:52,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546992898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:52,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:52,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:52:52,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055783789] [2022-11-20 10:52:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:52,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:52:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:52,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:52:52,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:52:52,425 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 116 [2022-11-20 10:52:52,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 108 transitions, 345 flow. Second operand has 9 states, 9 states have (on average 92.33333333333333) internal successors, (831), 9 states have internal predecessors, (831), 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-20 10:52:52,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:52,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 116 [2022-11-20 10:52:52,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:52,695 INFO L130 PetriNetUnfolder]: 50/423 cut-off events. [2022-11-20 10:52:52,695 INFO L131 PetriNetUnfolder]: For 195/212 co-relation queries the response was YES. [2022-11-20 10:52:52,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 423 events. 50/423 cut-off events. For 195/212 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2638 event pairs, 2 based on Foata normal form. 7/404 useless extension candidates. Maximal degree in co-relation 776. Up to 60 conditions per place. [2022-11-20 10:52:52,698 INFO L137 encePairwiseOnDemand]: 107/116 looper letters, 21 selfloop transitions, 5 changer transitions 7/120 dead transitions. [2022-11-20 10:52:52,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 120 transitions, 457 flow [2022-11-20 10:52:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:52:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 10:52:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 934 transitions. [2022-11-20 10:52:52,701 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8051724137931034 [2022-11-20 10:52:52,701 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 934 transitions. [2022-11-20 10:52:52,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 934 transitions. [2022-11-20 10:52:52,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:52,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 934 transitions. [2022-11-20 10:52:52,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.4) internal successors, (934), 10 states have internal predecessors, (934), 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-20 10:52:52,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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-20 10:52:52,707 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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-20 10:52:52,707 INFO L175 Difference]: Start difference. First operand has 140 places, 108 transitions, 345 flow. Second operand 10 states and 934 transitions. [2022-11-20 10:52:52,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 120 transitions, 457 flow [2022-11-20 10:52:52,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 120 transitions, 401 flow, removed 19 selfloop flow, removed 10 redundant places. [2022-11-20 10:52:52,711 INFO L231 Difference]: Finished difference. Result has 140 places, 110 transitions, 334 flow [2022-11-20 10:52:52,712 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=334, PETRI_PLACES=140, PETRI_TRANSITIONS=110} [2022-11-20 10:52:52,712 INFO L288 CegarLoopForPetriNet]: 121 programPoint places, 19 predicate places. [2022-11-20 10:52:52,713 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 110 transitions, 334 flow [2022-11-20 10:52:52,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.33333333333333) internal successors, (831), 9 states have internal predecessors, (831), 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-20 10:52:52,713 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:52,714 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] [2022-11-20 10:52:52,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:52:52,714 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:52:52,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2006287585, now seen corresponding path program 3 times [2022-11-20 10:52:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:52,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418992276] [2022-11-20 10:52:52,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:52,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:52:52,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:52:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:52:52,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:52:52,837 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:52:52,838 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 10:52:52,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 10:52:52,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 10:52:52,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 10:52:52,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 10:52:52,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 10:52:52,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:52:52,844 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2022-11-20 10:52:52,851 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:52:52,851 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:52:53,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:52:53 BasicIcfg [2022-11-20 10:52:53,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:52:53,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:52:53,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:52:53,013 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:52:53,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:52:41" (3/4) ... [2022-11-20 10:52:53,016 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:52:53,124 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:52:53,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:52:53,125 INFO L158 Benchmark]: Toolchain (without parser) took 13603.23ms. Allocated memory was 138.4MB in the beginning and 343.9MB in the end (delta: 205.5MB). Free memory was 106.1MB in the beginning and 273.8MB in the end (delta: -167.7MB). Peak memory consumption was 218.6MB. Max. memory is 16.1GB. [2022-11-20 10:52:53,125 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 111.1MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:52:53,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 745.35ms. Allocated memory is still 138.4MB. Free memory was 105.7MB in the beginning and 83.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 10:52:53,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.95ms. Allocated memory is still 138.4MB. Free memory was 83.1MB in the beginning and 80.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:52:53,126 INFO L158 Benchmark]: Boogie Preprocessor took 62.74ms. Allocated memory is still 138.4MB. Free memory was 80.6MB in the beginning and 78.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:52:53,126 INFO L158 Benchmark]: RCFGBuilder took 939.28ms. Allocated memory is still 138.4MB. Free memory was 78.9MB in the beginning and 88.2MB in the end (delta: -9.3MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-11-20 10:52:53,127 INFO L158 Benchmark]: TraceAbstraction took 11648.14ms. Allocated memory was 138.4MB in the beginning and 343.9MB in the end (delta: 205.5MB). Free memory was 87.4MB in the beginning and 96.7MB in the end (delta: -9.3MB). Peak memory consumption was 196.8MB. Max. memory is 16.1GB. [2022-11-20 10:52:53,127 INFO L158 Benchmark]: Witness Printer took 111.15ms. Allocated memory is still 343.9MB. Free memory was 96.7MB in the beginning and 273.8MB in the end (delta: -177.2MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2022-11-20 10:52:53,129 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.22ms. Allocated memory is still 111.1MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 745.35ms. Allocated memory is still 138.4MB. Free memory was 105.7MB in the beginning and 83.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.95ms. Allocated memory is still 138.4MB. Free memory was 83.1MB in the beginning and 80.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.74ms. Allocated memory is still 138.4MB. Free memory was 80.6MB in the beginning and 78.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 939.28ms. Allocated memory is still 138.4MB. Free memory was 78.9MB in the beginning and 88.2MB in the end (delta: -9.3MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11648.14ms. Allocated memory was 138.4MB in the beginning and 343.9MB in the end (delta: 205.5MB). Free memory was 87.4MB in the beginning and 96.7MB in the end (delta: -9.3MB). Peak memory consumption was 196.8MB. Max. memory is 16.1GB. * Witness Printer took 111.15ms. Allocated memory is still 343.9MB. Free memory was 96.7MB in the beginning and 273.8MB in the end (delta: -177.2MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t666; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t666, ((void *)0), P0, ((void *)0))=-2, t666={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] 0 pthread_t t667; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t666={5:0}, t667={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t667, ((void *)0), P1, ((void *)0))=-1, t666={5:0}, t667={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] 0 pthread_t t668; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t668, ((void *)0), P2, ((void *)0))=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 19]: 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: 835]: 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: 837]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 498 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 498 mSDsluCounter, 529 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 419 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1111 IncrementalHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 110 mSDtfsCounter, 1111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=625occurred in iteration=6, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 812 NumberOfCodeBlocks, 812 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 713 ConstructedInterpolants, 0 QuantifiedInterpolants, 2796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 10:52:53,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a30eb69e-f517-4ac7-8162-fb9d10bca325/bin/uautomizer-ug76WZFUDN/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