./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/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_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/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_88f41b47-f306-4ef6-b0a0-9490194a70e4/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 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:25:18,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:25:18,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:25:18,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:25:18,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:25:18,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:25:18,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:25:18,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:25:18,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:25:18,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:25:18,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:25:18,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:25:18,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:25:18,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:25:18,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:25:18,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:25:18,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:25:18,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:25:18,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:25:18,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:25:18,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:25:18,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:25:18,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:25:18,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:25:18,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:25:18,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:25:18,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:25:18,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:25:18,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:25:18,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:25:18,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:25:18,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:25:18,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:25:18,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:25:18,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:25:18,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:25:18,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:25:18,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:25:18,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:25:18,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:25:18,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:25:18,479 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:25:18,528 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:25:18,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:25:18,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:25:18,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:25:18,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:25:18,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:25:18,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:25:18,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:25:18,536 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:25:18,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:25:18,538 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:25:18,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:25:18,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:25:18,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:25:18,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:25:18,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:25:18,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:25:18,540 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:25:18,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:25:18,540 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:25:18,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:25:18,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:25:18,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:25:18,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:25:18,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:25:18,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:25:18,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:25:18,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:25:18,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:25:18,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:25:18,543 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:25:18,544 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:25:18,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:25:18,544 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_88f41b47-f306-4ef6-b0a0-9490194a70e4/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_88f41b47-f306-4ef6-b0a0-9490194a70e4/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 -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 [2022-11-16 12:25:18,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:25:18,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:25:18,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:25:18,958 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:25:18,959 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:25:18,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:25:19,053 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/data/a6a7ccb5b/17d6c16a82a940a19cfb649e33b81124/FLAG79b3222e3 [2022-11-16 12:25:19,763 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:25:19,764 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:25:19,788 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/data/a6a7ccb5b/17d6c16a82a940a19cfb649e33b81124/FLAG79b3222e3 [2022-11-16 12:25:19,955 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/data/a6a7ccb5b/17d6c16a82a940a19cfb649e33b81124 [2022-11-16 12:25:19,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:25:19,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:25:19,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:25:19,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:25:19,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:25:19,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:19" (1/1) ... [2022-11-16 12:25:19,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11aba3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:19, skipping insertion in model container [2022-11-16 12:25:19,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:19" (1/1) ... [2022-11-16 12:25:19,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:25:20,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:25:20,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_88f41b47-f306-4ef6-b0a0-9490194a70e4/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-16 12:25:20,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:25:20,630 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:25:20,645 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_88f41b47-f306-4ef6-b0a0-9490194a70e4/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-16 12:25:20,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:25:20,792 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:25:20,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20 WrapperNode [2022-11-16 12:25:20,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:25:20,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:25:20,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:25:20,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:25:20,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,896 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-11-16 12:25:20,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:25:20,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:25:20,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:25:20,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:25:20,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,954 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:25:20,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:25:20,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:25:20,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:25:20,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (1/1) ... [2022-11-16 12:25:20,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:25:21,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:25:21,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:25:21,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:25:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:25:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:25:21,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:25:21,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:25:21,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:25:21,108 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:25:21,108 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:25:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:25:21,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:25:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 12:25:21,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 12:25:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:25:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:25:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:25:21,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:25:21,117 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:25:21,288 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:25:21,291 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:25:21,864 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:25:22,060 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:25:22,061 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:25:22,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:22 BoogieIcfgContainer [2022-11-16 12:25:22,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:25:22,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:25:22,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:25:22,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:25:22,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:25:19" (1/3) ... [2022-11-16 12:25:22,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6a555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:25:22, skipping insertion in model container [2022-11-16 12:25:22,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:20" (2/3) ... [2022-11-16 12:25:22,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6a555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:25:22, skipping insertion in model container [2022-11-16 12:25:22,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:22" (3/3) ... [2022-11-16 12:25:22,077 INFO L112 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:25:22,092 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:25:22,106 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:25:22,107 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:25:22,107 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:25:22,188 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:25:22,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-16 12:25:22,336 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-16 12:25:22,337 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:25:22,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-16 12:25:22,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-11-16 12:25:22,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-11-16 12:25:22,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:25:22,371 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;@2b8095ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:25:22,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 12:25:22,398 INFO L130 PetriNetUnfolder]: 0/59 cut-off events. [2022-11-16 12:25:22,398 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:25:22,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:22,399 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:22,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:22,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1389517564, now seen corresponding path program 1 times [2022-11-16 12:25:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:22,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137171642] [2022-11-16 12:25:22,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:22,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:23,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:23,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137171642] [2022-11-16 12:25:23,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137171642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:23,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:23,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:25:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685358250] [2022-11-16 12:25:23,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:23,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:25:23,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:25:23,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:25:23,418 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 114 [2022-11-16 12:25:23,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:23,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:23,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 114 [2022-11-16 12:25:23,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:23,626 INFO L130 PetriNetUnfolder]: 37/222 cut-off events. [2022-11-16 12:25:23,626 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 12:25:23,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 222 events. 37/222 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 702 event pairs, 7 based on Foata normal form. 11/217 useless extension candidates. Maximal degree in co-relation 263. Up to 51 conditions per place. [2022-11-16 12:25:23,631 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 11 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-11-16 12:25:23,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 111 transitions, 260 flow [2022-11-16 12:25:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:25:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:25:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-11-16 12:25:23,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-11-16 12:25:23,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-11-16 12:25:23,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-11-16 12:25:23,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:23,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-11-16 12:25:23,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:23,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:23,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:23,683 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-11-16 12:25:23,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 111 transitions, 260 flow [2022-11-16 12:25:23,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 111 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:25:23,698 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-11-16 12:25:23,700 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-11-16 12:25:23,707 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-11-16 12:25:23,707 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-11-16 12:25:23,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:23,708 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:23,708 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:23,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:25:23,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1275164153, now seen corresponding path program 1 times [2022-11-16 12:25:23,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:23,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388947482] [2022-11-16 12:25:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:24,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:24,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388947482] [2022-11-16 12:25:24,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388947482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:24,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:24,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:25:24,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362370461] [2022-11-16 12:25:24,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:24,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:25:24,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:24,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:25:24,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:25:24,359 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-11-16 12:25:24,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:24,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:24,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-11-16 12:25:24,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:25,627 INFO L130 PetriNetUnfolder]: 1109/3098 cut-off events. [2022-11-16 12:25:25,627 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-11-16 12:25:25,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 3098 events. 1109/3098 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 25942 event pairs, 271 based on Foata normal form. 0/3005 useless extension candidates. Maximal degree in co-relation 5010. Up to 679 conditions per place. [2022-11-16 12:25:25,662 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 28 selfloop transitions, 5 changer transitions 61/169 dead transitions. [2022-11-16 12:25:25,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 169 transitions, 532 flow [2022-11-16 12:25:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:25:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:25:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 886 transitions. [2022-11-16 12:25:25,675 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8635477582846004 [2022-11-16 12:25:25,675 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 886 transitions. [2022-11-16 12:25:25,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 886 transitions. [2022-11-16 12:25:25,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:25,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 886 transitions. [2022-11-16 12:25:25,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:25,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:25,686 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:25,686 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 886 transitions. [2022-11-16 12:25:25,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 169 transitions, 532 flow [2022-11-16 12:25:25,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 169 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:25:25,696 INFO L231 Difference]: Finished difference. Result has 129 places, 98 transitions, 255 flow [2022-11-16 12:25:25,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=255, PETRI_PLACES=129, PETRI_TRANSITIONS=98} [2022-11-16 12:25:25,698 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-11-16 12:25:25,698 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 98 transitions, 255 flow [2022-11-16 12:25:25,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:25,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:25,700 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:25,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:25:25,701 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash -377237578, now seen corresponding path program 1 times [2022-11-16 12:25:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:25,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905933605] [2022-11-16 12:25:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:25,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:26,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:26,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905933605] [2022-11-16 12:25:26,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905933605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:26,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:26,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:25:26,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320228674] [2022-11-16 12:25:26,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:26,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:25:26,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:26,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:25:26,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:25:26,236 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2022-11-16 12:25:26,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 98 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:26,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:26,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2022-11-16 12:25:26,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:26,891 INFO L130 PetriNetUnfolder]: 500/1151 cut-off events. [2022-11-16 12:25:26,891 INFO L131 PetriNetUnfolder]: For 1496/1568 co-relation queries the response was YES. [2022-11-16 12:25:26,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 1151 events. 500/1151 cut-off events. For 1496/1568 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7029 event pairs, 140 based on Foata normal form. 69/1178 useless extension candidates. Maximal degree in co-relation 3026. Up to 498 conditions per place. [2022-11-16 12:25:26,903 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 19 selfloop transitions, 3 changer transitions 34/136 dead transitions. [2022-11-16 12:25:26,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 136 transitions, 550 flow [2022-11-16 12:25:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:25:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:25:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-11-16 12:25:26,909 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2022-11-16 12:25:26,909 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2022-11-16 12:25:26,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2022-11-16 12:25:26,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:26,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2022-11-16 12:25:26,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:26,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:26,919 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:26,919 INFO L175 Difference]: Start difference. First operand has 129 places, 98 transitions, 255 flow. Second operand 9 states and 890 transitions. [2022-11-16 12:25:26,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 136 transitions, 550 flow [2022-11-16 12:25:26,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 136 transitions, 528 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-16 12:25:26,937 INFO L231 Difference]: Finished difference. Result has 122 places, 98 transitions, 267 flow [2022-11-16 12:25:26,938 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=267, PETRI_PLACES=122, PETRI_TRANSITIONS=98} [2022-11-16 12:25:26,941 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2022-11-16 12:25:26,941 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 98 transitions, 267 flow [2022-11-16 12:25:26,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:26,942 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:26,942 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:26,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:25:26,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash -29208488, now seen corresponding path program 1 times [2022-11-16 12:25:26,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:26,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377145082] [2022-11-16 12:25:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:26,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:27,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:27,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377145082] [2022-11-16 12:25:27,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377145082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:27,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:27,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:25:27,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078392338] [2022-11-16 12:25:27,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:27,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:25:27,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:27,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:25:27,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:25:27,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-11-16 12:25:27,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 98 transitions, 267 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:27,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:27,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-11-16 12:25:27,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:28,402 INFO L130 PetriNetUnfolder]: 670/1561 cut-off events. [2022-11-16 12:25:28,403 INFO L131 PetriNetUnfolder]: For 2055/2063 co-relation queries the response was YES. [2022-11-16 12:25:28,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4031 conditions, 1561 events. 670/1561 cut-off events. For 2055/2063 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10280 event pairs, 147 based on Foata normal form. 39/1545 useless extension candidates. Maximal degree in co-relation 3965. Up to 417 conditions per place. [2022-11-16 12:25:28,420 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 30 selfloop transitions, 8 changer transitions 52/165 dead transitions. [2022-11-16 12:25:28,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 165 transitions, 719 flow [2022-11-16 12:25:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:25:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:25:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1249 transitions. [2022-11-16 12:25:28,425 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8427800269905533 [2022-11-16 12:25:28,426 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1249 transitions. [2022-11-16 12:25:28,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1249 transitions. [2022-11-16 12:25:28,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:28,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1249 transitions. [2022-11-16 12:25:28,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.07692307692308) internal successors, (1249), 13 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:28,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:28,442 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:28,443 INFO L175 Difference]: Start difference. First operand has 122 places, 98 transitions, 267 flow. Second operand 13 states and 1249 transitions. [2022-11-16 12:25:28,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 165 transitions, 719 flow [2022-11-16 12:25:28,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 165 transitions, 657 flow, removed 28 selfloop flow, removed 8 redundant places. [2022-11-16 12:25:28,462 INFO L231 Difference]: Finished difference. Result has 130 places, 100 transitions, 295 flow [2022-11-16 12:25:28,463 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=295, PETRI_PLACES=130, PETRI_TRANSITIONS=100} [2022-11-16 12:25:28,465 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2022-11-16 12:25:28,471 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 100 transitions, 295 flow [2022-11-16 12:25:28,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:28,472 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:28,473 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:28,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:25:28,473 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash -605699225, now seen corresponding path program 1 times [2022-11-16 12:25:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:28,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766742856] [2022-11-16 12:25:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:28,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:28,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766742856] [2022-11-16 12:25:28,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766742856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:28,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:28,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:25:28,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741111596] [2022-11-16 12:25:28,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:28,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:25:28,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:28,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:25:28,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:25:28,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-11-16 12:25:28,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 100 transitions, 295 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:28,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:28,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-11-16 12:25:28,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:30,040 INFO L130 PetriNetUnfolder]: 834/1910 cut-off events. [2022-11-16 12:25:30,040 INFO L131 PetriNetUnfolder]: For 3486/3498 co-relation queries the response was YES. [2022-11-16 12:25:30,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5336 conditions, 1910 events. 834/1910 cut-off events. For 3486/3498 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12529 event pairs, 131 based on Foata normal form. 36/1864 useless extension candidates. Maximal degree in co-relation 5264. Up to 324 conditions per place. [2022-11-16 12:25:30,061 INFO L137 encePairwiseOnDemand]: 103/114 looper letters, 49 selfloop transitions, 19 changer transitions 68/209 dead transitions. [2022-11-16 12:25:30,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 209 transitions, 1156 flow [2022-11-16 12:25:30,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:25:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 12:25:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1604 transitions. [2022-11-16 12:25:30,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8276573787409701 [2022-11-16 12:25:30,068 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1604 transitions. [2022-11-16 12:25:30,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1604 transitions. [2022-11-16 12:25:30,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:30,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1604 transitions. [2022-11-16 12:25:30,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 94.3529411764706) internal successors, (1604), 17 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:30,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:30,080 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:30,080 INFO L175 Difference]: Start difference. First operand has 130 places, 100 transitions, 295 flow. Second operand 17 states and 1604 transitions. [2022-11-16 12:25:30,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 209 transitions, 1156 flow [2022-11-16 12:25:30,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 209 transitions, 1024 flow, removed 66 selfloop flow, removed 9 redundant places. [2022-11-16 12:25:30,105 INFO L231 Difference]: Finished difference. Result has 144 places, 113 transitions, 507 flow [2022-11-16 12:25:30,105 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=507, PETRI_PLACES=144, PETRI_TRANSITIONS=113} [2022-11-16 12:25:30,108 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2022-11-16 12:25:30,109 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 113 transitions, 507 flow [2022-11-16 12:25:30,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:30,109 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:30,110 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:30,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:25:30,110 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:30,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:30,112 INFO L85 PathProgramCache]: Analyzing trace with hash -281206649, now seen corresponding path program 2 times [2022-11-16 12:25:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:30,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354836371] [2022-11-16 12:25:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:30,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:30,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:30,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354836371] [2022-11-16 12:25:30,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354836371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:30,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:30,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:25:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570544299] [2022-11-16 12:25:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:30,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:25:30,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:30,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:25:30,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:25:30,472 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-11-16 12:25:30,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 113 transitions, 507 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:30,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:30,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-11-16 12:25:30,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:31,310 INFO L130 PetriNetUnfolder]: 609/1477 cut-off events. [2022-11-16 12:25:31,310 INFO L131 PetriNetUnfolder]: For 11456/11538 co-relation queries the response was YES. [2022-11-16 12:25:31,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 1477 events. 609/1477 cut-off events. For 11456/11538 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9552 event pairs, 128 based on Foata normal form. 101/1492 useless extension candidates. Maximal degree in co-relation 5673. Up to 301 conditions per place. [2022-11-16 12:25:31,329 INFO L137 encePairwiseOnDemand]: 106/114 looper letters, 21 selfloop transitions, 6 changer transitions 52/160 dead transitions. [2022-11-16 12:25:31,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 160 transitions, 1081 flow [2022-11-16 12:25:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:25:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:25:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 968 transitions. [2022-11-16 12:25:31,334 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8491228070175438 [2022-11-16 12:25:31,334 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 968 transitions. [2022-11-16 12:25:31,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 968 transitions. [2022-11-16 12:25:31,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:31,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 968 transitions. [2022-11-16 12:25:31,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.8) internal successors, (968), 10 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:31,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:31,342 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:31,342 INFO L175 Difference]: Start difference. First operand has 144 places, 113 transitions, 507 flow. Second operand 10 states and 968 transitions. [2022-11-16 12:25:31,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 160 transitions, 1081 flow [2022-11-16 12:25:31,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 160 transitions, 909 flow, removed 86 selfloop flow, removed 9 redundant places. [2022-11-16 12:25:31,376 INFO L231 Difference]: Finished difference. Result has 140 places, 102 transitions, 375 flow [2022-11-16 12:25:31,377 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=375, PETRI_PLACES=140, PETRI_TRANSITIONS=102} [2022-11-16 12:25:31,378 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2022-11-16 12:25:31,378 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 102 transitions, 375 flow [2022-11-16 12:25:31,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:31,379 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:31,379 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:31,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:25:31,379 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:31,380 INFO L85 PathProgramCache]: Analyzing trace with hash -429782818, now seen corresponding path program 1 times [2022-11-16 12:25:31,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:31,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747257030] [2022-11-16 12:25:31,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:31,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:31,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:31,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747257030] [2022-11-16 12:25:31,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747257030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:31,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:31,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:25:31,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415781573] [2022-11-16 12:25:31,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:31,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:25:31,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:31,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:25:31,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:25:31,714 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-11-16 12:25:31,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 102 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:31,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:31,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-11-16 12:25:31,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:32,594 INFO L130 PetriNetUnfolder]: 1216/2510 cut-off events. [2022-11-16 12:25:32,594 INFO L131 PetriNetUnfolder]: For 5372/5603 co-relation queries the response was YES. [2022-11-16 12:25:32,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6544 conditions, 2510 events. 1216/2510 cut-off events. For 5372/5603 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 16916 event pairs, 85 based on Foata normal form. 74/2473 useless extension candidates. Maximal degree in co-relation 6519. Up to 703 conditions per place. [2022-11-16 12:25:32,618 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 32 selfloop transitions, 7 changer transitions 48/169 dead transitions. [2022-11-16 12:25:32,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 169 transitions, 827 flow [2022-11-16 12:25:32,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:25:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:25:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 991 transitions. [2022-11-16 12:25:32,622 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8692982456140351 [2022-11-16 12:25:32,622 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 991 transitions. [2022-11-16 12:25:32,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 991 transitions. [2022-11-16 12:25:32,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:32,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 991 transitions. [2022-11-16 12:25:32,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.1) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:32,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:32,630 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:32,630 INFO L175 Difference]: Start difference. First operand has 140 places, 102 transitions, 375 flow. Second operand 10 states and 991 transitions. [2022-11-16 12:25:32,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 169 transitions, 827 flow [2022-11-16 12:25:32,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 169 transitions, 707 flow, removed 27 selfloop flow, removed 15 redundant places. [2022-11-16 12:25:32,643 INFO L231 Difference]: Finished difference. Result has 134 places, 106 transitions, 366 flow [2022-11-16 12:25:32,644 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=366, PETRI_PLACES=134, PETRI_TRANSITIONS=106} [2022-11-16 12:25:32,645 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2022-11-16 12:25:32,645 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 106 transitions, 366 flow [2022-11-16 12:25:32,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:32,646 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:32,646 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:32,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:25:32,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1191358579, now seen corresponding path program 1 times [2022-11-16 12:25:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:32,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511848789] [2022-11-16 12:25:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:33,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:33,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511848789] [2022-11-16 12:25:33,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511848789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:33,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:33,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:25:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907750795] [2022-11-16 12:25:33,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:33,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:25:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:33,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:25:33,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:25:33,054 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-11-16 12:25:33,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 106 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:33,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:33,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-11-16 12:25:33,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:33,737 INFO L130 PetriNetUnfolder]: 599/1525 cut-off events. [2022-11-16 12:25:33,738 INFO L131 PetriNetUnfolder]: For 2492/2573 co-relation queries the response was YES. [2022-11-16 12:25:33,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4650 conditions, 1525 events. 599/1525 cut-off events. For 2492/2573 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10342 event pairs, 66 based on Foata normal form. 82/1568 useless extension candidates. Maximal degree in co-relation 4630. Up to 387 conditions per place. [2022-11-16 12:25:33,752 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 39 selfloop transitions, 11 changer transitions 42/174 dead transitions. [2022-11-16 12:25:33,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 174 transitions, 945 flow [2022-11-16 12:25:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:25:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 12:25:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1086 transitions. [2022-11-16 12:25:33,757 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8660287081339713 [2022-11-16 12:25:33,757 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1086 transitions. [2022-11-16 12:25:33,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1086 transitions. [2022-11-16 12:25:33,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:33,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1086 transitions. [2022-11-16 12:25:33,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.72727272727273) internal successors, (1086), 11 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:33,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:33,770 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:33,770 INFO L175 Difference]: Start difference. First operand has 134 places, 106 transitions, 366 flow. Second operand 11 states and 1086 transitions. [2022-11-16 12:25:33,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 174 transitions, 945 flow [2022-11-16 12:25:33,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 174 transitions, 922 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-16 12:25:33,782 INFO L231 Difference]: Finished difference. Result has 142 places, 112 transitions, 460 flow [2022-11-16 12:25:33,782 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=460, PETRI_PLACES=142, PETRI_TRANSITIONS=112} [2022-11-16 12:25:33,785 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 23 predicate places. [2022-11-16 12:25:33,786 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 112 transitions, 460 flow [2022-11-16 12:25:33,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:33,786 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:33,787 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:33,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:25:33,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:33,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash 626758292, now seen corresponding path program 1 times [2022-11-16 12:25:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:33,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719931550] [2022-11-16 12:25:33,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:34,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:34,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719931550] [2022-11-16 12:25:34,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719931550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:34,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:34,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:25:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403015362] [2022-11-16 12:25:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:34,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:25:34,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:25:34,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:25:34,272 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-11-16 12:25:34,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 112 transitions, 460 flow. Second operand has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:34,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:34,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-11-16 12:25:34,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:34,920 INFO L130 PetriNetUnfolder]: 397/1103 cut-off events. [2022-11-16 12:25:34,920 INFO L131 PetriNetUnfolder]: For 3189/3271 co-relation queries the response was YES. [2022-11-16 12:25:34,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3786 conditions, 1103 events. 397/1103 cut-off events. For 3189/3271 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7685 event pairs, 66 based on Foata normal form. 57/1121 useless extension candidates. Maximal degree in co-relation 3763. Up to 227 conditions per place. [2022-11-16 12:25:34,952 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 26 selfloop transitions, 14 changer transitions 34/156 dead transitions. [2022-11-16 12:25:34,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 886 flow [2022-11-16 12:25:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:25:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:25:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1252 transitions. [2022-11-16 12:25:34,957 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.844804318488529 [2022-11-16 12:25:34,957 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1252 transitions. [2022-11-16 12:25:34,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1252 transitions. [2022-11-16 12:25:34,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:34,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1252 transitions. [2022-11-16 12:25:34,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.3076923076923) internal successors, (1252), 13 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:34,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:34,967 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:34,967 INFO L175 Difference]: Start difference. First operand has 142 places, 112 transitions, 460 flow. Second operand 13 states and 1252 transitions. [2022-11-16 12:25:34,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 156 transitions, 886 flow [2022-11-16 12:25:34,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 156 transitions, 836 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-11-16 12:25:34,989 INFO L231 Difference]: Finished difference. Result has 151 places, 112 transitions, 465 flow [2022-11-16 12:25:34,990 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=465, PETRI_PLACES=151, PETRI_TRANSITIONS=112} [2022-11-16 12:25:34,991 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2022-11-16 12:25:34,991 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 112 transitions, 465 flow [2022-11-16 12:25:34,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:34,992 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:34,992 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] [2022-11-16 12:25:34,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:25:34,993 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:34,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:34,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1943097297, now seen corresponding path program 1 times [2022-11-16 12:25:34,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:34,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180402268] [2022-11-16 12:25:34,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:34,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:35,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180402268] [2022-11-16 12:25:35,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180402268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:35,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:35,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:25:35,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147776364] [2022-11-16 12:25:35,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:35,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:25:35,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:25:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:25:35,383 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-11-16 12:25:35,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 112 transitions, 465 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:35,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:35,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-11-16 12:25:35,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:35,689 INFO L130 PetriNetUnfolder]: 106/661 cut-off events. [2022-11-16 12:25:35,689 INFO L131 PetriNetUnfolder]: For 1745/1847 co-relation queries the response was YES. [2022-11-16 12:25:35,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 661 events. 106/661 cut-off events. For 1745/1847 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4807 event pairs, 18 based on Foata normal form. 5/616 useless extension candidates. Maximal degree in co-relation 1857. Up to 135 conditions per place. [2022-11-16 12:25:35,696 INFO L137 encePairwiseOnDemand]: 106/114 looper letters, 19 selfloop transitions, 4 changer transitions 15/123 dead transitions. [2022-11-16 12:25:35,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 123 transitions, 567 flow [2022-11-16 12:25:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:25:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 12:25:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2022-11-16 12:25:35,699 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8258145363408521 [2022-11-16 12:25:35,699 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 659 transitions. [2022-11-16 12:25:35,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 659 transitions. [2022-11-16 12:25:35,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:35,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 659 transitions. [2022-11-16 12:25:35,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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 12:25:35,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:35,707 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:35,707 INFO L175 Difference]: Start difference. First operand has 151 places, 112 transitions, 465 flow. Second operand 7 states and 659 transitions. [2022-11-16 12:25:35,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 123 transitions, 567 flow [2022-11-16 12:25:35,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 123 transitions, 472 flow, removed 32 selfloop flow, removed 17 redundant places. [2022-11-16 12:25:35,726 INFO L231 Difference]: Finished difference. Result has 140 places, 105 transitions, 342 flow [2022-11-16 12:25:35,726 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=140, PETRI_TRANSITIONS=105} [2022-11-16 12:25:35,727 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2022-11-16 12:25:35,727 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 105 transitions, 342 flow [2022-11-16 12:25:35,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:35,728 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:35,728 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] [2022-11-16 12:25:35,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:25:35,728 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1529756861, now seen corresponding path program 2 times [2022-11-16 12:25:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:35,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661792655] [2022-11-16 12:25:35,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:35,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:37,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:37,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661792655] [2022-11-16 12:25:37,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661792655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:37,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:37,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:25:37,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702912854] [2022-11-16 12:25:37,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:37,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:25:37,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:37,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:25:37,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:25:37,212 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-11-16 12:25:37,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 105 transitions, 342 flow. Second operand has 12 states, 12 states have (on average 87.0) internal successors, (1044), 12 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:37,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:25:37,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-11-16 12:25:37,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:25:37,620 INFO L130 PetriNetUnfolder]: 42/356 cut-off events. [2022-11-16 12:25:37,621 INFO L131 PetriNetUnfolder]: For 176/179 co-relation queries the response was YES. [2022-11-16 12:25:37,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 356 events. 42/356 cut-off events. For 176/179 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2012 event pairs, 1 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 722. Up to 60 conditions per place. [2022-11-16 12:25:37,624 INFO L137 encePairwiseOnDemand]: 103/114 looper letters, 20 selfloop transitions, 6 changer transitions 8/115 dead transitions. [2022-11-16 12:25:37,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 115 transitions, 444 flow [2022-11-16 12:25:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:25:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 12:25:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1055 transitions. [2022-11-16 12:25:37,631 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7711988304093568 [2022-11-16 12:25:37,631 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1055 transitions. [2022-11-16 12:25:37,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1055 transitions. [2022-11-16 12:25:37,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:25:37,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1055 transitions. [2022-11-16 12:25:37,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 87.91666666666667) internal successors, (1055), 12 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:37,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:37,641 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:37,641 INFO L175 Difference]: Start difference. First operand has 140 places, 105 transitions, 342 flow. Second operand 12 states and 1055 transitions. [2022-11-16 12:25:37,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 115 transitions, 444 flow [2022-11-16 12:25:37,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 115 transitions, 390 flow, removed 11 selfloop flow, removed 13 redundant places. [2022-11-16 12:25:37,646 INFO L231 Difference]: Finished difference. Result has 139 places, 105 transitions, 322 flow [2022-11-16 12:25:37,647 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=322, PETRI_PLACES=139, PETRI_TRANSITIONS=105} [2022-11-16 12:25:37,647 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 20 predicate places. [2022-11-16 12:25:37,648 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 105 transitions, 322 flow [2022-11-16 12:25:37,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.0) internal successors, (1044), 12 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:37,649 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:25:37,649 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] [2022-11-16 12:25:37,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:25:37,650 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:25:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1979614299, now seen corresponding path program 3 times [2022-11-16 12:25:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:37,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421711113] [2022-11-16 12:25:37,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:37,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:37,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:37,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:37,839 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:25:37,843 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 12:25:37,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 12:25:37,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 12:25:37,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 12:25:37,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 12:25:37,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 12:25:37,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:25:37,849 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:37,859 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:25:37,859 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:25:38,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:25:38 BasicIcfg [2022-11-16 12:25:38,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:25:38,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:25:38,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:25:38,095 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:25:38,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:22" (3/4) ... [2022-11-16 12:25:38,099 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:25:38,273 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:25:38,273 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:25:38,275 INFO L158 Benchmark]: Toolchain (without parser) took 18312.47ms. Allocated memory was 115.3MB in the beginning and 327.2MB in the end (delta: 211.8MB). Free memory was 72.0MB in the beginning and 261.0MB in the end (delta: -189.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 12:25:38,275 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 115.3MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:25:38,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 817.88ms. Allocated memory is still 115.3MB. Free memory was 71.8MB in the beginning and 77.2MB in the end (delta: -5.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-11-16 12:25:38,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.50ms. Allocated memory is still 115.3MB. Free memory was 77.2MB in the beginning and 74.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:25:38,276 INFO L158 Benchmark]: Boogie Preprocessor took 81.42ms. Allocated memory is still 115.3MB. Free memory was 74.6MB in the beginning and 73.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:25:38,277 INFO L158 Benchmark]: RCFGBuilder took 1085.19ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 73.0MB in the beginning and 108.6MB in the end (delta: -35.6MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2022-11-16 12:25:38,277 INFO L158 Benchmark]: TraceAbstraction took 16026.44ms. Allocated memory was 140.5MB in the beginning and 327.2MB in the end (delta: 186.6MB). Free memory was 107.8MB in the beginning and 284.1MB in the end (delta: -176.3MB). Peak memory consumption was 188.6MB. Max. memory is 16.1GB. [2022-11-16 12:25:38,278 INFO L158 Benchmark]: Witness Printer took 179.09ms. Allocated memory is still 327.2MB. Free memory was 284.1MB in the beginning and 261.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 12:25:38,280 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.37ms. Allocated memory is still 115.3MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 817.88ms. Allocated memory is still 115.3MB. Free memory was 71.8MB in the beginning and 77.2MB in the end (delta: -5.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.50ms. Allocated memory is still 115.3MB. Free memory was 77.2MB in the beginning and 74.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.42ms. Allocated memory is still 115.3MB. Free memory was 74.6MB in the beginning and 73.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1085.19ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 73.0MB in the beginning and 108.6MB in the end (delta: -35.6MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16026.44ms. Allocated memory was 140.5MB in the beginning and 327.2MB in the end (delta: 186.6MB). Free memory was 107.8MB in the beginning and 284.1MB in the end (delta: -176.3MB). Peak memory consumption was 188.6MB. Max. memory is 16.1GB. * Witness Printer took 179.09ms. Allocated memory is still 327.2MB. Free memory was 284.1MB in the beginning and 261.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L719] 0 _Bool x$flush_delayed; VAL [x$flush_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [x$flush_delayed=0, x$read_delayed_var={0:0}] [L739] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L740] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L720] 0 int x$mem_tmp; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0_used=0, x$w_buff1_used=0] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2073; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2073, ((void *)0), P0, ((void *)0))=-2, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2074; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2074, ((void *)0), P1, ((void *)0))=-1, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L835] 0 pthread_t t2075; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2075, ((void *)0), P2, ((void *)0))=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: 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, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 666 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 666 mSDsluCounter, 517 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 408 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1281 IncrementalHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 109 mSDtfsCounter, 1281 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=507occurred in iteration=5, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 947 NumberOfCodeBlocks, 947 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 848 ConstructedInterpolants, 0 QuantifiedInterpolants, 3210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 12:25:38,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f41b47-f306-4ef6-b0a0-9490194a70e4/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