./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:41:08,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:41:08,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:41:08,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:41:08,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:41:08,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:41:08,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:41:08,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:41:08,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:41:08,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:41:08,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:41:08,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:41:08,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:41:08,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:41:08,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:41:08,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:41:08,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:41:08,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:41:08,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:41:08,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:41:08,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:41:08,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:41:08,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:41:08,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:41:08,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:41:08,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:41:08,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:41:08,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:41:08,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:41:08,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:41:08,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:41:08,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:41:08,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:41:08,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:41:08,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:41:08,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:41:08,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:41:08,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:41:08,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:41:08,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:41:08,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:41:08,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:41:08,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:41:08,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:41:08,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:41:08,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:41:08,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:41:08,539 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:41:08,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:41:08,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:41:08,540 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:41:08,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:41:08,542 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:41:08,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:41:08,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:41:08,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:41:08,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:41:08,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:41:08,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:41:08,543 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:41:08,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:41:08,544 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:41:08,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:41:08,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:41:08,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:41:08,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:41:08,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:41:08,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:41:08,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:41:08,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:41:08,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:41:08,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:41:08,548 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:41:08,549 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:41:08,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:41:08,549 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_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 [2022-11-16 11:41:08,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:41:08,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:41:08,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:41:08,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:41:08,985 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:41:08,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 11:41:09,074 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/data/51953c004/01f15b374e4a473684227b74a9a7b4f6/FLAG6912bdbec [2022-11-16 11:41:09,779 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:41:09,787 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 11:41:09,811 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/data/51953c004/01f15b374e4a473684227b74a9a7b4f6/FLAG6912bdbec [2022-11-16 11:41:09,978 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/data/51953c004/01f15b374e4a473684227b74a9a7b4f6 [2022-11-16 11:41:09,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:41:09,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:41:09,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:41:09,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:41:09,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:41:09,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:41:09" (1/1) ... [2022-11-16 11:41:09,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46998ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:09, skipping insertion in model container [2022-11-16 11:41:10,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:41:09" (1/1) ... [2022-11-16 11:41:10,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:41:10,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:41:10,351 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 11:41:10,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:41:10,581 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:41:10,607 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/sv-benchmarks/c/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 11:41:10,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:41:10,753 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:41:10,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10 WrapperNode [2022-11-16 11:41:10,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:41:10,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:41:10,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:41:10,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:41:10,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,849 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-11-16 11:41:10,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:41:10,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:41:10,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:41:10,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:41:10,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:41:10,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:41:10,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:41:10,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:41:10,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (1/1) ... [2022-11-16 11:41:10,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:41:10,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:41:10,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:41:10,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:41:10,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:41:10,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:41:10,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:41:10,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:41:10,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:41:10,998 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:41:10,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:41:10,999 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:41:11,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:41:11,000 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:41:11,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:41:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:41:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:41:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:41:11,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:41:11,003 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:41:11,181 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:41:11,183 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:41:11,574 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:41:11,712 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:41:11,712 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:41:11,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:41:11 BoogieIcfgContainer [2022-11-16 11:41:11,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:41:11,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:41:11,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:41:11,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:41:11,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:41:09" (1/3) ... [2022-11-16 11:41:11,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b19aee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:41:11, skipping insertion in model container [2022-11-16 11:41:11,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:10" (2/3) ... [2022-11-16 11:41:11,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b19aee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:41:11, skipping insertion in model container [2022-11-16 11:41:11,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:41:11" (3/3) ... [2022-11-16 11:41:11,725 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 11:41:11,734 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:41:11,745 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:41:11,746 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:41:11,746 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:41:11,842 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:41:11,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-11-16 11:41:12,020 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-11-16 11:41:12,020 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:41:12,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-16 11:41:12,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2022-11-16 11:41:12,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 120 transitions, 249 flow [2022-11-16 11:41:12,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:41:12,066 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@313723b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:41:12,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:41:12,092 INFO L130 PetriNetUnfolder]: 0/49 cut-off events. [2022-11-16 11:41:12,092 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:41:12,093 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:41:12,094 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:12,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:41:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1127829184, now seen corresponding path program 1 times [2022-11-16 11:41:12,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:12,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398671819] [2022-11-16 11:41:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:41:12,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:12,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398671819] [2022-11-16 11:41:12,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398671819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:41:12,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:41:12,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:41:12,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182426389] [2022-11-16 11:41:12,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:41:12,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:41:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:12,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:41:12,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:41:12,824 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 123 [2022-11-16 11:41:12,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 120 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:12,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:41:12,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 123 [2022-11-16 11:41:12,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:41:13,092 INFO L130 PetriNetUnfolder]: 58/284 cut-off events. [2022-11-16 11:41:13,092 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-16 11:41:13,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 284 events. 58/284 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1145 event pairs, 10 based on Foata normal form. 25/295 useless extension candidates. Maximal degree in co-relation 357. Up to 79 conditions per place. [2022-11-16 11:41:13,100 INFO L137 encePairwiseOnDemand]: 118/123 looper letters, 14 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2022-11-16 11:41:13,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 122 transitions, 291 flow [2022-11-16 11:41:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:41:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:41:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2022-11-16 11:41:13,124 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.943089430894309 [2022-11-16 11:41:13,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2022-11-16 11:41:13,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2022-11-16 11:41:13,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:41:13,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2022-11-16 11:41:13,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:13,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:13,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:13,186 INFO L175 Difference]: Start difference. First operand has 128 places, 120 transitions, 249 flow. Second operand 3 states and 348 transitions. [2022-11-16 11:41:13,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 122 transitions, 291 flow [2022-11-16 11:41:13,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:41:13,198 INFO L231 Difference]: Finished difference. Result has 125 places, 116 transitions, 242 flow [2022-11-16 11:41:13,201 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=125, PETRI_TRANSITIONS=116} [2022-11-16 11:41:13,204 INFO L288 CegarLoopForPetriNet]: 128 programPoint places, -3 predicate places. [2022-11-16 11:41:13,205 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 116 transitions, 242 flow [2022-11-16 11:41:13,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:13,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:41:13,206 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:13,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:41:13,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:41:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:13,212 INFO L85 PathProgramCache]: Analyzing trace with hash -872248605, now seen corresponding path program 1 times [2022-11-16 11:41:13,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:13,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349136130] [2022-11-16 11:41:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:13,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:41:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:13,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349136130] [2022-11-16 11:41:13,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349136130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:41:13,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:41:13,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:41:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907259989] [2022-11-16 11:41:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:41:13,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:41:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:13,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:41:13,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:41:13,764 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 123 [2022-11-16 11:41:13,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 116 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:13,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:41:13,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 123 [2022-11-16 11:41:13,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:41:15,824 INFO L130 PetriNetUnfolder]: 3140/7842 cut-off events. [2022-11-16 11:41:15,824 INFO L131 PetriNetUnfolder]: For 260/260 co-relation queries the response was YES. [2022-11-16 11:41:15,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12860 conditions, 7842 events. 3140/7842 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 73806 event pairs, 783 based on Foata normal form. 0/7661 useless extension candidates. Maximal degree in co-relation 12800. Up to 2147 conditions per place. [2022-11-16 11:41:15,873 INFO L137 encePairwiseOnDemand]: 110/123 looper letters, 32 selfloop transitions, 9 changer transitions 82/202 dead transitions. [2022-11-16 11:41:15,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 202 transitions, 654 flow [2022-11-16 11:41:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:41:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:41:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 951 transitions. [2022-11-16 11:41:15,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8590785907859079 [2022-11-16 11:41:15,878 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 951 transitions. [2022-11-16 11:41:15,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 951 transitions. [2022-11-16 11:41:15,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:41:15,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 951 transitions. [2022-11-16 11:41:15,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:15,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:15,887 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:15,887 INFO L175 Difference]: Start difference. First operand has 125 places, 116 transitions, 242 flow. Second operand 9 states and 951 transitions. [2022-11-16 11:41:15,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 202 transitions, 654 flow [2022-11-16 11:41:15,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 202 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:41:15,893 INFO L231 Difference]: Finished difference. Result has 139 places, 110 transitions, 324 flow [2022-11-16 11:41:15,893 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=324, PETRI_PLACES=139, PETRI_TRANSITIONS=110} [2022-11-16 11:41:15,894 INFO L288 CegarLoopForPetriNet]: 128 programPoint places, 11 predicate places. [2022-11-16 11:41:15,894 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 110 transitions, 324 flow [2022-11-16 11:41:15,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:15,895 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:41:15,895 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:15,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:41:15,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:41:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash 802840098, now seen corresponding path program 1 times [2022-11-16 11:41:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:15,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012918421] [2022-11-16 11:41:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:41:16,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:16,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012918421] [2022-11-16 11:41:16,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012918421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:41:16,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:41:16,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:41:16,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805507793] [2022-11-16 11:41:16,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:41:16,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:41:16,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:16,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:41:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:41:16,245 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 123 [2022-11-16 11:41:16,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 110 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:16,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:41:16,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 123 [2022-11-16 11:41:16,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:41:17,656 INFO L130 PetriNetUnfolder]: 2131/4185 cut-off events. [2022-11-16 11:41:17,656 INFO L131 PetriNetUnfolder]: For 6322/6330 co-relation queries the response was YES. [2022-11-16 11:41:17,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12444 conditions, 4185 events. 2131/4185 cut-off events. For 6322/6330 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 29900 event pairs, 287 based on Foata normal form. 96/4214 useless extension candidates. Maximal degree in co-relation 12372. Up to 1440 conditions per place. [2022-11-16 11:41:17,689 INFO L137 encePairwiseOnDemand]: 111/123 looper letters, 40 selfloop transitions, 9 changer transitions 82/210 dead transitions. [2022-11-16 11:41:17,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 210 transitions, 1096 flow [2022-11-16 11:41:17,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:41:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:41:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1330 transitions. [2022-11-16 11:41:17,694 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8317698561601 [2022-11-16 11:41:17,694 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1330 transitions. [2022-11-16 11:41:17,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1330 transitions. [2022-11-16 11:41:17,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:41:17,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1330 transitions. [2022-11-16 11:41:17,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.3076923076923) internal successors, (1330), 13 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:17,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 123.0) internal successors, (1722), 14 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:17,705 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 123.0) internal successors, (1722), 14 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:17,705 INFO L175 Difference]: Start difference. First operand has 139 places, 110 transitions, 324 flow. Second operand 13 states and 1330 transitions. [2022-11-16 11:41:17,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 210 transitions, 1096 flow [2022-11-16 11:41:17,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 210 transitions, 998 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-11-16 11:41:17,739 INFO L231 Difference]: Finished difference. Result has 143 places, 114 transitions, 398 flow [2022-11-16 11:41:17,739 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=398, PETRI_PLACES=143, PETRI_TRANSITIONS=114} [2022-11-16 11:41:17,740 INFO L288 CegarLoopForPetriNet]: 128 programPoint places, 15 predicate places. [2022-11-16 11:41:17,740 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 114 transitions, 398 flow [2022-11-16 11:41:17,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:17,741 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:41:17,741 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:17,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:41:17,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:41:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1522052319, now seen corresponding path program 1 times [2022-11-16 11:41:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:17,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629096919] [2022-11-16 11:41:17,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:41:18,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:18,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629096919] [2022-11-16 11:41:18,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629096919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:41:18,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:41:18,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:41:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644936244] [2022-11-16 11:41:18,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:41:18,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:41:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:18,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:41:18,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:41:18,029 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 123 [2022-11-16 11:41:18,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 114 transitions, 398 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:18,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:41:18,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 123 [2022-11-16 11:41:18,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:41:19,383 INFO L130 PetriNetUnfolder]: 1906/3826 cut-off events. [2022-11-16 11:41:19,383 INFO L131 PetriNetUnfolder]: For 10050/10058 co-relation queries the response was YES. [2022-11-16 11:41:19,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12616 conditions, 3826 events. 1906/3826 cut-off events. For 10050/10058 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 27384 event pairs, 447 based on Foata normal form. 91/3854 useless extension candidates. Maximal degree in co-relation 12532. Up to 1398 conditions per place. [2022-11-16 11:41:19,422 INFO L137 encePairwiseOnDemand]: 110/123 looper letters, 37 selfloop transitions, 17 changer transitions 73/206 dead transitions. [2022-11-16 11:41:19,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 206 transitions, 1202 flow [2022-11-16 11:41:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:41:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:41:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1333 transitions. [2022-11-16 11:41:19,426 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.83364602876798 [2022-11-16 11:41:19,427 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1333 transitions. [2022-11-16 11:41:19,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1333 transitions. [2022-11-16 11:41:19,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:41:19,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1333 transitions. [2022-11-16 11:41:19,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.53846153846153) internal successors, (1333), 13 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:19,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 123.0) internal successors, (1722), 14 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:19,435 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 123.0) internal successors, (1722), 14 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:19,435 INFO L175 Difference]: Start difference. First operand has 143 places, 114 transitions, 398 flow. Second operand 13 states and 1333 transitions. [2022-11-16 11:41:19,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 206 transitions, 1202 flow [2022-11-16 11:41:19,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 206 transitions, 1120 flow, removed 39 selfloop flow, removed 7 redundant places. [2022-11-16 11:41:19,531 INFO L231 Difference]: Finished difference. Result has 150 places, 118 transitions, 485 flow [2022-11-16 11:41:19,531 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=485, PETRI_PLACES=150, PETRI_TRANSITIONS=118} [2022-11-16 11:41:19,532 INFO L288 CegarLoopForPetriNet]: 128 programPoint places, 22 predicate places. [2022-11-16 11:41:19,532 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 118 transitions, 485 flow [2022-11-16 11:41:19,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:19,533 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:41:19,533 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:19,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:41:19,534 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:41:19,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash -428511520, now seen corresponding path program 1 times [2022-11-16 11:41:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:19,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325029575] [2022-11-16 11:41:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:41:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:19,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325029575] [2022-11-16 11:41:19,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325029575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:41:19,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:41:19,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:41:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786412676] [2022-11-16 11:41:19,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:41:19,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:41:19,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:19,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:41:19,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:41:19,805 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 123 [2022-11-16 11:41:19,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 118 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:19,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:41:19,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 123 [2022-11-16 11:41:19,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:41:20,538 INFO L130 PetriNetUnfolder]: 1168/2490 cut-off events. [2022-11-16 11:41:20,539 INFO L131 PetriNetUnfolder]: For 7032/7113 co-relation queries the response was YES. [2022-11-16 11:41:20,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8305 conditions, 2490 events. 1168/2490 cut-off events. For 7032/7113 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16987 event pairs, 262 based on Foata normal form. 76/2487 useless extension candidates. Maximal degree in co-relation 8216. Up to 858 conditions per place. [2022-11-16 11:41:20,568 INFO L137 encePairwiseOnDemand]: 117/123 looper letters, 23 selfloop transitions, 4 changer transitions 46/171 dead transitions. [2022-11-16 11:41:20,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 171 transitions, 947 flow [2022-11-16 11:41:20,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:41:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:41:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 971 transitions. [2022-11-16 11:41:20,572 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8771454381210478 [2022-11-16 11:41:20,572 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 971 transitions. [2022-11-16 11:41:20,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 971 transitions. [2022-11-16 11:41:20,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:41:20,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 971 transitions. [2022-11-16 11:41:20,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.88888888888889) internal successors, (971), 9 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:20,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:20,578 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:20,578 INFO L175 Difference]: Start difference. First operand has 150 places, 118 transitions, 485 flow. Second operand 9 states and 971 transitions. [2022-11-16 11:41:20,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 171 transitions, 947 flow [2022-11-16 11:41:20,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 171 transitions, 879 flow, removed 34 selfloop flow, removed 15 redundant places. [2022-11-16 11:41:20,613 INFO L231 Difference]: Finished difference. Result has 141 places, 118 transitions, 467 flow [2022-11-16 11:41:20,613 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=467, PETRI_PLACES=141, PETRI_TRANSITIONS=118} [2022-11-16 11:41:20,614 INFO L288 CegarLoopForPetriNet]: 128 programPoint places, 13 predicate places. [2022-11-16 11:41:20,614 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 118 transitions, 467 flow [2022-11-16 11:41:20,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:20,615 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:41:20,615 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:20,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:41:20,616 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:41:20,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1789623597, now seen corresponding path program 1 times [2022-11-16 11:41:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:20,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808749231] [2022-11-16 11:41:20,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:41:20,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:20,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808749231] [2022-11-16 11:41:20,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808749231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:41:20,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:41:20,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:41:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812616985] [2022-11-16 11:41:20,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:41:20,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:41:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:20,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:41:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:41:20,923 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2022-11-16 11:41:20,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 118 transitions, 467 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:20,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:41:20,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2022-11-16 11:41:20,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:41:22,254 INFO L130 PetriNetUnfolder]: 2698/5705 cut-off events. [2022-11-16 11:41:22,254 INFO L131 PetriNetUnfolder]: For 4893/6347 co-relation queries the response was YES. [2022-11-16 11:41:22,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13273 conditions, 5705 events. 2698/5705 cut-off events. For 4893/6347 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 47354 event pairs, 210 based on Foata normal form. 1/5445 useless extension candidates. Maximal degree in co-relation 13190. Up to 1414 conditions per place. [2022-11-16 11:41:22,321 INFO L137 encePairwiseOnDemand]: 113/123 looper letters, 78 selfloop transitions, 17 changer transitions 0/192 dead transitions. [2022-11-16 11:41:22,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 192 transitions, 928 flow [2022-11-16 11:41:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:41:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:41:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1079 transitions. [2022-11-16 11:41:22,325 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8772357723577235 [2022-11-16 11:41:22,326 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1079 transitions. [2022-11-16 11:41:22,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1079 transitions. [2022-11-16 11:41:22,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:41:22,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1079 transitions. [2022-11-16 11:41:22,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.9) internal successors, (1079), 10 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:22,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 123.0) internal successors, (1353), 11 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:22,334 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 123.0) internal successors, (1353), 11 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:22,335 INFO L175 Difference]: Start difference. First operand has 141 places, 118 transitions, 467 flow. Second operand 10 states and 1079 transitions. [2022-11-16 11:41:22,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 192 transitions, 928 flow [2022-11-16 11:41:22,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 192 transitions, 906 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-11-16 11:41:22,352 INFO L231 Difference]: Finished difference. Result has 142 places, 133 transitions, 565 flow [2022-11-16 11:41:22,353 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=565, PETRI_PLACES=142, PETRI_TRANSITIONS=133} [2022-11-16 11:41:22,355 INFO L288 CegarLoopForPetriNet]: 128 programPoint places, 14 predicate places. [2022-11-16 11:41:22,356 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 133 transitions, 565 flow [2022-11-16 11:41:22,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:22,357 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:41:22,357 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:22,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:41:22,358 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:41:22,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:22,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1283846503, now seen corresponding path program 1 times [2022-11-16 11:41:22,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:22,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751438767] [2022-11-16 11:41:22,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:22,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:41:22,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751438767] [2022-11-16 11:41:22,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751438767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:41:22,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:41:22,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:41:22,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231805246] [2022-11-16 11:41:22,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:41:22,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:41:22,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:22,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:41:22,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:41:22,708 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 123 [2022-11-16 11:41:22,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 133 transitions, 565 flow. Second operand has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:22,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:41:22,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 123 [2022-11-16 11:41:22,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:41:23,795 INFO L130 PetriNetUnfolder]: 1337/4324 cut-off events. [2022-11-16 11:41:23,795 INFO L131 PetriNetUnfolder]: For 5950/6234 co-relation queries the response was YES. [2022-11-16 11:41:23,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11564 conditions, 4324 events. 1337/4324 cut-off events. For 5950/6234 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 42389 event pairs, 197 based on Foata normal form. 95/4214 useless extension candidates. Maximal degree in co-relation 11475. Up to 731 conditions per place. [2022-11-16 11:41:23,844 INFO L137 encePairwiseOnDemand]: 109/123 looper letters, 71 selfloop transitions, 35 changer transitions 9/207 dead transitions. [2022-11-16 11:41:23,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 207 transitions, 1162 flow [2022-11-16 11:41:23,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:41:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:41:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1102 transitions. [2022-11-16 11:41:23,848 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8144863266814486 [2022-11-16 11:41:23,848 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1102 transitions. [2022-11-16 11:41:23,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1102 transitions. [2022-11-16 11:41:23,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:41:23,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1102 transitions. [2022-11-16 11:41:23,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:23,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 123.0) internal successors, (1476), 12 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:23,855 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 123.0) internal successors, (1476), 12 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:23,856 INFO L175 Difference]: Start difference. First operand has 142 places, 133 transitions, 565 flow. Second operand 11 states and 1102 transitions. [2022-11-16 11:41:23,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 207 transitions, 1162 flow [2022-11-16 11:41:23,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 207 transitions, 1160 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:41:23,884 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 912 flow [2022-11-16 11:41:23,885 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=912, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2022-11-16 11:41:23,885 INFO L288 CegarLoopForPetriNet]: 128 programPoint places, 32 predicate places. [2022-11-16 11:41:23,885 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 912 flow [2022-11-16 11:41:23,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:23,886 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:41:23,886 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:23,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:41:23,887 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:41:23,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:23,887 INFO L85 PathProgramCache]: Analyzing trace with hash 150193835, now seen corresponding path program 2 times [2022-11-16 11:41:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:23,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645698236] [2022-11-16 11:41:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:23,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:41:24,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:24,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645698236] [2022-11-16 11:41:24,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645698236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:41:24,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:41:24,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:41:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728013656] [2022-11-16 11:41:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:41:24,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:41:24,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:24,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:41:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:41:24,185 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2022-11-16 11:41:24,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 912 flow. Second operand has 7 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:24,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:41:24,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2022-11-16 11:41:24,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:41:25,867 INFO L130 PetriNetUnfolder]: 3575/7493 cut-off events. [2022-11-16 11:41:25,867 INFO L131 PetriNetUnfolder]: For 17676/20580 co-relation queries the response was YES. [2022-11-16 11:41:25,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23904 conditions, 7493 events. 3575/7493 cut-off events. For 17676/20580 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 65743 event pairs, 232 based on Foata normal form. 256/7495 useless extension candidates. Maximal degree in co-relation 23807. Up to 1170 conditions per place. [2022-11-16 11:41:25,940 INFO L137 encePairwiseOnDemand]: 113/123 looper letters, 79 selfloop transitions, 32 changer transitions 42/260 dead transitions. [2022-11-16 11:41:25,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 260 transitions, 1889 flow [2022-11-16 11:41:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:41:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:41:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1406 transitions. [2022-11-16 11:41:25,944 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8792995622263915 [2022-11-16 11:41:25,944 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1406 transitions. [2022-11-16 11:41:25,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1406 transitions. [2022-11-16 11:41:25,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:41:25,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1406 transitions. [2022-11-16 11:41:25,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 108.15384615384616) internal successors, (1406), 13 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:25,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 123.0) internal successors, (1722), 14 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:25,953 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 123.0) internal successors, (1722), 14 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:25,953 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 912 flow. Second operand 13 states and 1406 transitions. [2022-11-16 11:41:25,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 260 transitions, 1889 flow [2022-11-16 11:41:26,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 260 transitions, 1863 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-11-16 11:41:26,038 INFO L231 Difference]: Finished difference. Result has 176 places, 164 transitions, 1024 flow [2022-11-16 11:41:26,039 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1024, PETRI_PLACES=176, PETRI_TRANSITIONS=164} [2022-11-16 11:41:26,039 INFO L288 CegarLoopForPetriNet]: 128 programPoint places, 48 predicate places. [2022-11-16 11:41:26,040 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 164 transitions, 1024 flow [2022-11-16 11:41:26,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:26,040 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:41:26,041 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:26,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:41:26,041 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:41:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1905416360, now seen corresponding path program 1 times [2022-11-16 11:41:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:26,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672843450] [2022-11-16 11:41:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:26,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:41:26,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:26,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672843450] [2022-11-16 11:41:26,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672843450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:41:26,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:41:26,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:41:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856089647] [2022-11-16 11:41:26,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:41:26,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:41:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:26,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:41:26,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:41:26,363 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2022-11-16 11:41:26,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 164 transitions, 1024 flow. Second operand has 8 states, 8 states have (on average 101.0) internal successors, (808), 8 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:26,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:41:26,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2022-11-16 11:41:26,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:41:28,231 INFO L130 PetriNetUnfolder]: 3425/7140 cut-off events. [2022-11-16 11:41:28,231 INFO L131 PetriNetUnfolder]: For 22853/26058 co-relation queries the response was YES. [2022-11-16 11:41:28,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25352 conditions, 7140 events. 3425/7140 cut-off events. For 22853/26058 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 63410 event pairs, 205 based on Foata normal form. 151/7040 useless extension candidates. Maximal degree in co-relation 25314. Up to 1063 conditions per place. [2022-11-16 11:41:28,289 INFO L137 encePairwiseOnDemand]: 113/123 looper letters, 52 selfloop transitions, 28 changer transitions 62/249 dead transitions. [2022-11-16 11:41:28,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 249 transitions, 1886 flow [2022-11-16 11:41:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:41:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 11:41:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1692 transitions. [2022-11-16 11:41:28,295 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8597560975609756 [2022-11-16 11:41:28,295 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1692 transitions. [2022-11-16 11:41:28,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1692 transitions. [2022-11-16 11:41:28,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:41:28,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1692 transitions. [2022-11-16 11:41:28,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 105.75) internal successors, (1692), 16 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:28,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 123.0) internal successors, (2091), 17 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:28,306 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 123.0) internal successors, (2091), 17 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:28,306 INFO L175 Difference]: Start difference. First operand has 176 places, 164 transitions, 1024 flow. Second operand 16 states and 1692 transitions. [2022-11-16 11:41:28,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 249 transitions, 1886 flow [2022-11-16 11:41:28,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 249 transitions, 1642 flow, removed 104 selfloop flow, removed 14 redundant places. [2022-11-16 11:41:28,773 INFO L231 Difference]: Finished difference. Result has 178 places, 156 transitions, 904 flow [2022-11-16 11:41:28,773 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=904, PETRI_PLACES=178, PETRI_TRANSITIONS=156} [2022-11-16 11:41:28,774 INFO L288 CegarLoopForPetriNet]: 128 programPoint places, 50 predicate places. [2022-11-16 11:41:28,774 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 156 transitions, 904 flow [2022-11-16 11:41:28,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.0) internal successors, (808), 8 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:41:28,775 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:41:28,775 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:28,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:41:28,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:41:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash -731918967, now seen corresponding path program 1 times [2022-11-16 11:41:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:28,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418668870] [2022-11-16 11:41:28,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:41:28,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:41:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:41:28,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:41:28,982 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:41:28,984 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 11:41:28,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 11:41:28,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 11:41:28,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 11:41:28,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 11:41:28,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 11:41:28,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:41:28,994 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:29,002 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:41:29,002 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:41:29,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:41:29 BasicIcfg [2022-11-16 11:41:29,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:41:29,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:41:29,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:41:29,169 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:41:29,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:41:11" (3/4) ... [2022-11-16 11:41:29,172 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:41:29,303 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:41:29,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:41:29,304 INFO L158 Benchmark]: Toolchain (without parser) took 19321.37ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 112.4MB in the beginning and 341.0MB in the end (delta: -228.6MB). Peak memory consumption was 702.2MB. Max. memory is 16.1GB. [2022-11-16 11:41:29,304 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 151.0MB. Free memory was 131.4MB in the beginning and 131.3MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:41:29,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.61ms. Allocated memory is still 151.0MB. Free memory was 112.2MB in the beginning and 113.3MB in the end (delta: -1.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:41:29,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.35ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 111.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:41:29,306 INFO L158 Benchmark]: Boogie Preprocessor took 36.95ms. Allocated memory is still 151.0MB. Free memory was 110.7MB in the beginning and 109.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:41:29,306 INFO L158 Benchmark]: RCFGBuilder took 827.06ms. Allocated memory is still 151.0MB. Free memory was 109.1MB in the beginning and 74.5MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-16 11:41:29,306 INFO L158 Benchmark]: TraceAbstraction took 17450.96ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 73.9MB in the beginning and 367.2MB in the end (delta: -293.3MB). Peak memory consumption was 639.4MB. Max. memory is 16.1GB. [2022-11-16 11:41:29,307 INFO L158 Benchmark]: Witness Printer took 134.16ms. Allocated memory is still 1.1GB. Free memory was 367.2MB in the beginning and 341.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-16 11:41:29,309 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.38ms. Allocated memory is still 151.0MB. Free memory was 131.4MB in the beginning and 131.3MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.61ms. Allocated memory is still 151.0MB. Free memory was 112.2MB in the beginning and 113.3MB in the end (delta: -1.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.35ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 111.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.95ms. Allocated memory is still 151.0MB. Free memory was 110.7MB in the beginning and 109.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 827.06ms. Allocated memory is still 151.0MB. Free memory was 109.1MB in the beginning and 74.5MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17450.96ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 73.9MB in the beginning and 367.2MB in the end (delta: -293.3MB). Peak memory consumption was 639.4MB. Max. memory is 16.1GB. * Witness Printer took 134.16ms. Allocated memory is still 1.1GB. Free memory was 367.2MB in the beginning and 341.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L723] 0 int b$mem_tmp; VAL [__unbuffered_p2_EBX=0, b$mem_tmp=0] [L737] 0 _Bool b$w_buff1_used; VAL [__unbuffered_p2_EBX=0, b$mem_tmp=0, b$w_buff1_used=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, b$mem_tmp=0, b$w_buff1_used=0, weak$$choice0=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, b$mem_tmp=0, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L732] 0 _Bool b$read_delayed; VAL [__unbuffered_p2_EBX=0, b$mem_tmp=0, b$read_delayed=0, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L727] 0 _Bool b$r_buff0_thd3; VAL [__unbuffered_p2_EBX=0, b$mem_tmp=0, b$r_buff0_thd3=0, b$read_delayed=0, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L726] 0 _Bool b$r_buff0_thd2; VAL [__unbuffered_p2_EBX=0, b$mem_tmp=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$read_delayed=0, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L725] 0 _Bool b$r_buff0_thd1; VAL [__unbuffered_p2_EBX=0, b$mem_tmp=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$read_delayed=0, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L724] 0 _Bool b$r_buff0_thd0; VAL [__unbuffered_p2_EBX=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$read_delayed=0, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$read_delayed=0, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L733] 0 int *b$read_delayed_var; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L719] 0 int a = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, a=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L721] 0 int b = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L728] 0 _Bool b$r_buff1_thd0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L729] 0 _Bool b$r_buff1_thd1; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L730] 0 _Bool b$r_buff1_thd2; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L731] 0 _Bool b$r_buff1_thd3; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L734] 0 int b$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L736] 0 int b$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff1=0, b$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L739] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L738] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L735] 0 _Bool b$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L741] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0] [L743] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L722] 0 _Bool b$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] 0 pthread_t t873; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t873, ((void *)0), P0, ((void *)0))=-2, t873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t874; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t873={5:0}, t874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t874, ((void *)0), P1, ((void *)0))=-1, t873={5:0}, t874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t875; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t875, ((void *)0), P2, ((void *)0))=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L862] 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_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L873] 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_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] - 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: 854]: 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: 858]: 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: 856]: 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, 154 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: 17.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 750 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 750 mSDsluCounter, 588 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 441 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1300 IncrementalHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 147 mSDtfsCounter, 1300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1024occurred in iteration=8, InterpolantAutomatonStates: 97, 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, 2.8s InterpolantComputationTime, 826 NumberOfCodeBlocks, 826 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 720 ConstructedInterpolants, 0 QuantifiedInterpolants, 2668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 11:41:29,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a73761f-6f36-4f89-818c-77ad1b22c591/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE