./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:31:23,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:31:23,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:31:24,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:31:24,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:31:24,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:31:24,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:31:24,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:31:24,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:31:24,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:31:24,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:31:24,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:31:24,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:31:24,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:31:24,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:31:24,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:31:24,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:31:24,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:31:24,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:31:24,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:31:24,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:31:24,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:31:24,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:31:24,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:31:24,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:31:24,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:31:24,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:31:24,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:31:24,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:31:24,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:31:24,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:31:24,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:31:24,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:31:24,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:31:24,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:31:24,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:31:24,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:31:24,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:31:24,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:31:24,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:31:24,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:31:24,066 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:31:24,109 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:31:24,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:31:24,113 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:31:24,113 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:31:24,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:31:24,115 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:31:24,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:31:24,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:31:24,116 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:31:24,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:31:24,118 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:31:24,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:31:24,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:31:24,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:31:24,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:31:24,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:31:24,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:31:24,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:31:24,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:31:24,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:31:24,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:31:24,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:31:24,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:31:24,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:31:24,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:31:24,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:31:24,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:31:24,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:31:24,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:31:24,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:31:24,122 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:31:24,122 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:31:24,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:31:24,123 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_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 [2022-11-18 20:31:24,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:31:24,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:31:24,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:31:24,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:31:24,500 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:31:24,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix019.opt.i [2022-11-18 20:31:24,578 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/data/6990cfb9c/892262766e954e2faa28cef8205286bf/FLAG8c2bb1872 [2022-11-18 20:31:25,092 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:31:25,092 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/sv-benchmarks/c/pthread-wmm/mix019.opt.i [2022-11-18 20:31:25,118 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/data/6990cfb9c/892262766e954e2faa28cef8205286bf/FLAG8c2bb1872 [2022-11-18 20:31:25,422 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/data/6990cfb9c/892262766e954e2faa28cef8205286bf [2022-11-18 20:31:25,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:31:25,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:31:25,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:31:25,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:31:25,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:31:25,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:31:25" (1/1) ... [2022-11-18 20:31:25,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab28827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:25, skipping insertion in model container [2022-11-18 20:31:25,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:31:25" (1/1) ... [2022-11-18 20:31:25,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:31:25,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:31:25,768 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/sv-benchmarks/c/pthread-wmm/mix019.opt.i[944,957] [2022-11-18 20:31:26,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:31:26,075 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:31:26,091 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/sv-benchmarks/c/pthread-wmm/mix019.opt.i[944,957] [2022-11-18 20:31:26,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:31:26,213 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:31:26,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26 WrapperNode [2022-11-18 20:31:26,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:31:26,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:31:26,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:31:26,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:31:26,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,288 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-11-18 20:31:26,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:31:26,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:31:26,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:31:26,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:31:26,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,312 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:31:26,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:31:26,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:31:26,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:31:26,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (1/1) ... [2022-11-18 20:31:26,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:31:26,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:31:26,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:31:26,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:31:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:31:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:31:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:31:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:31:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:31:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:31:26,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:31:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:31:26,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:31:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:31:26,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:31:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:31:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:31:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:31:26,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:31:26,407 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:31:26,626 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:31:26,636 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:31:27,018 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:31:27,265 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:31:27,265 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:31:27,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:31:27 BoogieIcfgContainer [2022-11-18 20:31:27,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:31:27,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:31:27,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:31:27,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:31:27,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:31:25" (1/3) ... [2022-11-18 20:31:27,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34df90c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:31:27, skipping insertion in model container [2022-11-18 20:31:27,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:31:26" (2/3) ... [2022-11-18 20:31:27,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34df90c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:31:27, skipping insertion in model container [2022-11-18 20:31:27,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:31:27" (3/3) ... [2022-11-18 20:31:27,282 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2022-11-18 20:31:27,291 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:31:27,303 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:31:27,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:31:27,303 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:31:27,381 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:31:27,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-18 20:31:27,526 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-18 20:31:27,526 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:31:27,532 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 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-18 20:31:27,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-11-18 20:31:27,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-11-18 20:31:27,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:31:27,564 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;@1904dde4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:31:27,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 20:31:27,593 INFO L130 PetriNetUnfolder]: 0/73 cut-off events. [2022-11-18 20:31:27,594 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:31:27,594 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:31:27,595 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] [2022-11-18 20:31:27,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:31:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash 998322262, now seen corresponding path program 1 times [2022-11-18 20:31:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:27,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338952474] [2022-11-18 20:31:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:28,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:28,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338952474] [2022-11-18 20:31:28,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338952474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:31:28,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:31:28,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:31:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304454119] [2022-11-18 20:31:28,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:31:28,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:31:28,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:31:28,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:31:28,480 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 115 [2022-11-18 20:31:28,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:28,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:31:28,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 115 [2022-11-18 20:31:28,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:31:28,578 INFO L130 PetriNetUnfolder]: 14/151 cut-off events. [2022-11-18 20:31:28,579 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-18 20:31:28,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 151 events. 14/151 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 257 event pairs, 2 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 145. Up to 25 conditions per place. [2022-11-18 20:31:28,584 INFO L137 encePairwiseOnDemand]: 110/115 looper letters, 9 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2022-11-18 20:31:28,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 110 transitions, 251 flow [2022-11-18 20:31:28,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:31:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:31:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2022-11-18 20:31:28,604 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2022-11-18 20:31:28,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2022-11-18 20:31:28,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2022-11-18 20:31:28,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:31:28,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2022-11-18 20:31:28,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:28,628 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-18 20:31:28,628 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-18 20:31:28,630 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 322 transitions. [2022-11-18 20:31:28,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 110 transitions, 251 flow [2022-11-18 20:31:28,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 110 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:31:28,638 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2022-11-18 20:31:28,640 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-18 20:31:28,643 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-11-18 20:31:28,644 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2022-11-18 20:31:28,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:28,644 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:31:28,645 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:31:28,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:31:28,645 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:31:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1256574149, now seen corresponding path program 1 times [2022-11-18 20:31:28,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:28,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131415321] [2022-11-18 20:31:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:29,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:29,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131415321] [2022-11-18 20:31:29,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131415321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:31:29,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:31:29,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:31:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475928236] [2022-11-18 20:31:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:31:29,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:31:29,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:29,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:31:29,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:31:29,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-11-18 20:31:29,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:29,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:31:29,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-11-18 20:31:29,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:31:30,134 INFO L130 PetriNetUnfolder]: 710/2092 cut-off events. [2022-11-18 20:31:30,134 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-18 20:31:30,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 2092 events. 710/2092 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16119 event pairs, 121 based on Foata normal form. 0/2028 useless extension candidates. Maximal degree in co-relation 3258. Up to 405 conditions per place. [2022-11-18 20:31:30,155 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 28 selfloop transitions, 6 changer transitions 69/178 dead transitions. [2022-11-18 20:31:30,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 178 transitions, 556 flow [2022-11-18 20:31:30,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:31:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:31:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1252 transitions. [2022-11-18 20:31:30,163 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8374581939799332 [2022-11-18 20:31:30,164 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1252 transitions. [2022-11-18 20:31:30,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1252 transitions. [2022-11-18 20:31:30,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:31:30,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1252 transitions. [2022-11-18 20:31:30,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.3076923076923) internal successors, (1252), 13 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:30,174 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-18 20:31:30,175 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-18 20:31:30,175 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 13 states and 1252 transitions. [2022-11-18 20:31:30,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 178 transitions, 556 flow [2022-11-18 20:31:30,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 178 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:31:30,182 INFO L231 Difference]: Finished difference. Result has 139 places, 100 transitions, 284 flow [2022-11-18 20:31:30,182 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=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=284, PETRI_PLACES=139, PETRI_TRANSITIONS=100} [2022-11-18 20:31:30,183 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 19 predicate places. [2022-11-18 20:31:30,184 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 100 transitions, 284 flow [2022-11-18 20:31:30,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:30,185 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:31:30,185 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-18 20:31:30,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:31:30,186 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:31:30,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2315850, now seen corresponding path program 1 times [2022-11-18 20:31:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:30,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537495677] [2022-11-18 20:31:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:30,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:30,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537495677] [2022-11-18 20:31:30,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537495677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:31:30,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:31:30,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:31:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836758316] [2022-11-18 20:31:30,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:31:30,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:31:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:30,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:31:30,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:31:30,505 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2022-11-18 20:31:30,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 100 transitions, 284 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:30,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:31:30,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2022-11-18 20:31:30,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:31:30,955 INFO L130 PetriNetUnfolder]: 383/1004 cut-off events. [2022-11-18 20:31:30,955 INFO L131 PetriNetUnfolder]: For 2235/2237 co-relation queries the response was YES. [2022-11-18 20:31:30,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3133 conditions, 1004 events. 383/1004 cut-off events. For 2235/2237 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6172 event pairs, 197 based on Foata normal form. 27/995 useless extension candidates. Maximal degree in co-relation 3068. Up to 387 conditions per place. [2022-11-18 20:31:30,966 INFO L137 encePairwiseOnDemand]: 108/115 looper letters, 25 selfloop transitions, 4 changer transitions 34/143 dead transitions. [2022-11-18 20:31:30,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 143 transitions, 672 flow [2022-11-18 20:31:30,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:31:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:31:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2022-11-18 20:31:30,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8618357487922705 [2022-11-18 20:31:30,970 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2022-11-18 20:31:30,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2022-11-18 20:31:30,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:31:30,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2022-11-18 20:31:30,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:30,975 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-18 20:31:30,976 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-18 20:31:30,976 INFO L175 Difference]: Start difference. First operand has 139 places, 100 transitions, 284 flow. Second operand 9 states and 892 transitions. [2022-11-18 20:31:30,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 143 transitions, 672 flow [2022-11-18 20:31:30,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 143 transitions, 641 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-11-18 20:31:30,988 INFO L231 Difference]: Finished difference. Result has 129 places, 103 transitions, 340 flow [2022-11-18 20:31:30,989 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=340, PETRI_PLACES=129, PETRI_TRANSITIONS=103} [2022-11-18 20:31:30,989 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 9 predicate places. [2022-11-18 20:31:30,990 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 103 transitions, 340 flow [2022-11-18 20:31:30,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:30,990 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:31:30,990 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] [2022-11-18 20:31:30,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:31:30,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:31:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash -840011563, now seen corresponding path program 1 times [2022-11-18 20:31:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:30,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896316532] [2022-11-18 20:31:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:30,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:31,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896316532] [2022-11-18 20:31:31,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896316532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:31:31,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:31:31,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:31:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894705783] [2022-11-18 20:31:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:31:31,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:31:31,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:31,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:31:31,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:31:31,331 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-11-18 20:31:31,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 103 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:31,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:31:31,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-11-18 20:31:31,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:31:32,236 INFO L130 PetriNetUnfolder]: 1270/2666 cut-off events. [2022-11-18 20:31:32,236 INFO L131 PetriNetUnfolder]: For 3706/4813 co-relation queries the response was YES. [2022-11-18 20:31:32,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6891 conditions, 2666 events. 1270/2666 cut-off events. For 3706/4813 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 19142 event pairs, 115 based on Foata normal form. 16/2526 useless extension candidates. Maximal degree in co-relation 6821. Up to 760 conditions per place. [2022-11-18 20:31:32,256 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 50 selfloop transitions, 13 changer transitions 24/170 dead transitions. [2022-11-18 20:31:32,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 170 transitions, 757 flow [2022-11-18 20:31:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:31:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:31:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1001 transitions. [2022-11-18 20:31:32,260 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704347826086957 [2022-11-18 20:31:32,260 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1001 transitions. [2022-11-18 20:31:32,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1001 transitions. [2022-11-18 20:31:32,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:31:32,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1001 transitions. [2022-11-18 20:31:32,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.1) internal successors, (1001), 10 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:32,270 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-18 20:31:32,270 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-18 20:31:32,270 INFO L175 Difference]: Start difference. First operand has 129 places, 103 transitions, 340 flow. Second operand 10 states and 1001 transitions. [2022-11-18 20:31:32,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 170 transitions, 757 flow [2022-11-18 20:31:32,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 170 transitions, 735 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-11-18 20:31:32,284 INFO L231 Difference]: Finished difference. Result has 131 places, 114 transitions, 416 flow [2022-11-18 20:31:32,285 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=318, 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=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=416, PETRI_PLACES=131, PETRI_TRANSITIONS=114} [2022-11-18 20:31:32,286 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 11 predicate places. [2022-11-18 20:31:32,291 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 114 transitions, 416 flow [2022-11-18 20:31:32,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:32,293 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:31:32,293 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] [2022-11-18 20:31:32,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:31:32,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:31:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1307397048, now seen corresponding path program 1 times [2022-11-18 20:31:32,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:32,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452566559] [2022-11-18 20:31:32,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:32,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:32,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:32,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452566559] [2022-11-18 20:31:32,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452566559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:31:32,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:31:32,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:31:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685394069] [2022-11-18 20:31:32,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:31:32,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:31:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:31:32,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:31:32,641 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2022-11-18 20:31:32,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 114 transitions, 416 flow. Second operand has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:32,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:31:32,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2022-11-18 20:31:32,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:31:33,275 INFO L130 PetriNetUnfolder]: 423/1768 cut-off events. [2022-11-18 20:31:33,275 INFO L131 PetriNetUnfolder]: For 3531/3716 co-relation queries the response was YES. [2022-11-18 20:31:33,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5075 conditions, 1768 events. 423/1768 cut-off events. For 3531/3716 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15185 event pairs, 166 based on Foata normal form. 38/1693 useless extension candidates. Maximal degree in co-relation 5003. Up to 301 conditions per place. [2022-11-18 20:31:33,293 INFO L137 encePairwiseOnDemand]: 109/115 looper letters, 36 selfloop transitions, 14 changer transitions 6/147 dead transitions. [2022-11-18 20:31:33,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 147 transitions, 739 flow [2022-11-18 20:31:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:31:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:31:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-11-18 20:31:33,298 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8599033816425121 [2022-11-18 20:31:33,298 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2022-11-18 20:31:33,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2022-11-18 20:31:33,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:31:33,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2022-11-18 20:31:33,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 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-18 20:31:33,304 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-18 20:31:33,305 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-18 20:31:33,305 INFO L175 Difference]: Start difference. First operand has 131 places, 114 transitions, 416 flow. Second operand 9 states and 890 transitions. [2022-11-18 20:31:33,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 147 transitions, 739 flow [2022-11-18 20:31:33,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 147 transitions, 729 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-18 20:31:33,319 INFO L231 Difference]: Finished difference. Result has 145 places, 122 transitions, 556 flow [2022-11-18 20:31:33,320 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=556, PETRI_PLACES=145, PETRI_TRANSITIONS=122} [2022-11-18 20:31:33,323 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 25 predicate places. [2022-11-18 20:31:33,323 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 122 transitions, 556 flow [2022-11-18 20:31:33,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:33,324 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:31:33,324 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] [2022-11-18 20:31:33,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:31:33,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:31:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash 155887496, now seen corresponding path program 1 times [2022-11-18 20:31:33,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:33,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240168036] [2022-11-18 20:31:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:33,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:33,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240168036] [2022-11-18 20:31:33,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240168036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:31:33,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:31:33,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:31:33,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712586412] [2022-11-18 20:31:33,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:31:33,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:31:33,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:33,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:31:33,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:31:33,701 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-11-18 20:31:33,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 122 transitions, 556 flow. Second operand has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:33,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:31:33,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-11-18 20:31:33,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:31:34,855 INFO L130 PetriNetUnfolder]: 1519/3382 cut-off events. [2022-11-18 20:31:34,855 INFO L131 PetriNetUnfolder]: For 8539/9721 co-relation queries the response was YES. [2022-11-18 20:31:34,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11551 conditions, 3382 events. 1519/3382 cut-off events. For 8539/9721 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 27292 event pairs, 94 based on Foata normal form. 119/3380 useless extension candidates. Maximal degree in co-relation 11472. Up to 777 conditions per place. [2022-11-18 20:31:34,878 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 43 selfloop transitions, 18 changer transitions 66/210 dead transitions. [2022-11-18 20:31:34,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 210 transitions, 1280 flow [2022-11-18 20:31:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:31:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:31:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1300 transitions. [2022-11-18 20:31:34,882 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2022-11-18 20:31:34,882 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1300 transitions. [2022-11-18 20:31:34,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1300 transitions. [2022-11-18 20:31:34,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:31:34,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1300 transitions. [2022-11-18 20:31:34,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.0) internal successors, (1300), 13 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:34,890 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-18 20:31:34,891 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-18 20:31:34,892 INFO L175 Difference]: Start difference. First operand has 145 places, 122 transitions, 556 flow. Second operand 13 states and 1300 transitions. [2022-11-18 20:31:34,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 210 transitions, 1280 flow [2022-11-18 20:31:34,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 210 transitions, 1244 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-11-18 20:31:34,930 INFO L231 Difference]: Finished difference. Result has 162 places, 121 transitions, 579 flow [2022-11-18 20:31:34,930 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=579, PETRI_PLACES=162, PETRI_TRANSITIONS=121} [2022-11-18 20:31:34,931 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 42 predicate places. [2022-11-18 20:31:34,931 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 121 transitions, 579 flow [2022-11-18 20:31:34,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:34,932 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:31:34,932 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:31:34,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:31:34,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:31:34,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1466556337, now seen corresponding path program 1 times [2022-11-18 20:31:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:34,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192295334] [2022-11-18 20:31:34,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:34,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:35,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:35,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192295334] [2022-11-18 20:31:35,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192295334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:31:35,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:31:35,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:31:35,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414718763] [2022-11-18 20:31:35,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:31:35,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:31:35,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:31:35,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:31:35,363 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-11-18 20:31:35,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 121 transitions, 579 flow. Second operand has 8 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:35,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:31:35,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-11-18 20:31:35,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:31:36,116 INFO L130 PetriNetUnfolder]: 693/1945 cut-off events. [2022-11-18 20:31:36,116 INFO L131 PetriNetUnfolder]: For 7146/7659 co-relation queries the response was YES. [2022-11-18 20:31:36,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 1945 events. 693/1945 cut-off events. For 7146/7659 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16137 event pairs, 81 based on Foata normal form. 61/1941 useless extension candidates. Maximal degree in co-relation 7420. Up to 421 conditions per place. [2022-11-18 20:31:36,130 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 37 selfloop transitions, 22 changer transitions 29/168 dead transitions. [2022-11-18 20:31:36,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 168 transitions, 1027 flow [2022-11-18 20:31:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:31:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-18 20:31:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1367 transitions. [2022-11-18 20:31:36,135 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8490683229813665 [2022-11-18 20:31:36,135 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1367 transitions. [2022-11-18 20:31:36,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1367 transitions. [2022-11-18 20:31:36,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:31:36,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1367 transitions. [2022-11-18 20:31:36,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 97.64285714285714) internal successors, (1367), 14 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:36,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:36,145 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:36,145 INFO L175 Difference]: Start difference. First operand has 162 places, 121 transitions, 579 flow. Second operand 14 states and 1367 transitions. [2022-11-18 20:31:36,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 168 transitions, 1027 flow [2022-11-18 20:31:36,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 168 transitions, 881 flow, removed 61 selfloop flow, removed 15 redundant places. [2022-11-18 20:31:36,199 INFO L231 Difference]: Finished difference. Result has 155 places, 119 transitions, 521 flow [2022-11-18 20:31:36,199 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=521, PETRI_PLACES=155, PETRI_TRANSITIONS=119} [2022-11-18 20:31:36,200 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 35 predicate places. [2022-11-18 20:31:36,201 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 119 transitions, 521 flow [2022-11-18 20:31:36,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:36,201 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:31:36,202 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:31:36,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:31:36,202 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:31:36,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash 467536355, now seen corresponding path program 1 times [2022-11-18 20:31:36,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:36,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128706241] [2022-11-18 20:31:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:36,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:36,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128706241] [2022-11-18 20:31:36,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128706241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:31:36,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:31:36,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:31:36,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010199727] [2022-11-18 20:31:36,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:31:36,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:31:36,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:36,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:31:36,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:31:36,574 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2022-11-18 20:31:36,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 119 transitions, 521 flow. Second operand has 8 states, 8 states have (on average 89.875) internal successors, (719), 8 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:36,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:31:36,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2022-11-18 20:31:36,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:31:36,893 INFO L130 PetriNetUnfolder]: 104/701 cut-off events. [2022-11-18 20:31:36,893 INFO L131 PetriNetUnfolder]: For 1436/1472 co-relation queries the response was YES. [2022-11-18 20:31:36,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 701 events. 104/701 cut-off events. For 1436/1472 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5267 event pairs, 5 based on Foata normal form. 1/672 useless extension candidates. Maximal degree in co-relation 1955. Up to 93 conditions per place. [2022-11-18 20:31:36,898 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 20 selfloop transitions, 5 changer transitions 25/141 dead transitions. [2022-11-18 20:31:36,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 141 transitions, 725 flow [2022-11-18 20:31:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:31:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:31:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 830 transitions. [2022-11-18 20:31:36,901 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8019323671497585 [2022-11-18 20:31:36,901 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 830 transitions. [2022-11-18 20:31:36,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 830 transitions. [2022-11-18 20:31:36,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:31:36,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 830 transitions. [2022-11-18 20:31:36,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.22222222222223) internal successors, (830), 9 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:36,906 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-18 20:31:36,907 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-18 20:31:36,907 INFO L175 Difference]: Start difference. First operand has 155 places, 119 transitions, 521 flow. Second operand 9 states and 830 transitions. [2022-11-18 20:31:36,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 141 transitions, 725 flow [2022-11-18 20:31:36,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 141 transitions, 593 flow, removed 38 selfloop flow, removed 19 redundant places. [2022-11-18 20:31:36,926 INFO L231 Difference]: Finished difference. Result has 146 places, 114 transitions, 417 flow [2022-11-18 20:31:36,927 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=417, PETRI_PLACES=146, PETRI_TRANSITIONS=114} [2022-11-18 20:31:36,929 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 26 predicate places. [2022-11-18 20:31:36,929 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 114 transitions, 417 flow [2022-11-18 20:31:36,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.875) internal successors, (719), 8 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:36,930 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:31:36,930 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:31:36,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:31:36,931 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:31:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1130484343, now seen corresponding path program 2 times [2022-11-18 20:31:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:36,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856421858] [2022-11-18 20:31:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:38,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:38,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856421858] [2022-11-18 20:31:38,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856421858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:31:38,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:31:38,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 20:31:38,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009572595] [2022-11-18 20:31:38,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:31:38,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:31:38,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:38,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:31:38,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:31:38,973 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 115 [2022-11-18 20:31:38,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 114 transitions, 417 flow. Second operand has 13 states, 13 states have (on average 87.84615384615384) internal successors, (1142), 13 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:38,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:31:38,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 115 [2022-11-18 20:31:38,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:31:39,354 INFO L130 PetriNetUnfolder]: 43/391 cut-off events. [2022-11-18 20:31:39,354 INFO L131 PetriNetUnfolder]: For 380/383 co-relation queries the response was YES. [2022-11-18 20:31:39,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 391 events. 43/391 cut-off events. For 380/383 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2420 event pairs, 0 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 907. Up to 54 conditions per place. [2022-11-18 20:31:39,356 INFO L137 encePairwiseOnDemand]: 101/115 looper letters, 15 selfloop transitions, 9 changer transitions 19/120 dead transitions. [2022-11-18 20:31:39,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 120 transitions, 497 flow [2022-11-18 20:31:39,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:31:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 20:31:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1321 transitions. [2022-11-18 20:31:39,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7657971014492754 [2022-11-18 20:31:39,360 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1321 transitions. [2022-11-18 20:31:39,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1321 transitions. [2022-11-18 20:31:39,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:31:39,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1321 transitions. [2022-11-18 20:31:39,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 88.06666666666666) internal successors, (1321), 15 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:39,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 115.0) internal successors, (1840), 16 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:39,369 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 115.0) internal successors, (1840), 16 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:39,370 INFO L175 Difference]: Start difference. First operand has 146 places, 114 transitions, 417 flow. Second operand 15 states and 1321 transitions. [2022-11-18 20:31:39,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 120 transitions, 497 flow [2022-11-18 20:31:39,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 120 transitions, 462 flow, removed 9 selfloop flow, removed 10 redundant places. [2022-11-18 20:31:39,375 INFO L231 Difference]: Finished difference. Result has 151 places, 101 transitions, 324 flow [2022-11-18 20:31:39,375 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=324, PETRI_PLACES=151, PETRI_TRANSITIONS=101} [2022-11-18 20:31:39,376 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 31 predicate places. [2022-11-18 20:31:39,376 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 101 transitions, 324 flow [2022-11-18 20:31:39,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.84615384615384) internal successors, (1142), 13 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:31:39,377 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:31:39,377 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:31:39,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:31:39,378 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:31:39,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1383781845, now seen corresponding path program 3 times [2022-11-18 20:31:39,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:39,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516150967] [2022-11-18 20:31:39,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:39,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:31:39,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:31:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:31:39,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:31:39,568 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:31:39,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-18 20:31:39,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-18 20:31:39,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-18 20:31:39,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-18 20:31:39,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-18 20:31:39,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-18 20:31:39,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:31:39,576 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:31:39,583 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:31:39,583 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:31:39,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:31:39 BasicIcfg [2022-11-18 20:31:39,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:31:39,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:31:39,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:31:39,698 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:31:39,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:31:27" (3/4) ... [2022-11-18 20:31:39,700 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:31:39,825 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:31:39,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:31:39,826 INFO L158 Benchmark]: Toolchain (without parser) took 14396.86ms. Allocated memory was 107.0MB in the beginning and 522.2MB in the end (delta: 415.2MB). Free memory was 65.7MB in the beginning and 191.2MB in the end (delta: -125.5MB). Peak memory consumption was 288.3MB. Max. memory is 16.1GB. [2022-11-18 20:31:39,827 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 107.0MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:31:39,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 782.99ms. Allocated memory is still 107.0MB. Free memory was 65.5MB in the beginning and 67.5MB in the end (delta: -2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:31:39,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.56ms. Allocated memory is still 107.0MB. Free memory was 67.5MB in the beginning and 65.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:31:39,828 INFO L158 Benchmark]: Boogie Preprocessor took 28.09ms. Allocated memory is still 107.0MB. Free memory was 65.0MB in the beginning and 62.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:31:39,828 INFO L158 Benchmark]: RCFGBuilder took 950.69ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 62.9MB in the beginning and 105.4MB in the end (delta: -42.5MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-11-18 20:31:39,829 INFO L158 Benchmark]: TraceAbstraction took 12423.91ms. Allocated memory was 146.8MB in the beginning and 522.2MB in the end (delta: 375.4MB). Free memory was 104.6MB in the beginning and 214.3MB in the end (delta: -109.7MB). Peak memory consumption was 267.4MB. Max. memory is 16.1GB. [2022-11-18 20:31:39,829 INFO L158 Benchmark]: Witness Printer took 128.16ms. Allocated memory is still 522.2MB. Free memory was 214.3MB in the beginning and 191.2MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-18 20:31:39,832 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.27ms. Allocated memory is still 107.0MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 782.99ms. Allocated memory is still 107.0MB. Free memory was 65.5MB in the beginning and 67.5MB in the end (delta: -2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.56ms. Allocated memory is still 107.0MB. Free memory was 67.5MB in the beginning and 65.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.09ms. Allocated memory is still 107.0MB. Free memory was 65.0MB in the beginning and 62.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 950.69ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 62.9MB in the beginning and 105.4MB in the end (delta: -42.5MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12423.91ms. Allocated memory was 146.8MB in the beginning and 522.2MB in the end (delta: 375.4MB). Free memory was 104.6MB in the beginning and 214.3MB in the end (delta: -109.7MB). Peak memory consumption was 267.4MB. Max. memory is 16.1GB. * Witness Printer took 128.16ms. Allocated memory is still 522.2MB. Free memory was 214.3MB in the beginning and 191.2MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0] [L734] 0 int y$w_buff0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p2_EBX=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_p2_EBX=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_p2_EBX=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] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=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_p1_EAX=0, __unbuffered_p2_EBX=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_p1_EAX=0, __unbuffered_p2_EBX=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_p1_EAX=0, __unbuffered_p2_EBX=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] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t500; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500, ((void *)0), P0, ((void *)0))=-2, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t501; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501, ((void *)0), P1, ((void *)0))=-1, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t502; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502, ((void *)0), P2, ((void *)0))=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 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) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 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) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 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 [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 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) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 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 [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 844]: 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: 842]: 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, 141 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: 12.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 516 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 516 mSDsluCounter, 463 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 372 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1030 IncrementalHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 91 mSDtfsCounter, 1030 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=579occurred in iteration=6, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 809 NumberOfCodeBlocks, 809 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 711 ConstructedInterpolants, 0 QuantifiedInterpolants, 3180 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-18 20:31:39,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52957257-027e-4ff5-8445-eb4acc7f7f02/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE