./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa --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 e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:48:13,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:48:13,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:48:13,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:48:13,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:48:13,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:48:13,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:48:13,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:48:13,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:48:13,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:48:13,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:48:13,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:48:13,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:48:13,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:48:13,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:48:13,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:48:13,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:48:13,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:48:13,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:48:13,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:48:13,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:48:13,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:48:13,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:48:13,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:48:13,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:48:13,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:48:13,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:48:13,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:48:13,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:48:13,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:48:13,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:48:13,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:48:13,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:48:13,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:48:13,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:48:13,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:48:13,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:48:13,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:48:13,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:48:13,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:48:13,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:48:13,563 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 22:48:13,585 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:48:13,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:48:13,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:48:13,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:48:13,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:48:13,587 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:48:13,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:48:13,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:48:13,588 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:48:13,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:48:13,588 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:48:13,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:48:13,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:48:13,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:48:13,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 22:48:13,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:48:13,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 22:48:13,589 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:48:13,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 22:48:13,590 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:48:13,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 22:48:13,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:48:13,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:48:13,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:48:13,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:48:13,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:48:13,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:48:13,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 22:48:13,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:48:13,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 22:48:13,592 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 22:48:13,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 22:48:13,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 22:48:13,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:48:13,592 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_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/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_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa 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 -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 [2021-12-06 22:48:13,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:48:13,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:48:13,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:48:13,794 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:48:13,794 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:48:13,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-06 22:48:13,841 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/data/8c70467dd/115f92eb100d4574ab0e89860e425acd/FLAG255e9a458 [2021-12-06 22:48:14,255 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:48:14,255 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-06 22:48:14,265 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/data/8c70467dd/115f92eb100d4574ab0e89860e425acd/FLAG255e9a458 [2021-12-06 22:48:14,612 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/data/8c70467dd/115f92eb100d4574ab0e89860e425acd [2021-12-06 22:48:14,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:48:14,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:48:14,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:48:14,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:48:14,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:48:14,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:14,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a64abe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14, skipping insertion in model container [2021-12-06 22:48:14,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:14,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:48:14,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:48:14,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2021-12-06 22:48:14,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:48:14,890 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:48:14,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2021-12-06 22:48:14,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:48:14,961 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:48:14,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14 WrapperNode [2021-12-06 22:48:14,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:48:14,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:48:14,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:48:14,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:48:14,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:14,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:15,005 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2021-12-06 22:48:15,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:48:15,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:48:15,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:48:15,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:48:15,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:15,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:15,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:15,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:15,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:15,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:15,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:15,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:48:15,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:48:15,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:48:15,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:48:15,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (1/1) ... [2021-12-06 22:48:15,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:48:15,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:48:15,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 22:48:15,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 22:48:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 22:48:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 22:48:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:48:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 22:48:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 22:48:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 22:48:15,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 22:48:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 22:48:15,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 22:48:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-06 22:48:15,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-06 22:48:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 22:48:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 22:48:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:48:15,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:48:15,094 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 22:48:15,183 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:48:15,184 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:48:15,512 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:48:15,694 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:48:15,694 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 22:48:15,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:48:15 BoogieIcfgContainer [2021-12-06 22:48:15,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:48:15,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 22:48:15,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 22:48:15,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 22:48:15,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 10:48:14" (1/3) ... [2021-12-06 22:48:15,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a973204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:48:15, skipping insertion in model container [2021-12-06 22:48:15,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:48:14" (2/3) ... [2021-12-06 22:48:15,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a973204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:48:15, skipping insertion in model container [2021-12-06 22:48:15,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:48:15" (3/3) ... [2021-12-06 22:48:15,701 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-06 22:48:15,705 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 22:48:15,705 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 22:48:15,705 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 22:48:15,706 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 22:48:15,735 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,739 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,739 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,739 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,739 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,739 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,739 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,740 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,740 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,740 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,740 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,740 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,740 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,740 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,741 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,741 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,741 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,741 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,742 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,742 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,743 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,743 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,745 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,745 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,745 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,745 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,745 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,746 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,746 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,746 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,746 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,746 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,746 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,747 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,747 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,747 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,747 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,747 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,747 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,753 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,753 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,754 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,754 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,754 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,754 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,754 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,754 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,755 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,755 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,758 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,758 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,758 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,758 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,759 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,759 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,759 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,759 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,759 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,759 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:48:15,760 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 22:48:15,806 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 22:48:15,812 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 22:48:15,812 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-06 22:48:15,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2021-12-06 22:48:15,868 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-12-06 22:48:15,869 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 22:48:15,873 INFO L84 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 73. Up to 2 conditions per place. [2021-12-06 22:48:15,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2021-12-06 22:48:15,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2021-12-06 22:48:15,885 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2021-12-06 22:48:15,885 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 22:48:15,885 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:15,886 INFO L254 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] [2021-12-06 22:48:15,886 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash 368334670, now seen corresponding path program 1 times [2021-12-06 22:48:15,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:15,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954398487] [2021-12-06 22:48:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:15,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:16,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:16,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954398487] [2021-12-06 22:48:16,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954398487] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:16,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:16,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:48:16,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734814873] [2021-12-06 22:48:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:16,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:48:16,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:16,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:48:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:48:16,133 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2021-12-06 22:48:16,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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) [2021-12-06 22:48:16,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:16,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2021-12-06 22:48:16,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:16,266 INFO L129 PetriNetUnfolder]: 58/327 cut-off events. [2021-12-06 22:48:16,266 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-06 22:48:16,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 327 events. 58/327 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1349 event pairs, 10 based on Foata normal form. 12/322 useless extension candidates. Maximal degree in co-relation 404. Up to 79 conditions per place. [2021-12-06 22:48:16,270 INFO L132 encePairwiseOnDemand]: 110/115 looper letters, 14 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2021-12-06 22:48:16,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 114 transitions, 275 flow [2021-12-06 22:48:16,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:48:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:48:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2021-12-06 22:48:16,285 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9391304347826087 [2021-12-06 22:48:16,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2021-12-06 22:48:16,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2021-12-06 22:48:16,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:16,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2021-12-06 22:48:16,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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) [2021-12-06 22:48:16,300 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) [2021-12-06 22:48:16,300 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) [2021-12-06 22:48:16,302 INFO L186 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 324 transitions. [2021-12-06 22:48:16,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 114 transitions, 275 flow [2021-12-06 22:48:16,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-06 22:48:16,308 INFO L242 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2021-12-06 22:48:16,309 INFO L317 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} [2021-12-06 22:48:16,313 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2021-12-06 22:48:16,313 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2021-12-06 22:48:16,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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) [2021-12-06 22:48:16,313 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:16,314 INFO L254 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] [2021-12-06 22:48:16,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 22:48:16,314 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:16,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:16,314 INFO L85 PathProgramCache]: Analyzing trace with hash 916552258, now seen corresponding path program 1 times [2021-12-06 22:48:16,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:16,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340136623] [2021-12-06 22:48:16,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:16,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:16,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:16,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340136623] [2021-12-06 22:48:16,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340136623] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:16,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:16,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:48:16,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298527951] [2021-12-06 22:48:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:16,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:48:16,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:16,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:48:16,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:48:16,573 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2021-12-06 22:48:16,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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) [2021-12-06 22:48:16,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:16,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2021-12-06 22:48:16,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:16,922 INFO L129 PetriNetUnfolder]: 331/1074 cut-off events. [2021-12-06 22:48:16,922 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2021-12-06 22:48:16,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 1074 events. 331/1074 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7187 event pairs, 60 based on Foata normal form. 0/1041 useless extension candidates. Maximal degree in co-relation 1655. Up to 257 conditions per place. [2021-12-06 22:48:16,929 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 18 selfloop transitions, 2 changer transitions 45/145 dead transitions. [2021-12-06 22:48:16,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 422 flow [2021-12-06 22:48:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:48:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:48:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 902 transitions. [2021-12-06 22:48:16,935 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8714975845410629 [2021-12-06 22:48:16,935 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 902 transitions. [2021-12-06 22:48:16,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 902 transitions. [2021-12-06 22:48:16,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:16,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 902 transitions. [2021-12-06 22:48:16,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.22222222222223) internal successors, (902), 9 states have internal predecessors, (902), 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) [2021-12-06 22:48:16,942 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) [2021-12-06 22:48:16,943 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) [2021-12-06 22:48:16,943 INFO L186 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 902 transitions. [2021-12-06 22:48:16,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 422 flow [2021-12-06 22:48:16,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 145 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 22:48:16,947 INFO L242 Difference]: Finished difference. Result has 130 places, 96 transitions, 218 flow [2021-12-06 22:48:16,947 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2021-12-06 22:48:16,948 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2021-12-06 22:48:16,948 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 218 flow [2021-12-06 22:48:16,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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) [2021-12-06 22:48:16,949 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:16,949 INFO L254 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] [2021-12-06 22:48:16,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 22:48:16,949 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:16,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:16,950 INFO L85 PathProgramCache]: Analyzing trace with hash -950691551, now seen corresponding path program 1 times [2021-12-06 22:48:16,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:16,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072508003] [2021-12-06 22:48:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:16,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:17,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:17,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072508003] [2021-12-06 22:48:17,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072508003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:17,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:17,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:48:17,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555850899] [2021-12-06 22:48:17,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:17,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:48:17,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:17,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:48:17,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:48:17,075 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2021-12-06 22:48:17,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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) [2021-12-06 22:48:17,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:17,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2021-12-06 22:48:17,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:17,370 INFO L129 PetriNetUnfolder]: 283/723 cut-off events. [2021-12-06 22:48:17,370 INFO L130 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2021-12-06 22:48:17,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 723 events. 283/723 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3753 event pairs, 91 based on Foata normal form. 18/711 useless extension candidates. Maximal degree in co-relation 1336. Up to 241 conditions per place. [2021-12-06 22:48:17,375 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 19 selfloop transitions, 2 changer transitions 31/132 dead transitions. [2021-12-06 22:48:17,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 132 transitions, 414 flow [2021-12-06 22:48:17,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:48:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:48:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 900 transitions. [2021-12-06 22:48:17,378 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2021-12-06 22:48:17,378 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 900 transitions. [2021-12-06 22:48:17,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 900 transitions. [2021-12-06 22:48:17,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:17,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 900 transitions. [2021-12-06 22:48:17,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.0) internal successors, (900), 9 states have internal predecessors, (900), 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) [2021-12-06 22:48:17,384 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) [2021-12-06 22:48:17,385 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) [2021-12-06 22:48:17,385 INFO L186 Difference]: Start difference. First operand has 130 places, 96 transitions, 218 flow. Second operand 9 states and 900 transitions. [2021-12-06 22:48:17,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 132 transitions, 414 flow [2021-12-06 22:48:17,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 132 transitions, 382 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-06 22:48:17,391 INFO L242 Difference]: Finished difference. Result has 119 places, 96 transitions, 222 flow [2021-12-06 22:48:17,391 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=119, PETRI_TRANSITIONS=96} [2021-12-06 22:48:17,392 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -1 predicate places. [2021-12-06 22:48:17,392 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 96 transitions, 222 flow [2021-12-06 22:48:17,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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) [2021-12-06 22:48:17,392 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:17,393 INFO L254 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] [2021-12-06 22:48:17,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 22:48:17,393 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:17,393 INFO L85 PathProgramCache]: Analyzing trace with hash 595503234, now seen corresponding path program 1 times [2021-12-06 22:48:17,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:17,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656753063] [2021-12-06 22:48:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:17,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:17,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:17,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656753063] [2021-12-06 22:48:17,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656753063] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:17,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:17,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:48:17,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957601793] [2021-12-06 22:48:17,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:17,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:48:17,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:17,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:48:17,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:48:17,502 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2021-12-06 22:48:17,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 96 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:48:17,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:17,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2021-12-06 22:48:17,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:17,822 INFO L129 PetriNetUnfolder]: 281/778 cut-off events. [2021-12-06 22:48:17,823 INFO L130 PetriNetUnfolder]: For 197/197 co-relation queries the response was YES. [2021-12-06 22:48:17,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 778 events. 281/778 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4374 event pairs, 76 based on Foata normal form. 16/746 useless extension candidates. Maximal degree in co-relation 1448. Up to 151 conditions per place. [2021-12-06 22:48:17,827 INFO L132 encePairwiseOnDemand]: 107/115 looper letters, 22 selfloop transitions, 4 changer transitions 32/136 dead transitions. [2021-12-06 22:48:17,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 136 transitions, 451 flow [2021-12-06 22:48:17,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 22:48:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 22:48:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 980 transitions. [2021-12-06 22:48:17,831 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8521739130434782 [2021-12-06 22:48:17,831 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 980 transitions. [2021-12-06 22:48:17,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 980 transitions. [2021-12-06 22:48:17,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:17,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 980 transitions. [2021-12-06 22:48:17,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 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) [2021-12-06 22:48:17,836 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) [2021-12-06 22:48:17,837 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) [2021-12-06 22:48:17,837 INFO L186 Difference]: Start difference. First operand has 119 places, 96 transitions, 222 flow. Second operand 10 states and 980 transitions. [2021-12-06 22:48:17,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 136 transitions, 451 flow [2021-12-06 22:48:17,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 136 transitions, 417 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-06 22:48:17,842 INFO L242 Difference]: Finished difference. Result has 122 places, 96 transitions, 236 flow [2021-12-06 22:48:17,842 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=96} [2021-12-06 22:48:17,843 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 2 predicate places. [2021-12-06 22:48:17,843 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 96 transitions, 236 flow [2021-12-06 22:48:17,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:48:17,844 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:17,844 INFO L254 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] [2021-12-06 22:48:17,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 22:48:17,844 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:17,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash 159180846, now seen corresponding path program 1 times [2021-12-06 22:48:17,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:17,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654156459] [2021-12-06 22:48:17,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:17,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:18,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:18,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654156459] [2021-12-06 22:48:18,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654156459] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:18,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:18,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 22:48:18,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491536746] [2021-12-06 22:48:18,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:18,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:48:18,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:18,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:48:18,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:48:18,028 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 115 [2021-12-06 22:48:18,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 96 transitions, 236 flow. Second operand has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 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) [2021-12-06 22:48:18,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:18,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 115 [2021-12-06 22:48:18,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:18,432 INFO L129 PetriNetUnfolder]: 220/602 cut-off events. [2021-12-06 22:48:18,433 INFO L130 PetriNetUnfolder]: For 240/243 co-relation queries the response was YES. [2021-12-06 22:48:18,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 602 events. 220/602 cut-off events. For 240/243 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2770 event pairs, 60 based on Foata normal form. 12/600 useless extension candidates. Maximal degree in co-relation 1146. Up to 241 conditions per place. [2021-12-06 22:48:18,436 INFO L132 encePairwiseOnDemand]: 102/115 looper letters, 23 selfloop transitions, 12 changer transitions 41/152 dead transitions. [2021-12-06 22:48:18,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 152 transitions, 548 flow [2021-12-06 22:48:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 22:48:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 22:48:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1519 transitions. [2021-12-06 22:48:18,442 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8255434782608696 [2021-12-06 22:48:18,443 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1519 transitions. [2021-12-06 22:48:18,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1519 transitions. [2021-12-06 22:48:18,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:18,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1519 transitions. [2021-12-06 22:48:18,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 94.9375) internal successors, (1519), 16 states have internal predecessors, (1519), 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) [2021-12-06 22:48:18,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:48:18,455 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:48:18,455 INFO L186 Difference]: Start difference. First operand has 122 places, 96 transitions, 236 flow. Second operand 16 states and 1519 transitions. [2021-12-06 22:48:18,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 152 transitions, 548 flow [2021-12-06 22:48:18,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 152 transitions, 490 flow, removed 24 selfloop flow, removed 10 redundant places. [2021-12-06 22:48:18,462 INFO L242 Difference]: Finished difference. Result has 133 places, 105 transitions, 304 flow [2021-12-06 22:48:18,462 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=304, PETRI_PLACES=133, PETRI_TRANSITIONS=105} [2021-12-06 22:48:18,463 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 13 predicate places. [2021-12-06 22:48:18,463 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 105 transitions, 304 flow [2021-12-06 22:48:18,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 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) [2021-12-06 22:48:18,464 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:18,464 INFO L254 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] [2021-12-06 22:48:18,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 22:48:18,464 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash -867840908, now seen corresponding path program 2 times [2021-12-06 22:48:18,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:18,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581739566] [2021-12-06 22:48:18,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:18,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:18,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:18,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581739566] [2021-12-06 22:48:18,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581739566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:18,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:18,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:48:18,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657686202] [2021-12-06 22:48:18,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:18,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:48:18,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:48:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:48:18,561 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2021-12-06 22:48:18,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 105 transitions, 304 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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) [2021-12-06 22:48:18,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:18,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2021-12-06 22:48:18,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:18,867 INFO L129 PetriNetUnfolder]: 357/854 cut-off events. [2021-12-06 22:48:18,867 INFO L130 PetriNetUnfolder]: For 1542/1602 co-relation queries the response was YES. [2021-12-06 22:48:18,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 854 events. 357/854 cut-off events. For 1542/1602 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4346 event pairs, 54 based on Foata normal form. 24/814 useless extension candidates. Maximal degree in co-relation 2454. Up to 250 conditions per place. [2021-12-06 22:48:18,873 INFO L132 encePairwiseOnDemand]: 107/115 looper letters, 30 selfloop transitions, 4 changer transitions 35/148 dead transitions. [2021-12-06 22:48:18,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 148 transitions, 685 flow [2021-12-06 22:48:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 22:48:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 22:48:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 975 transitions. [2021-12-06 22:48:18,876 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2021-12-06 22:48:18,876 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 975 transitions. [2021-12-06 22:48:18,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 975 transitions. [2021-12-06 22:48:18,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:18,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 975 transitions. [2021-12-06 22:48:18,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.5) internal successors, (975), 10 states have internal predecessors, (975), 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) [2021-12-06 22:48:18,881 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) [2021-12-06 22:48:18,881 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) [2021-12-06 22:48:18,881 INFO L186 Difference]: Start difference. First operand has 133 places, 105 transitions, 304 flow. Second operand 10 states and 975 transitions. [2021-12-06 22:48:18,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 148 transitions, 685 flow [2021-12-06 22:48:18,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 148 transitions, 653 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-06 22:48:18,886 INFO L242 Difference]: Finished difference. Result has 133 places, 104 transitions, 313 flow [2021-12-06 22:48:18,887 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=313, PETRI_PLACES=133, PETRI_TRANSITIONS=104} [2021-12-06 22:48:18,887 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 13 predicate places. [2021-12-06 22:48:18,887 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 104 transitions, 313 flow [2021-12-06 22:48:18,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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) [2021-12-06 22:48:18,888 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:18,888 INFO L254 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] [2021-12-06 22:48:18,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 22:48:18,888 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2087781331, now seen corresponding path program 1 times [2021-12-06 22:48:18,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:18,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765009470] [2021-12-06 22:48:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:18,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:19,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:19,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765009470] [2021-12-06 22:48:19,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765009470] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:19,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:19,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 22:48:19,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532836068] [2021-12-06 22:48:19,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:19,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:48:19,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:48:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:48:19,024 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-06 22:48:19,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 104 transitions, 313 flow. Second operand has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 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) [2021-12-06 22:48:19,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:19,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-06 22:48:19,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:19,282 INFO L129 PetriNetUnfolder]: 195/529 cut-off events. [2021-12-06 22:48:19,282 INFO L130 PetriNetUnfolder]: For 962/971 co-relation queries the response was YES. [2021-12-06 22:48:19,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 529 events. 195/529 cut-off events. For 962/971 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2152 event pairs, 61 based on Foata normal form. 17/536 useless extension candidates. Maximal degree in co-relation 1484. Up to 208 conditions per place. [2021-12-06 22:48:19,287 INFO L132 encePairwiseOnDemand]: 103/115 looper letters, 23 selfloop transitions, 12 changer transitions 28/140 dead transitions. [2021-12-06 22:48:19,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 140 transitions, 623 flow [2021-12-06 22:48:19,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 22:48:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 22:48:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1150 transitions. [2021-12-06 22:48:19,290 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-12-06 22:48:19,290 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1150 transitions. [2021-12-06 22:48:19,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1150 transitions. [2021-12-06 22:48:19,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:19,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1150 transitions. [2021-12-06 22:48:19,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.83333333333333) internal successors, (1150), 12 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) [2021-12-06 22:48:19,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 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) [2021-12-06 22:48:19,297 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 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) [2021-12-06 22:48:19,297 INFO L186 Difference]: Start difference. First operand has 133 places, 104 transitions, 313 flow. Second operand 12 states and 1150 transitions. [2021-12-06 22:48:19,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 140 transitions, 623 flow [2021-12-06 22:48:19,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 140 transitions, 577 flow, removed 18 selfloop flow, removed 10 redundant places. [2021-12-06 22:48:19,301 INFO L242 Difference]: Finished difference. Result has 135 places, 107 transitions, 371 flow [2021-12-06 22:48:19,302 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=371, PETRI_PLACES=135, PETRI_TRANSITIONS=107} [2021-12-06 22:48:19,302 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 15 predicate places. [2021-12-06 22:48:19,302 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 107 transitions, 371 flow [2021-12-06 22:48:19,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 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) [2021-12-06 22:48:19,303 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:19,303 INFO L254 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] [2021-12-06 22:48:19,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 22:48:19,303 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:19,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1172217744, now seen corresponding path program 1 times [2021-12-06 22:48:19,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:19,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356163663] [2021-12-06 22:48:19,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:19,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:19,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:19,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356163663] [2021-12-06 22:48:19,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356163663] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:19,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:19,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:48:19,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159170915] [2021-12-06 22:48:19,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:19,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:48:19,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:19,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:48:19,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:48:19,381 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-06 22:48:19,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 107 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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) [2021-12-06 22:48:19,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:19,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-06 22:48:19,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:19,707 INFO L129 PetriNetUnfolder]: 735/1543 cut-off events. [2021-12-06 22:48:19,707 INFO L130 PetriNetUnfolder]: For 5685/5893 co-relation queries the response was YES. [2021-12-06 22:48:19,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5191 conditions, 1543 events. 735/1543 cut-off events. For 5685/5893 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8753 event pairs, 49 based on Foata normal form. 8/1476 useless extension candidates. Maximal degree in co-relation 5116. Up to 446 conditions per place. [2021-12-06 22:48:19,718 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 37 selfloop transitions, 7 changer transitions 46/167 dead transitions. [2021-12-06 22:48:19,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 167 transitions, 904 flow [2021-12-06 22:48:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 22:48:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 22:48:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 987 transitions. [2021-12-06 22:48:19,721 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8582608695652174 [2021-12-06 22:48:19,721 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 987 transitions. [2021-12-06 22:48:19,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 987 transitions. [2021-12-06 22:48:19,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:19,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 987 transitions. [2021-12-06 22:48:19,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.7) internal successors, (987), 10 states have internal predecessors, (987), 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) [2021-12-06 22:48:19,726 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) [2021-12-06 22:48:19,726 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) [2021-12-06 22:48:19,726 INFO L186 Difference]: Start difference. First operand has 135 places, 107 transitions, 371 flow. Second operand 10 states and 987 transitions. [2021-12-06 22:48:19,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 167 transitions, 904 flow [2021-12-06 22:48:19,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 167 transitions, 848 flow, removed 5 selfloop flow, removed 11 redundant places. [2021-12-06 22:48:19,732 INFO L242 Difference]: Finished difference. Result has 133 places, 106 transitions, 366 flow [2021-12-06 22:48:19,733 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=366, PETRI_PLACES=133, PETRI_TRANSITIONS=106} [2021-12-06 22:48:19,733 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 13 predicate places. [2021-12-06 22:48:19,733 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 106 transitions, 366 flow [2021-12-06 22:48:19,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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) [2021-12-06 22:48:19,734 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:19,734 INFO L254 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] [2021-12-06 22:48:19,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 22:48:19,734 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash -758070454, now seen corresponding path program 1 times [2021-12-06 22:48:19,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:19,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495123675] [2021-12-06 22:48:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:19,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:19,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:19,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495123675] [2021-12-06 22:48:19,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495123675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:19,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:19,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:48:19,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024763628] [2021-12-06 22:48:19,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:19,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:48:19,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:19,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:48:19,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:48:19,808 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-06 22:48:19,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 106 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:48:19,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:19,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-06 22:48:19,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:20,083 INFO L129 PetriNetUnfolder]: 318/874 cut-off events. [2021-12-06 22:48:20,083 INFO L130 PetriNetUnfolder]: For 3184/3293 co-relation queries the response was YES. [2021-12-06 22:48:20,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3230 conditions, 874 events. 318/874 cut-off events. For 3184/3293 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4865 event pairs, 23 based on Foata normal form. 25/880 useless extension candidates. Maximal degree in co-relation 3157. Up to 209 conditions per place. [2021-12-06 22:48:20,089 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 46 selfloop transitions, 18 changer transitions 22/163 dead transitions. [2021-12-06 22:48:20,090 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 163 transitions, 1031 flow [2021-12-06 22:48:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 22:48:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 22:48:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1084 transitions. [2021-12-06 22:48:20,093 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8569169960474309 [2021-12-06 22:48:20,093 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1084 transitions. [2021-12-06 22:48:20,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1084 transitions. [2021-12-06 22:48:20,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:20,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1084 transitions. [2021-12-06 22:48:20,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.54545454545455) internal successors, (1084), 11 states have internal predecessors, (1084), 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) [2021-12-06 22:48:20,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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) [2021-12-06 22:48:20,098 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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) [2021-12-06 22:48:20,098 INFO L186 Difference]: Start difference. First operand has 133 places, 106 transitions, 366 flow. Second operand 11 states and 1084 transitions. [2021-12-06 22:48:20,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 163 transitions, 1031 flow [2021-12-06 22:48:20,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 163 transitions, 1011 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-12-06 22:48:20,103 INFO L242 Difference]: Finished difference. Result has 140 places, 121 transitions, 539 flow [2021-12-06 22:48:20,103 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=539, PETRI_PLACES=140, PETRI_TRANSITIONS=121} [2021-12-06 22:48:20,104 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 20 predicate places. [2021-12-06 22:48:20,104 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 121 transitions, 539 flow [2021-12-06 22:48:20,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:48:20,104 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:20,105 INFO L254 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] [2021-12-06 22:48:20,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 22:48:20,105 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:20,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1160478147, now seen corresponding path program 1 times [2021-12-06 22:48:20,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:20,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254544845] [2021-12-06 22:48:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:20,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:20,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:20,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254544845] [2021-12-06 22:48:20,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254544845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:20,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:20,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 22:48:20,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650861860] [2021-12-06 22:48:20,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:20,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:48:20,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:20,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:48:20,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:48:20,187 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-06 22:48:20,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 121 transitions, 539 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 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) [2021-12-06 22:48:20,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:20,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-06 22:48:20,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:20,491 INFO L129 PetriNetUnfolder]: 260/729 cut-off events. [2021-12-06 22:48:20,491 INFO L130 PetriNetUnfolder]: For 3577/3695 co-relation queries the response was YES. [2021-12-06 22:48:20,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 729 events. 260/729 cut-off events. For 3577/3695 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4116 event pairs, 19 based on Foata normal form. 17/727 useless extension candidates. Maximal degree in co-relation 3017. Up to 175 conditions per place. [2021-12-06 22:48:20,496 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 39 selfloop transitions, 22 changer transitions 24/162 dead transitions. [2021-12-06 22:48:20,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 162 transitions, 1073 flow [2021-12-06 22:48:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 22:48:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 22:48:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1348 transitions. [2021-12-06 22:48:20,500 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8372670807453416 [2021-12-06 22:48:20,500 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1348 transitions. [2021-12-06 22:48:20,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1348 transitions. [2021-12-06 22:48:20,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:20,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1348 transitions. [2021-12-06 22:48:20,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.28571428571429) internal successors, (1348), 14 states have internal predecessors, (1348), 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) [2021-12-06 22:48:20,507 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) [2021-12-06 22:48:20,507 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) [2021-12-06 22:48:20,507 INFO L186 Difference]: Start difference. First operand has 140 places, 121 transitions, 539 flow. Second operand 14 states and 1348 transitions. [2021-12-06 22:48:20,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 162 transitions, 1073 flow [2021-12-06 22:48:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 162 transitions, 953 flow, removed 56 selfloop flow, removed 6 redundant places. [2021-12-06 22:48:20,517 INFO L242 Difference]: Finished difference. Result has 154 places, 122 transitions, 543 flow [2021-12-06 22:48:20,517 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=134, 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=543, PETRI_PLACES=154, PETRI_TRANSITIONS=122} [2021-12-06 22:48:20,518 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 34 predicate places. [2021-12-06 22:48:20,518 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 122 transitions, 543 flow [2021-12-06 22:48:20,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 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) [2021-12-06 22:48:20,518 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:20,518 INFO L254 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] [2021-12-06 22:48:20,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 22:48:20,519 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1953036688, now seen corresponding path program 1 times [2021-12-06 22:48:20,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:20,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396900256] [2021-12-06 22:48:20,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:20,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:48:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:48:20,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:48:20,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396900256] [2021-12-06 22:48:20,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396900256] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:48:20,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:48:20,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 22:48:20,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757749353] [2021-12-06 22:48:20,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:48:20,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 22:48:20,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:48:20,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 22:48:20,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-06 22:48:20,787 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2021-12-06 22:48:20,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 122 transitions, 543 flow. Second operand has 14 states, 14 states have (on average 88.64285714285714) internal successors, (1241), 14 states have internal predecessors, (1241), 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) [2021-12-06 22:48:20,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:48:20,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2021-12-06 22:48:20,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:48:21,122 INFO L129 PetriNetUnfolder]: 117/770 cut-off events. [2021-12-06 22:48:21,122 INFO L130 PetriNetUnfolder]: For 2203/2351 co-relation queries the response was YES. [2021-12-06 22:48:21,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 770 events. 117/770 cut-off events. For 2203/2351 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6094 event pairs, 2 based on Foata normal form. 6/736 useless extension candidates. Maximal degree in co-relation 2260. Up to 116 conditions per place. [2021-12-06 22:48:21,129 INFO L132 encePairwiseOnDemand]: 103/115 looper letters, 30 selfloop transitions, 10 changer transitions 13/146 dead transitions. [2021-12-06 22:48:21,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 146 transitions, 763 flow [2021-12-06 22:48:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 22:48:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 22:48:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1183 transitions. [2021-12-06 22:48:21,132 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7913043478260869 [2021-12-06 22:48:21,132 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1183 transitions. [2021-12-06 22:48:21,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1183 transitions. [2021-12-06 22:48:21,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:48:21,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1183 transitions. [2021-12-06 22:48:21,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.0) internal successors, (1183), 13 states have internal predecessors, (1183), 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) [2021-12-06 22:48:21,139 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) [2021-12-06 22:48:21,139 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) [2021-12-06 22:48:21,139 INFO L186 Difference]: Start difference. First operand has 154 places, 122 transitions, 543 flow. Second operand 13 states and 1183 transitions. [2021-12-06 22:48:21,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 146 transitions, 763 flow [2021-12-06 22:48:21,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 146 transitions, 615 flow, removed 53 selfloop flow, removed 17 redundant places. [2021-12-06 22:48:21,155 INFO L242 Difference]: Finished difference. Result has 153 places, 123 transitions, 484 flow [2021-12-06 22:48:21,155 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=484, PETRI_PLACES=153, PETRI_TRANSITIONS=123} [2021-12-06 22:48:21,156 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 33 predicate places. [2021-12-06 22:48:21,156 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 123 transitions, 484 flow [2021-12-06 22:48:21,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 88.64285714285714) internal successors, (1241), 14 states have internal predecessors, (1241), 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) [2021-12-06 22:48:21,157 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:48:21,157 INFO L254 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] [2021-12-06 22:48:21,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 22:48:21,157 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 22:48:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:48:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1214643942, now seen corresponding path program 2 times [2021-12-06 22:48:21,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:48:21,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264136502] [2021-12-06 22:48:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:48:21,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:48:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:48:21,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:48:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:48:21,282 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:48:21,282 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 22:48:21,283 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-06 22:48:21,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-06 22:48:21,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-06 22:48:21,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-06 22:48:21,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-06 22:48:21,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-06 22:48:21,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 22:48:21,288 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:48:21,292 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 22:48:21,292 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 22:48:21,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 10:48:21 BasicIcfg [2021-12-06 22:48:21,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 22:48:21,410 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 22:48:21,410 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 22:48:21,410 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 22:48:21,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:48:15" (3/4) ... [2021-12-06 22:48:21,412 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 22:48:21,499 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 22:48:21,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 22:48:21,500 INFO L158 Benchmark]: Toolchain (without parser) took 6884.81ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 81.8MB in the beginning and 112.7MB in the end (delta: -30.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2021-12-06 22:48:21,500 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:48:21,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.53ms. Allocated memory is still 125.8MB. Free memory was 81.6MB in the beginning and 86.9MB in the end (delta: -5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 22:48:21,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.44ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 83.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 22:48:21,501 INFO L158 Benchmark]: Boogie Preprocessor took 28.66ms. Allocated memory is still 125.8MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 22:48:21,501 INFO L158 Benchmark]: RCFGBuilder took 660.49ms. Allocated memory is still 125.8MB. Free memory was 81.6MB in the beginning and 66.4MB in the end (delta: 15.2MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2021-12-06 22:48:21,501 INFO L158 Benchmark]: TraceAbstraction took 5712.76ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 65.8MB in the beginning and 142.1MB in the end (delta: -76.3MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2021-12-06 22:48:21,502 INFO L158 Benchmark]: Witness Printer took 89.38ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 112.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-06 22:48:21,503 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.17ms. Allocated memory is still 125.8MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.53ms. Allocated memory is still 125.8MB. Free memory was 81.6MB in the beginning and 86.9MB in the end (delta: -5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.44ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 83.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.66ms. Allocated memory is still 125.8MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 660.49ms. Allocated memory is still 125.8MB. Free memory was 81.6MB in the beginning and 66.4MB in the end (delta: 15.2MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5712.76ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 65.8MB in the beginning and 142.1MB in the end (delta: -76.3MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * Witness Printer took 89.38ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 112.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L721] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L722] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L723] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L724] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L725] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L726] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L727] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L728] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L729] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L730] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L731] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L732] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L733] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L734] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L735] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L736] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L737] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t1961; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1961, ((void *)0), P0, ((void *)0))=-2, t1961={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t1962; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1962, ((void *)0), P1, ((void *)0))=-1, t1961={5:0}, t1962={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 pthread_t t1963; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1963, ((void *)0), P2, ((void *)0))=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=56, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=56, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 823]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 542 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 542 mSDsluCounter, 429 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 839 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1313 IncrementalHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 85 mSDtfsCounter, 1313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=543occurred in iteration=10, InterpolantAutomatonStates: 117, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 948 NumberOfCodeBlocks, 948 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 848 ConstructedInterpolants, 0 QuantifiedInterpolants, 3937 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! [2021-12-06 22:48:21,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2126650-af0e-4a29-a77f-014c5a98ff38/bin/uautomizer-DrprNOufMa/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