./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8 --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 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 --- 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-e04fb08 [2022-11-16 12:30:44,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:30:44,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:30:44,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:30:44,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:30:44,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:30:44,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:30:44,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:30:44,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:30:44,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:30:44,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:30:44,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:30:44,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:30:44,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:30:44,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:30:44,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:30:44,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:30:44,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:30:44,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:30:44,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:30:44,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:30:44,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:30:44,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:30:44,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:30:44,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:30:44,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:30:44,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:30:44,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:30:44,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:30:44,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:30:44,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:30:44,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:30:44,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:30:44,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:30:44,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:30:44,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:30:44,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:30:44,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:30:44,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:30:44,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:30:44,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:30:44,733 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:30:44,762 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:30:44,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:30:44,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:30:44,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:30:44,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:30:44,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:30:44,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:30:44,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:30:44,765 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:30:44,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:30:44,766 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:30:44,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:30:44,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:30:44,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:30:44,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:30:44,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:30:44,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:30:44,767 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:30:44,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:30:44,767 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:30:44,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:30:44,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:30:44,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:30:44,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:30:44,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:30:44,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:30:44,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:30:44,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:30:44,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:30:44,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:30:44,770 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:30:44,770 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:30:44,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:30:44,770 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_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/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_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8 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 -> 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 [2022-11-16 12:30:45,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:30:45,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:30:45,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:30:45,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:30:45,053 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:30:45,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-11-16 12:30:45,117 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/data/977e14837/1a29c0a6d98840b088c4c9eb411d61ea/FLAGacb26a333 [2022-11-16 12:30:45,705 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:30:45,706 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-11-16 12:30:45,720 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/data/977e14837/1a29c0a6d98840b088c4c9eb411d61ea/FLAGacb26a333 [2022-11-16 12:30:46,001 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/data/977e14837/1a29c0a6d98840b088c4c9eb411d61ea [2022-11-16 12:30:46,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:30:46,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:30:46,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:30:46,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:30:46,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:30:46,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e11a826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46, skipping insertion in model container [2022-11-16 12:30:46,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:30:46,093 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:30:46,376 WARN L229 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_ad6cc284-1050-4163-b309-4d69eaa7c3dc/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2022-11-16 12:30:46,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:30:46,673 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:30:46,691 WARN L229 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_ad6cc284-1050-4163-b309-4d69eaa7c3dc/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2022-11-16 12:30:46,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:30:46,816 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:30:46,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46 WrapperNode [2022-11-16 12:30:46,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:30:46,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:30:46,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:30:46,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:30:46,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,904 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-11-16 12:30:46,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:30:46,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:30:46,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:30:46,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:30:46,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,929 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:30:46,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:30:46,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:30:46,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:30:46,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (1/1) ... [2022-11-16 12:30:46,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:30:46,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:30:46,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:30:46,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:30:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:30:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:30:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:30:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:30:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:30:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:30:47,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:30:47,022 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:30:47,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:30:47,023 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 12:30:47,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 12:30:47,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:30:47,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:30:47,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:30:47,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:30:47,026 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:30:47,207 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:30:47,209 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:30:47,645 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:30:47,973 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:30:47,978 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:30:47,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:47 BoogieIcfgContainer [2022-11-16 12:30:47,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:30:47,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:30:47,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:30:47,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:30:47,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:30:46" (1/3) ... [2022-11-16 12:30:47,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409368f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:47, skipping insertion in model container [2022-11-16 12:30:47,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:46" (2/3) ... [2022-11-16 12:30:47,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409368f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:47, skipping insertion in model container [2022-11-16 12:30:47,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:47" (3/3) ... [2022-11-16 12:30:47,993 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-11-16 12:30:48,002 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:30:48,013 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:30:48,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:30:48,014 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:30:48,125 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:30:48,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-16 12:30:48,223 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-16 12:30:48,224 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:30:48,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-16 12:30:48,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-11-16 12:30:48,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-11-16 12:30:48,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:30:48,250 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;@c3fdf81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:30:48,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 12:30:48,267 INFO L130 PetriNetUnfolder]: 0/60 cut-off events. [2022-11-16 12:30:48,267 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:30:48,268 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:48,268 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] [2022-11-16 12:30:48,269 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-16 12:30:48,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash -964341954, now seen corresponding path program 1 times [2022-11-16 12:30:48,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:48,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972643072] [2022-11-16 12:30:48,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:48,904 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-16 12:30:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972643072] [2022-11-16 12:30:48,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972643072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:48,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:48,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:30:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811209312] [2022-11-16 12:30:48,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:48,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:30:48,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:48,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:30:48,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:30:48,966 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2022-11-16 12:30:48,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-16 12:30:48,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:48,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2022-11-16 12:30:48,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:49,247 INFO L130 PetriNetUnfolder]: 80/360 cut-off events. [2022-11-16 12:30:49,248 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-16 12:30:49,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 360 events. 80/360 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1590 event pairs, 11 based on Foata normal form. 14/352 useless extension candidates. Maximal degree in co-relation 474. Up to 112 conditions per place. [2022-11-16 12:30:49,255 INFO L137 encePairwiseOnDemand]: 110/115 looper letters, 14 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-11-16 12:30:49,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 113 transitions, 270 flow [2022-11-16 12:30:49,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:30:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:30:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-11-16 12:30:49,277 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9304347826086956 [2022-11-16 12:30:49,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-11-16 12:30:49,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-11-16 12:30:49,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:49,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-11-16 12:30:49,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-16 12:30:49,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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-16 12:30:49,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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-16 12:30:49,306 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 321 transitions. [2022-11-16 12:30:49,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 113 transitions, 270 flow [2022-11-16 12:30:49,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 113 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:30:49,316 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2022-11-16 12:30:49,318 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2022-11-16 12:30:49,322 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-11-16 12:30:49,323 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2022-11-16 12:30:49,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-16 12:30:49,324 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:49,325 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] [2022-11-16 12:30:49,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:30:49,326 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-16 12:30:49,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash 438663417, now seen corresponding path program 1 times [2022-11-16 12:30:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:49,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871206738] [2022-11-16 12:30:49,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:51,014 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-16 12:30:51,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:51,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871206738] [2022-11-16 12:30:51,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871206738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:51,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:51,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:30:51,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586076742] [2022-11-16 12:30:51,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:51,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:30:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:30:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:30:51,018 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2022-11-16 12:30:51,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 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-16 12:30:51,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:51,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2022-11-16 12:30:51,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:52,036 INFO L130 PetriNetUnfolder]: 893/2466 cut-off events. [2022-11-16 12:30:52,036 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-11-16 12:30:52,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4004 conditions, 2466 events. 893/2466 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19057 event pairs, 488 based on Foata normal form. 0/2373 useless extension candidates. Maximal degree in co-relation 3943. Up to 753 conditions per place. [2022-11-16 12:30:52,058 INFO L137 encePairwiseOnDemand]: 109/115 looper letters, 34 selfloop transitions, 2 changer transitions 60/164 dead transitions. [2022-11-16 12:30:52,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 164 transitions, 526 flow [2022-11-16 12:30:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:30:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:30:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 825 transitions. [2022-11-16 12:30:52,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2022-11-16 12:30:52,064 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 825 transitions. [2022-11-16 12:30:52,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 825 transitions. [2022-11-16 12:30:52,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:52,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 825 transitions. [2022-11-16 12:30:52,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 states have internal predecessors, (825), 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-16 12:30:52,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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-16 12:30:52,074 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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-16 12:30:52,074 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 825 transitions. [2022-11-16 12:30:52,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 164 transitions, 526 flow [2022-11-16 12:30:52,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 164 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:30:52,082 INFO L231 Difference]: Finished difference. Result has 130 places, 96 transitions, 218 flow [2022-11-16 12:30:52,082 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2022-11-16 12:30:52,083 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-11-16 12:30:52,083 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 218 flow [2022-11-16 12:30:52,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 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-16 12:30:52,084 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:52,085 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] [2022-11-16 12:30:52,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:30:52,085 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-16 12:30:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash -53219208, now seen corresponding path program 1 times [2022-11-16 12:30:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:52,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512379363] [2022-11-16 12:30:52,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:53,640 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-16 12:30:53,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:53,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512379363] [2022-11-16 12:30:53,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512379363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:53,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:53,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:30:53,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460038213] [2022-11-16 12:30:53,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:53,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:30:53,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:53,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:30:53,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:30:53,644 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2022-11-16 12:30:53,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 218 flow. Second operand has 10 states, 10 states have (on average 84.1) internal successors, (841), 10 states have internal predecessors, (841), 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-16 12:30:53,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:53,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2022-11-16 12:30:53,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:55,238 INFO L130 PetriNetUnfolder]: 661/1386 cut-off events. [2022-11-16 12:30:55,238 INFO L131 PetriNetUnfolder]: For 346/346 co-relation queries the response was YES. [2022-11-16 12:30:55,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 1386 events. 661/1386 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8128 event pairs, 148 based on Foata normal form. 34/1357 useless extension candidates. Maximal degree in co-relation 2809. Up to 590 conditions per place. [2022-11-16 12:30:55,249 INFO L137 encePairwiseOnDemand]: 99/115 looper letters, 33 selfloop transitions, 13 changer transitions 63/177 dead transitions. [2022-11-16 12:30:55,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 177 transitions, 650 flow [2022-11-16 12:30:55,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:30:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 12:30:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1835 transitions. [2022-11-16 12:30:55,257 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7598343685300207 [2022-11-16 12:30:55,257 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1835 transitions. [2022-11-16 12:30:55,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1835 transitions. [2022-11-16 12:30:55,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:55,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1835 transitions. [2022-11-16 12:30:55,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 87.38095238095238) internal successors, (1835), 21 states have internal predecessors, (1835), 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-16 12:30:55,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 115.0) internal successors, (2530), 22 states have internal predecessors, (2530), 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-16 12:30:55,273 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 115.0) internal successors, (2530), 22 states have internal predecessors, (2530), 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-16 12:30:55,274 INFO L175 Difference]: Start difference. First operand has 130 places, 96 transitions, 218 flow. Second operand 21 states and 1835 transitions. [2022-11-16 12:30:55,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 177 transitions, 650 flow [2022-11-16 12:30:55,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 177 transitions, 598 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-11-16 12:30:55,297 INFO L231 Difference]: Finished difference. Result has 139 places, 103 transitions, 321 flow [2022-11-16 12:30:55,297 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=321, PETRI_PLACES=139, PETRI_TRANSITIONS=103} [2022-11-16 12:30:55,300 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 19 predicate places. [2022-11-16 12:30:55,301 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 103 transitions, 321 flow [2022-11-16 12:30:55,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 84.1) internal successors, (841), 10 states have internal predecessors, (841), 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-16 12:30:55,302 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:55,302 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-16 12:30:55,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:30:55,303 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-16 12:30:55,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash 290702904, now seen corresponding path program 1 times [2022-11-16 12:30:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:55,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29845707] [2022-11-16 12:30:55,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:55,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:56,305 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-16 12:30:56,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:56,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29845707] [2022-11-16 12:30:56,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29845707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:56,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:56,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:30:56,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744107305] [2022-11-16 12:30:56,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:56,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:30:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:56,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:30:56,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:30:56,308 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2022-11-16 12:30:56,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 103 transitions, 321 flow. Second operand has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-16 12:30:56,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:56,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2022-11-16 12:30:56,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:56,845 INFO L130 PetriNetUnfolder]: 520/1148 cut-off events. [2022-11-16 12:30:56,845 INFO L131 PetriNetUnfolder]: For 3687/4166 co-relation queries the response was YES. [2022-11-16 12:30:56,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4203 conditions, 1148 events. 520/1148 cut-off events. For 3687/4166 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6431 event pairs, 185 based on Foata normal form. 24/1099 useless extension candidates. Maximal degree in co-relation 4122. Up to 441 conditions per place. [2022-11-16 12:30:56,857 INFO L137 encePairwiseOnDemand]: 108/115 looper letters, 37 selfloop transitions, 4 changer transitions 34/143 dead transitions. [2022-11-16 12:30:56,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 143 transitions, 790 flow [2022-11-16 12:30:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:30:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:30:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 890 transitions. [2022-11-16 12:30:56,860 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7739130434782608 [2022-11-16 12:30:56,860 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 890 transitions. [2022-11-16 12:30:56,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 890 transitions. [2022-11-16 12:30:56,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:56,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 890 transitions. [2022-11-16 12:30:56,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 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-16 12:30:56,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:30:56,866 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:30:56,866 INFO L175 Difference]: Start difference. First operand has 139 places, 103 transitions, 321 flow. Second operand 10 states and 890 transitions. [2022-11-16 12:30:56,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 143 transitions, 790 flow [2022-11-16 12:30:56,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 143 transitions, 748 flow, removed 14 selfloop flow, removed 11 redundant places. [2022-11-16 12:30:56,875 INFO L231 Difference]: Finished difference. Result has 132 places, 103 transitions, 320 flow [2022-11-16 12:30:56,875 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=320, PETRI_PLACES=132, PETRI_TRANSITIONS=103} [2022-11-16 12:30:56,876 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 12 predicate places. [2022-11-16 12:30:56,876 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 103 transitions, 320 flow [2022-11-16 12:30:56,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-16 12:30:56,877 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:56,877 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] [2022-11-16 12:30:56,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:30:56,877 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-16 12:30:56,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:56,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2096975165, now seen corresponding path program 1 times [2022-11-16 12:30:56,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:56,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723072545] [2022-11-16 12:30:56,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:56,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:57,925 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-16 12:30:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:57,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723072545] [2022-11-16 12:30:57,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723072545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:57,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:57,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:30:57,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115897729] [2022-11-16 12:30:57,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:57,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:30:57,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:57,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:30:57,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:30:57,929 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 115 [2022-11-16 12:30:57,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 103 transitions, 320 flow. Second operand has 8 states, 8 states have (on average 83.0) internal successors, (664), 8 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-16 12:30:57,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:57,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 115 [2022-11-16 12:30:57,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:58,604 INFO L130 PetriNetUnfolder]: 775/1578 cut-off events. [2022-11-16 12:30:58,604 INFO L131 PetriNetUnfolder]: For 4580/8980 co-relation queries the response was YES. [2022-11-16 12:30:58,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5769 conditions, 1578 events. 775/1578 cut-off events. For 4580/8980 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8736 event pairs, 136 based on Foata normal form. 27/1503 useless extension candidates. Maximal degree in co-relation 5688. Up to 566 conditions per place. [2022-11-16 12:30:58,621 INFO L137 encePairwiseOnDemand]: 107/115 looper letters, 48 selfloop transitions, 5 changer transitions 50/169 dead transitions. [2022-11-16 12:30:58,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 169 transitions, 946 flow [2022-11-16 12:30:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:30:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:30:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 886 transitions. [2022-11-16 12:30:58,636 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7704347826086957 [2022-11-16 12:30:58,636 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 886 transitions. [2022-11-16 12:30:58,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 886 transitions. [2022-11-16 12:30:58,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:58,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 886 transitions. [2022-11-16 12:30:58,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 88.6) internal successors, (886), 10 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:58,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:30:58,646 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:30:58,646 INFO L175 Difference]: Start difference. First operand has 132 places, 103 transitions, 320 flow. Second operand 10 states and 886 transitions. [2022-11-16 12:30:58,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 169 transitions, 946 flow [2022-11-16 12:30:58,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 169 transitions, 890 flow, removed 17 selfloop flow, removed 10 redundant places. [2022-11-16 12:30:58,658 INFO L231 Difference]: Finished difference. Result has 133 places, 103 transitions, 329 flow [2022-11-16 12:30:58,659 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=329, PETRI_PLACES=133, PETRI_TRANSITIONS=103} [2022-11-16 12:30:58,659 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 13 predicate places. [2022-11-16 12:30:58,660 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 103 transitions, 329 flow [2022-11-16 12:30:58,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.0) internal successors, (664), 8 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-16 12:30:58,660 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:58,660 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-16 12:30:58,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:30:58,661 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-16 12:30:58,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:58,662 INFO L85 PathProgramCache]: Analyzing trace with hash -445192698, now seen corresponding path program 1 times [2022-11-16 12:30:58,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:58,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909085152] [2022-11-16 12:30:58,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:58,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:58,958 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-16 12:30:58,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:58,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909085152] [2022-11-16 12:30:58,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909085152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:58,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:58,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:30:58,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338437937] [2022-11-16 12:30:58,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:58,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:30:58,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:58,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:30:58,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:30:58,962 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 115 [2022-11-16 12:30:58,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 103 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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-16 12:30:58,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:58,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 115 [2022-11-16 12:30:58,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:59,746 INFO L130 PetriNetUnfolder]: 1532/2946 cut-off events. [2022-11-16 12:30:59,746 INFO L131 PetriNetUnfolder]: For 6899/6936 co-relation queries the response was YES. [2022-11-16 12:30:59,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8943 conditions, 2946 events. 1532/2946 cut-off events. For 6899/6936 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19307 event pairs, 90 based on Foata normal form. 1/2860 useless extension candidates. Maximal degree in co-relation 8870. Up to 882 conditions per place. [2022-11-16 12:30:59,771 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 82 selfloop transitions, 15 changer transitions 23/197 dead transitions. [2022-11-16 12:30:59,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 197 transitions, 1032 flow [2022-11-16 12:30:59,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:30:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:30:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 989 transitions. [2022-11-16 12:30:59,775 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.86 [2022-11-16 12:30:59,775 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 989 transitions. [2022-11-16 12:30:59,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 989 transitions. [2022-11-16 12:30:59,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:59,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 989 transitions. [2022-11-16 12:30:59,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.9) internal successors, (989), 10 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:59,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:30:59,783 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:30:59,783 INFO L175 Difference]: Start difference. First operand has 133 places, 103 transitions, 329 flow. Second operand 10 states and 989 transitions. [2022-11-16 12:30:59,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 197 transitions, 1032 flow [2022-11-16 12:30:59,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 197 transitions, 1004 flow, removed 8 selfloop flow, removed 10 redundant places. [2022-11-16 12:30:59,792 INFO L231 Difference]: Finished difference. Result has 132 places, 116 transitions, 410 flow [2022-11-16 12:30:59,793 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=410, PETRI_PLACES=132, PETRI_TRANSITIONS=116} [2022-11-16 12:30:59,793 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 12 predicate places. [2022-11-16 12:30:59,794 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 116 transitions, 410 flow [2022-11-16 12:30:59,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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-16 12:30:59,794 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:59,795 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] [2022-11-16 12:30:59,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:30:59,795 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-16 12:30:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash 17763925, now seen corresponding path program 1 times [2022-11-16 12:30:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024594789] [2022-11-16 12:30:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:00,173 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-16 12:31:00,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:31:00,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024594789] [2022-11-16 12:31:00,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024594789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:31:00,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:31:00,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:31:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403625149] [2022-11-16 12:31:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:31:00,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:31:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:31:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:31:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:31:00,185 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 115 [2022-11-16 12:31:00,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 116 transitions, 410 flow. Second operand has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 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-16 12:31:00,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:31:00,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 115 [2022-11-16 12:31:00,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:31:01,027 INFO L130 PetriNetUnfolder]: 1326/2651 cut-off events. [2022-11-16 12:31:01,027 INFO L131 PetriNetUnfolder]: For 7841/7905 co-relation queries the response was YES. [2022-11-16 12:31:01,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9616 conditions, 2651 events. 1326/2651 cut-off events. For 7841/7905 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 17923 event pairs, 65 based on Foata normal form. 71/2695 useless extension candidates. Maximal degree in co-relation 9545. Up to 751 conditions per place. [2022-11-16 12:31:01,044 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 79 selfloop transitions, 28 changer transitions 43/227 dead transitions. [2022-11-16 12:31:01,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 227 transitions, 1438 flow [2022-11-16 12:31:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:31:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:31:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1286 transitions. [2022-11-16 12:31:01,049 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8602006688963211 [2022-11-16 12:31:01,049 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1286 transitions. [2022-11-16 12:31:01,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1286 transitions. [2022-11-16 12:31:01,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:31:01,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1286 transitions. [2022-11-16 12:31:01,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.92307692307692) internal successors, (1286), 13 states have internal predecessors, (1286), 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-16 12:31:01,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 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-16 12:31:01,057 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 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-16 12:31:01,057 INFO L175 Difference]: Start difference. First operand has 132 places, 116 transitions, 410 flow. Second operand 13 states and 1286 transitions. [2022-11-16 12:31:01,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 227 transitions, 1438 flow [2022-11-16 12:31:01,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 227 transitions, 1436 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:31:01,073 INFO L231 Difference]: Finished difference. Result has 149 places, 133 transitions, 634 flow [2022-11-16 12:31:01,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=634, PETRI_PLACES=149, PETRI_TRANSITIONS=133} [2022-11-16 12:31:01,074 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 29 predicate places. [2022-11-16 12:31:01,074 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 133 transitions, 634 flow [2022-11-16 12:31:01,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 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-16 12:31:01,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:31:01,075 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] [2022-11-16 12:31:01,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:31:01,076 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-16 12:31:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:31:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash 373361452, now seen corresponding path program 1 times [2022-11-16 12:31:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:31:01,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188361257] [2022-11-16 12:31:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:31:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:31:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:01,408 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-16 12:31:01,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:31:01,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188361257] [2022-11-16 12:31:01,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188361257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:31:01,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:31:01,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:31:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180888503] [2022-11-16 12:31:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:31:01,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:31:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:31:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:31:01,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:31:01,412 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 115 [2022-11-16 12:31:01,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 133 transitions, 634 flow. Second operand has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 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-16 12:31:01,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:31:01,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 115 [2022-11-16 12:31:01,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:31:01,908 INFO L130 PetriNetUnfolder]: 299/1384 cut-off events. [2022-11-16 12:31:01,909 INFO L131 PetriNetUnfolder]: For 3503/3643 co-relation queries the response was YES. [2022-11-16 12:31:01,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4534 conditions, 1384 events. 299/1384 cut-off events. For 3503/3643 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12402 event pairs, 38 based on Foata normal form. 13/1325 useless extension candidates. Maximal degree in co-relation 4454. Up to 264 conditions per place. [2022-11-16 12:31:01,925 INFO L137 encePairwiseOnDemand]: 109/115 looper letters, 36 selfloop transitions, 2 changer transitions 14/159 dead transitions. [2022-11-16 12:31:01,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 159 transitions, 895 flow [2022-11-16 12:31:01,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:31:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 12:31:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 677 transitions. [2022-11-16 12:31:01,929 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8409937888198757 [2022-11-16 12:31:01,929 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 677 transitions. [2022-11-16 12:31:01,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 677 transitions. [2022-11-16 12:31:01,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:31:01,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 677 transitions. [2022-11-16 12:31:01,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 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-16 12:31:01,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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-16 12:31:01,936 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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-16 12:31:01,936 INFO L175 Difference]: Start difference. First operand has 149 places, 133 transitions, 634 flow. Second operand 7 states and 677 transitions. [2022-11-16 12:31:01,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 159 transitions, 895 flow [2022-11-16 12:31:01,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 159 transitions, 835 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-11-16 12:31:01,973 INFO L231 Difference]: Finished difference. Result has 156 places, 134 transitions, 593 flow [2022-11-16 12:31:01,973 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=593, PETRI_PLACES=156, PETRI_TRANSITIONS=134} [2022-11-16 12:31:01,976 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 36 predicate places. [2022-11-16 12:31:01,977 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 134 transitions, 593 flow [2022-11-16 12:31:01,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 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-16 12:31:01,977 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:31:01,978 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] [2022-11-16 12:31:01,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:31:01,978 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-16 12:31:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:31:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 100476228, now seen corresponding path program 2 times [2022-11-16 12:31:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:31:01,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060388658] [2022-11-16 12:31:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:31:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:31:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:02,397 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-16 12:31:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:31:02,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060388658] [2022-11-16 12:31:02,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060388658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:31:02,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:31:02,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:31:02,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192259583] [2022-11-16 12:31:02,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:31:02,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:31:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:31:02,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:31:02,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:31:02,401 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 115 [2022-11-16 12:31:02,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 134 transitions, 593 flow. Second operand has 8 states, 8 states have (on average 92.25) internal successors, (738), 8 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:31:02,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:31:02,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 115 [2022-11-16 12:31:02,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:31:03,432 INFO L130 PetriNetUnfolder]: 1669/3405 cut-off events. [2022-11-16 12:31:03,432 INFO L131 PetriNetUnfolder]: For 11059/11198 co-relation queries the response was YES. [2022-11-16 12:31:03,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13154 conditions, 3405 events. 1669/3405 cut-off events. For 11059/11198 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 25971 event pairs, 83 based on Foata normal form. 45/3392 useless extension candidates. Maximal degree in co-relation 13119. Up to 909 conditions per place. [2022-11-16 12:31:03,472 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 33 selfloop transitions, 22 changer transitions 93/223 dead transitions. [2022-11-16 12:31:03,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 223 transitions, 1471 flow [2022-11-16 12:31:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:31:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 12:31:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1543 transitions. [2022-11-16 12:31:03,477 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8385869565217391 [2022-11-16 12:31:03,477 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1543 transitions. [2022-11-16 12:31:03,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1543 transitions. [2022-11-16 12:31:03,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:31:03,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1543 transitions. [2022-11-16 12:31:03,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 96.4375) internal successors, (1543), 16 states have internal predecessors, (1543), 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-16 12:31:03,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 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-16 12:31:03,489 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 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-16 12:31:03,489 INFO L175 Difference]: Start difference. First operand has 156 places, 134 transitions, 593 flow. Second operand 16 states and 1543 transitions. [2022-11-16 12:31:03,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 223 transitions, 1471 flow [2022-11-16 12:31:03,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 223 transitions, 1414 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-11-16 12:31:03,550 INFO L231 Difference]: Finished difference. Result has 166 places, 116 transitions, 511 flow [2022-11-16 12:31:03,551 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=511, PETRI_PLACES=166, PETRI_TRANSITIONS=116} [2022-11-16 12:31:03,552 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 46 predicate places. [2022-11-16 12:31:03,552 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 116 transitions, 511 flow [2022-11-16 12:31:03,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.25) internal successors, (738), 8 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:31:03,553 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:31:03,553 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:31:03,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:31:03,553 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-16 12:31:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:31:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2111694256, now seen corresponding path program 1 times [2022-11-16 12:31:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:31:03,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014617381] [2022-11-16 12:31:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:31:03,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:31:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:31:03,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:31:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:31:03,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:31:03,797 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:31:03,798 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 12:31:03,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 12:31:03,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 12:31:03,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 12:31:03,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 12:31:03,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 12:31:03,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:31:03,809 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:31:03,819 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:31:03,819 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:31:03,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:31:03 BasicIcfg [2022-11-16 12:31:03,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:31:03,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:31:03,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:31:03,988 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:31:03,989 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:47" (3/4) ... [2022-11-16 12:31:03,990 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:31:04,102 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:31:04,102 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:31:04,103 INFO L158 Benchmark]: Toolchain (without parser) took 18097.70ms. Allocated memory was 127.9MB in the beginning and 429.9MB in the end (delta: 302.0MB). Free memory was 91.7MB in the beginning and 358.2MB in the end (delta: -266.5MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2022-11-16 12:31:04,103 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:31:04,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 806.53ms. Allocated memory is still 127.9MB. Free memory was 91.5MB in the beginning and 91.0MB in the end (delta: 516.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:31:04,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.39ms. Allocated memory is still 127.9MB. Free memory was 91.0MB in the beginning and 87.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:31:04,104 INFO L158 Benchmark]: Boogie Preprocessor took 29.02ms. Allocated memory is still 127.9MB. Free memory was 87.8MB in the beginning and 86.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:31:04,105 INFO L158 Benchmark]: RCFGBuilder took 1048.53ms. Allocated memory is still 127.9MB. Free memory was 86.1MB in the beginning and 94.3MB in the end (delta: -8.2MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2022-11-16 12:31:04,105 INFO L158 Benchmark]: TraceAbstraction took 16001.85ms. Allocated memory was 127.9MB in the beginning and 429.9MB in the end (delta: 302.0MB). Free memory was 94.2MB in the beginning and 381.3MB in the end (delta: -287.1MB). Peak memory consumption was 263.4MB. Max. memory is 16.1GB. [2022-11-16 12:31:04,105 INFO L158 Benchmark]: Witness Printer took 114.74ms. Allocated memory is still 429.9MB. Free memory was 381.3MB in the beginning and 358.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 12:31:04,107 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 806.53ms. Allocated memory is still 127.9MB. Free memory was 91.5MB in the beginning and 91.0MB in the end (delta: 516.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.39ms. Allocated memory is still 127.9MB. Free memory was 91.0MB in the beginning and 87.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.02ms. Allocated memory is still 127.9MB. Free memory was 87.8MB in the beginning and 86.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1048.53ms. Allocated memory is still 127.9MB. Free memory was 86.1MB in the beginning and 94.3MB in the end (delta: -8.2MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16001.85ms. Allocated memory was 127.9MB in the beginning and 429.9MB in the end (delta: 302.0MB). Free memory was 94.2MB in the beginning and 381.3MB in the end (delta: -287.1MB). Peak memory consumption was 263.4MB. Max. memory is 16.1GB. * Witness Printer took 114.74ms. Allocated memory is still 429.9MB. Free memory was 381.3MB in the beginning and 358.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L738] 0 _Bool weak$$choice0; VAL [weak$$choice0=0] [L739] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0] [L734] 0 int y$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L736] 0 int y$w_buff1; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 pthread_t t1687; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1687, ((void *)0), P0, ((void *)0))=-2, t1687={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t1688; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1687={5:0}, t1688={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1688, ((void *)0), P1, ((void *)0))=-1, t1687={5:0}, t1688={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t1689; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1689, ((void *)0), P2, ((void *)0))=0, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_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=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_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=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_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=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 838]: 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: 836]: 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, 142 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: 15.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 735 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 735 mSDsluCounter, 504 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1168 IncrementalHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 115 mSDtfsCounter, 1168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=7, InterpolantAutomatonStates: 99, 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.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 686 ConstructedInterpolants, 0 QuantifiedInterpolants, 2817 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-16 12:31:04,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6cc284-1050-4163-b309-4d69eaa7c3dc/bin/uautomizer-tPACEb0tL8/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