./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS --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 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd --- 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-4e7fbc6 [2022-11-23 02:34:15,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:34:15,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:34:15,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:34:15,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:34:15,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:34:15,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:34:15,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:34:15,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:34:15,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:34:15,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:34:15,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:34:15,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:34:15,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:34:15,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:34:15,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:34:15,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:34:15,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:34:15,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:34:15,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:34:15,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:34:15,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:34:15,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:34:15,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:34:15,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:34:15,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:34:15,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:34:15,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:34:15,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:34:15,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:34:15,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:34:15,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:34:15,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:34:15,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:34:15,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:34:15,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:34:15,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:34:15,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:34:15,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:34:15,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:34:15,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:34:15,612 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 02:34:15,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:34:15,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:34:15,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:34:15,657 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:34:15,658 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:34:15,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:34:15,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:34:15,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:34:15,661 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:34:15,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:34:15,662 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:34:15,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:34:15,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:34:15,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:34:15,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:34:15,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:34:15,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:34:15,664 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:34:15,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:34:15,665 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:34:15,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:34:15,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:34:15,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:34:15,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:34:15,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:34:15,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:34:15,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:34:15,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:34:15,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:34:15,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:34:15,668 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:34:15,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:34:15,669 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:34:15,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:34:15,669 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/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_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS 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 -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd [2022-11-23 02:34:15,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:34:16,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:34:16,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:34:16,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:34:16,020 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:34:16,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-23 02:34:19,178 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:34:19,493 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:34:19,494 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-23 02:34:19,524 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/data/559ffc0a9/d3402554a14045ccb2177252a7b87c05/FLAG8bc98d00a [2022-11-23 02:34:19,541 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/data/559ffc0a9/d3402554a14045ccb2177252a7b87c05 [2022-11-23 02:34:19,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:34:19,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:34:19,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:34:19,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:34:19,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:34:19,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:34:19" (1/1) ... [2022-11-23 02:34:19,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3b5d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:19, skipping insertion in model container [2022-11-23 02:34:19,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:34:19" (1/1) ... [2022-11-23 02:34:19,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:34:19,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:34:19,806 WARN L237 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_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-23 02:34:20,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:34:20,122 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:34:20,137 WARN L237 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_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-23 02:34:20,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:34:20,257 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:34:20,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20 WrapperNode [2022-11-23 02:34:20,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:34:20,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:34:20,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:34:20,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:34:20,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,306 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-23 02:34:20,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:34:20,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:34:20,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:34:20,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:34:20,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,333 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:34:20,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:34:20,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:34:20,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:34:20,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (1/1) ... [2022-11-23 02:34:20,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:34:20,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:34:20,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:34:20,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:34:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:34:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:34:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:34:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:34:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:34:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:34:20,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:34:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:34:20,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:34:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 02:34:20,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 02:34:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 02:34:20,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 02:34:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:34:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:34:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:34:20,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:34:20,434 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:34:20,658 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:34:20,660 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:34:21,048 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:34:21,215 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:34:21,215 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:34:21,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:21 BoogieIcfgContainer [2022-11-23 02:34:21,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:34:21,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:34:21,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:34:21,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:34:21,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:34:19" (1/3) ... [2022-11-23 02:34:21,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc9efe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:34:21, skipping insertion in model container [2022-11-23 02:34:21,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:20" (2/3) ... [2022-11-23 02:34:21,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc9efe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:34:21, skipping insertion in model container [2022-11-23 02:34:21,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:21" (3/3) ... [2022-11-23 02:34:21,232 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-23 02:34:21,243 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 02:34:21,254 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:34:21,254 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 02:34:21,255 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:34:21,314 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:34:21,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-11-23 02:34:21,405 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-23 02:34:21,405 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:34:21,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-11-23 02:34:21,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-11-23 02:34:21,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-11-23 02:34:21,422 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:34:21,437 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-11-23 02:34:21,440 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-11-23 02:34:21,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-11-23 02:34:21,473 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-23 02:34:21,473 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:34:21,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-11-23 02:34:21,476 INFO L119 LiptonReduction]: Number of co-enabled transitions 2828 [2022-11-23 02:34:26,831 INFO L134 LiptonReduction]: Checked pairs total: 6532 [2022-11-23 02:34:26,831 INFO L136 LiptonReduction]: Total number of compositions: 114 [2022-11-23 02:34:26,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:34:26,854 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;@703bc153, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:34:26,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 02:34:26,860 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-11-23 02:34:26,860 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:34:26,860 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:26,861 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:26,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:26,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:26,867 INFO L85 PathProgramCache]: Analyzing trace with hash -854752025, now seen corresponding path program 1 times [2022-11-23 02:34:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:26,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394926210] [2022-11-23 02:34:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:27,480 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-23 02:34:27,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:27,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394926210] [2022-11-23 02:34:27,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394926210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:27,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:27,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:34:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738095142] [2022-11-23 02:34:27,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:27,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:34:27,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:27,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:34:27,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:34:27,519 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 247 [2022-11-23 02:34:27,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-23 02:34:27,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:27,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 247 [2022-11-23 02:34:27,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:28,179 INFO L130 PetriNetUnfolder]: 2483/3665 cut-off events. [2022-11-23 02:34:28,180 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-23 02:34:28,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7213 conditions, 3665 events. 2483/3665 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19646 event pairs, 593 based on Foata normal form. 0/3517 useless extension candidates. Maximal degree in co-relation 7201. Up to 2539 conditions per place. [2022-11-23 02:34:28,211 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-11-23 02:34:28,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 158 flow [2022-11-23 02:34:28,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:34:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:34:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2022-11-23 02:34:28,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5371120107962213 [2022-11-23 02:34:28,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2022-11-23 02:34:28,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2022-11-23 02:34:28,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:28,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2022-11-23 02:34:28,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-23 02:34:28,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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-23 02:34:28,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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-23 02:34:28,259 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 398 transitions. [2022-11-23 02:34:28,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 158 flow [2022-11-23 02:34:28,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 02:34:28,268 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2022-11-23 02:34:28,270 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-11-23 02:34:28,275 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-11-23 02:34:28,276 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2022-11-23 02:34:28,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-23 02:34:28,277 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:28,278 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:28,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:34:28,279 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash 945445713, now seen corresponding path program 1 times [2022-11-23 02:34:28,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:28,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209349300] [2022-11-23 02:34:28,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:28,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:34:28,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:28,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209349300] [2022-11-23 02:34:28,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209349300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:28,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:28,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:34:28,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365200034] [2022-11-23 02:34:28,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:28,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:34:28,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:34:28,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:34:28,667 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 247 [2022-11-23 02:34:28,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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-23 02:34:28,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:28,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 247 [2022-11-23 02:34:28,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:29,343 INFO L130 PetriNetUnfolder]: 3033/4426 cut-off events. [2022-11-23 02:34:29,343 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2022-11-23 02:34:29,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9082 conditions, 4426 events. 3033/4426 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 22688 event pairs, 949 based on Foata normal form. 192/4606 useless extension candidates. Maximal degree in co-relation 9072. Up to 3353 conditions per place. [2022-11-23 02:34:29,378 INFO L137 encePairwiseOnDemand]: 242/247 looper letters, 37 selfloop transitions, 3 changer transitions 21/63 dead transitions. [2022-11-23 02:34:29,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 63 transitions, 272 flow [2022-11-23 02:34:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:34:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:34:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2022-11-23 02:34:29,381 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5246963562753036 [2022-11-23 02:34:29,382 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2022-11-23 02:34:29,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2022-11-23 02:34:29,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:29,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2022-11-23 02:34:29,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 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-23 02:34:29,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 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-23 02:34:29,390 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 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-23 02:34:29,390 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 5 states and 648 transitions. [2022-11-23 02:34:29,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 63 transitions, 272 flow [2022-11-23 02:34:29,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 63 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:34:29,394 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 85 flow [2022-11-23 02:34:29,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-11-23 02:34:29,395 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2022-11-23 02:34:29,396 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 85 flow [2022-11-23 02:34:29,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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-23 02:34:29,397 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:29,397 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:29,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:34:29,398 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:29,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash -755980078, now seen corresponding path program 1 times [2022-11-23 02:34:29,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:29,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631767736] [2022-11-23 02:34:29,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:29,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:29,669 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-23 02:34:29,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:29,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631767736] [2022-11-23 02:34:29,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631767736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:29,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:29,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:34:29,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620329317] [2022-11-23 02:34:29,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:29,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:34:29,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:29,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:34:29,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:34:29,692 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 247 [2022-11-23 02:34:29,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-23 02:34:29,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:29,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 247 [2022-11-23 02:34:29,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:30,118 INFO L130 PetriNetUnfolder]: 1744/2570 cut-off events. [2022-11-23 02:34:30,118 INFO L131 PetriNetUnfolder]: For 680/681 co-relation queries the response was YES. [2022-11-23 02:34:30,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6109 conditions, 2570 events. 1744/2570 cut-off events. For 680/681 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12373 event pairs, 412 based on Foata normal form. 45/2610 useless extension candidates. Maximal degree in co-relation 6096. Up to 2292 conditions per place. [2022-11-23 02:34:30,138 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 35 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2022-11-23 02:34:30,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 212 flow [2022-11-23 02:34:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:34:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:34:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-11-23 02:34:30,140 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5222672064777328 [2022-11-23 02:34:30,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-11-23 02:34:30,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-11-23 02:34:30,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:30,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-11-23 02:34:30,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-23 02:34:30,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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-23 02:34:30,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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-23 02:34:30,145 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 85 flow. Second operand 3 states and 387 transitions. [2022-11-23 02:34:30,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 212 flow [2022-11-23 02:34:30,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-23 02:34:30,154 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 113 flow [2022-11-23 02:34:30,154 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-11-23 02:34:30,155 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2022-11-23 02:34:30,155 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 113 flow [2022-11-23 02:34:30,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-23 02:34:30,156 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:30,156 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:30,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:34:30,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash -760746220, now seen corresponding path program 1 times [2022-11-23 02:34:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:30,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566146967] [2022-11-23 02:34:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:30,358 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-23 02:34:30,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:30,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566146967] [2022-11-23 02:34:30,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566146967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:30,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:30,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:34:30,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109017509] [2022-11-23 02:34:30,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:30,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:34:30,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:30,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:34:30,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:34:30,385 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 247 [2022-11-23 02:34:30,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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-23 02:34:30,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:30,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 247 [2022-11-23 02:34:30,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:31,454 INFO L130 PetriNetUnfolder]: 4737/6874 cut-off events. [2022-11-23 02:34:31,455 INFO L131 PetriNetUnfolder]: For 2897/2897 co-relation queries the response was YES. [2022-11-23 02:34:31,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18398 conditions, 6874 events. 4737/6874 cut-off events. For 2897/2897 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 34670 event pairs, 1555 based on Foata normal form. 236/7110 useless extension candidates. Maximal degree in co-relation 18384. Up to 4435 conditions per place. [2022-11-23 02:34:31,516 INFO L137 encePairwiseOnDemand]: 239/247 looper letters, 48 selfloop transitions, 8 changer transitions 23/79 dead transitions. [2022-11-23 02:34:31,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 79 transitions, 429 flow [2022-11-23 02:34:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:34:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:34:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2022-11-23 02:34:31,519 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5101214574898786 [2022-11-23 02:34:31,525 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 630 transitions. [2022-11-23 02:34:31,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 630 transitions. [2022-11-23 02:34:31,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:31,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 630 transitions. [2022-11-23 02:34:31,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 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-23 02:34:31,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 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-23 02:34:31,531 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 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-23 02:34:31,531 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 113 flow. Second operand 5 states and 630 transitions. [2022-11-23 02:34:31,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 79 transitions, 429 flow [2022-11-23 02:34:31,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 79 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:34:31,538 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 186 flow [2022-11-23 02:34:31,539 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-11-23 02:34:31,541 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2022-11-23 02:34:31,541 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 186 flow [2022-11-23 02:34:31,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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-23 02:34:31,541 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:31,542 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:31,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:34:31,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:31,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2037037187, now seen corresponding path program 1 times [2022-11-23 02:34:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:31,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654406093] [2022-11-23 02:34:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:31,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:31,807 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-23 02:34:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:31,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654406093] [2022-11-23 02:34:31,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654406093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:31,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:31,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:34:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793303689] [2022-11-23 02:34:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:31,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:34:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:34:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:34:31,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 247 [2022-11-23 02:34:31,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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-23 02:34:31,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:31,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 247 [2022-11-23 02:34:31,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:32,306 INFO L130 PetriNetUnfolder]: 1638/2615 cut-off events. [2022-11-23 02:34:32,306 INFO L131 PetriNetUnfolder]: For 3584/3784 co-relation queries the response was YES. [2022-11-23 02:34:32,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8343 conditions, 2615 events. 1638/2615 cut-off events. For 3584/3784 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13744 event pairs, 307 based on Foata normal form. 206/2722 useless extension candidates. Maximal degree in co-relation 8324. Up to 1586 conditions per place. [2022-11-23 02:34:32,325 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2022-11-23 02:34:32,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 448 flow [2022-11-23 02:34:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:34:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:34:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2022-11-23 02:34:32,327 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5232793522267206 [2022-11-23 02:34:32,328 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2022-11-23 02:34:32,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2022-11-23 02:34:32,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:32,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2022-11-23 02:34:32,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 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-23 02:34:32,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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-23 02:34:32,333 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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-23 02:34:32,333 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 186 flow. Second operand 4 states and 517 transitions. [2022-11-23 02:34:32,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 448 flow [2022-11-23 02:34:32,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 422 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-23 02:34:32,341 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 220 flow [2022-11-23 02:34:32,342 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-11-23 02:34:32,342 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2022-11-23 02:34:32,342 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 220 flow [2022-11-23 02:34:32,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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-23 02:34:32,343 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:32,343 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:32,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:34:32,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1290879332, now seen corresponding path program 1 times [2022-11-23 02:34:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:32,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745508468] [2022-11-23 02:34:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:32,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:32,505 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-23 02:34:32,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:32,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745508468] [2022-11-23 02:34:32,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745508468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:32,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:32,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:34:32,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531628154] [2022-11-23 02:34:32,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:32,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:34:32,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:32,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:34:32,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:34:32,521 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 247 [2022-11-23 02:34:32,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:32,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:32,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 247 [2022-11-23 02:34:32,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:32,830 INFO L130 PetriNetUnfolder]: 1020/1652 cut-off events. [2022-11-23 02:34:32,830 INFO L131 PetriNetUnfolder]: For 2871/3085 co-relation queries the response was YES. [2022-11-23 02:34:32,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5970 conditions, 1652 events. 1020/1652 cut-off events. For 2871/3085 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8309 event pairs, 161 based on Foata normal form. 190/1765 useless extension candidates. Maximal degree in co-relation 5951. Up to 644 conditions per place. [2022-11-23 02:34:32,842 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 63 selfloop transitions, 13 changer transitions 0/83 dead transitions. [2022-11-23 02:34:32,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 83 transitions, 552 flow [2022-11-23 02:34:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:34:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:34:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2022-11-23 02:34:32,845 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5222672064777328 [2022-11-23 02:34:32,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2022-11-23 02:34:32,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2022-11-23 02:34:32,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:32,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2022-11-23 02:34:32,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 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-23 02:34:32,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 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-23 02:34:32,850 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 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-23 02:34:32,850 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 220 flow. Second operand 5 states and 645 transitions. [2022-11-23 02:34:32,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 83 transitions, 552 flow [2022-11-23 02:34:32,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 534 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-23 02:34:32,856 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 270 flow [2022-11-23 02:34:32,856 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-11-23 02:34:32,857 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2022-11-23 02:34:32,857 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 270 flow [2022-11-23 02:34:32,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:32,858 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:32,858 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] [2022-11-23 02:34:32,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:34:32,858 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:32,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash 106490428, now seen corresponding path program 1 times [2022-11-23 02:34:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:32,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118847387] [2022-11-23 02:34:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:32,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:33,054 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-23 02:34:33,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:33,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118847387] [2022-11-23 02:34:33,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118847387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:33,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:33,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:34:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915863321] [2022-11-23 02:34:33,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:33,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:34:33,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:33,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:34:33,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:34:33,072 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 247 [2022-11-23 02:34:33,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 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-23 02:34:33,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:33,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 247 [2022-11-23 02:34:33,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:33,638 INFO L130 PetriNetUnfolder]: 1575/2539 cut-off events. [2022-11-23 02:34:33,638 INFO L131 PetriNetUnfolder]: For 5020/5129 co-relation queries the response was YES. [2022-11-23 02:34:33,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9364 conditions, 2539 events. 1575/2539 cut-off events. For 5020/5129 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13632 event pairs, 199 based on Foata normal form. 59/2552 useless extension candidates. Maximal degree in co-relation 9344. Up to 1280 conditions per place. [2022-11-23 02:34:33,654 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 63 selfloop transitions, 2 changer transitions 34/104 dead transitions. [2022-11-23 02:34:33,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 104 transitions, 830 flow [2022-11-23 02:34:33,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:34:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:34:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2022-11-23 02:34:33,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5182186234817814 [2022-11-23 02:34:33,657 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2022-11-23 02:34:33,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2022-11-23 02:34:33,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:33,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2022-11-23 02:34:33,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 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-23 02:34:33,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 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-23 02:34:33,663 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 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-23 02:34:33,663 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 270 flow. Second operand 5 states and 640 transitions. [2022-11-23 02:34:33,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 104 transitions, 830 flow [2022-11-23 02:34:33,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 104 transitions, 740 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-11-23 02:34:33,689 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 257 flow [2022-11-23 02:34:33,689 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-11-23 02:34:33,690 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2022-11-23 02:34:33,690 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 257 flow [2022-11-23 02:34:33,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 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-23 02:34:33,691 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:33,691 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] [2022-11-23 02:34:33,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:34:33,691 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1864911554, now seen corresponding path program 2 times [2022-11-23 02:34:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:33,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699249548] [2022-11-23 02:34:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:33,938 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-23 02:34:33,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:33,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699249548] [2022-11-23 02:34:33,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699249548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:33,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:33,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:34:33,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545647617] [2022-11-23 02:34:33,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:33,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:34:33,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:33,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:34:33,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:34:33,950 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 247 [2022-11-23 02:34:33,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-23 02:34:33,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:33,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 247 [2022-11-23 02:34:33,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:34,334 INFO L130 PetriNetUnfolder]: 1331/2123 cut-off events. [2022-11-23 02:34:34,334 INFO L131 PetriNetUnfolder]: For 3598/3779 co-relation queries the response was YES. [2022-11-23 02:34:34,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7341 conditions, 2123 events. 1331/2123 cut-off events. For 3598/3779 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11451 event pairs, 198 based on Foata normal form. 132/2166 useless extension candidates. Maximal degree in co-relation 7323. Up to 806 conditions per place. [2022-11-23 02:34:34,346 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 55 selfloop transitions, 17 changer transitions 5/84 dead transitions. [2022-11-23 02:34:34,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 574 flow [2022-11-23 02:34:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:34:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:34:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 761 transitions. [2022-11-23 02:34:34,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5134952766531714 [2022-11-23 02:34:34,349 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 761 transitions. [2022-11-23 02:34:34,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 761 transitions. [2022-11-23 02:34:34,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:34,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 761 transitions. [2022-11-23 02:34:34,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 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-23 02:34:34,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 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-23 02:34:34,355 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 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-23 02:34:34,355 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 257 flow. Second operand 6 states and 761 transitions. [2022-11-23 02:34:34,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 574 flow [2022-11-23 02:34:34,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 544 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-11-23 02:34:34,398 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 276 flow [2022-11-23 02:34:34,399 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=276, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-11-23 02:34:34,399 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2022-11-23 02:34:34,399 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 276 flow [2022-11-23 02:34:34,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-23 02:34:34,400 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:34,400 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] [2022-11-23 02:34:34,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:34:34,400 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:34,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1824737519, now seen corresponding path program 1 times [2022-11-23 02:34:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:34,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344797549] [2022-11-23 02:34:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:34,647 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-23 02:34:34,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:34,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344797549] [2022-11-23 02:34:34,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344797549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:34,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:34,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:34:34,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092703347] [2022-11-23 02:34:34,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:34,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:34:34,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:34,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:34:34,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:34:34,700 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 247 [2022-11-23 02:34:34,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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-23 02:34:34,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:34,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 247 [2022-11-23 02:34:34,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:35,221 INFO L130 PetriNetUnfolder]: 1616/2564 cut-off events. [2022-11-23 02:34:35,221 INFO L131 PetriNetUnfolder]: For 5138/5138 co-relation queries the response was YES. [2022-11-23 02:34:35,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9872 conditions, 2564 events. 1616/2564 cut-off events. For 5138/5138 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12965 event pairs, 135 based on Foata normal form. 1/2565 useless extension candidates. Maximal degree in co-relation 9850. Up to 979 conditions per place. [2022-11-23 02:34:35,232 INFO L137 encePairwiseOnDemand]: 238/247 looper letters, 58 selfloop transitions, 9 changer transitions 65/132 dead transitions. [2022-11-23 02:34:35,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 132 transitions, 1079 flow [2022-11-23 02:34:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:34:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:34:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2022-11-23 02:34:35,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4933487565066512 [2022-11-23 02:34:35,236 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2022-11-23 02:34:35,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2022-11-23 02:34:35,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:35,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2022-11-23 02:34:35,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 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-23 02:34:35,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 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-23 02:34:35,243 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 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-23 02:34:35,243 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 276 flow. Second operand 7 states and 853 transitions. [2022-11-23 02:34:35,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 132 transitions, 1079 flow [2022-11-23 02:34:35,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 132 transitions, 894 flow, removed 48 selfloop flow, removed 6 redundant places. [2022-11-23 02:34:35,286 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 234 flow [2022-11-23 02:34:35,287 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2022-11-23 02:34:35,288 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2022-11-23 02:34:35,288 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 234 flow [2022-11-23 02:34:35,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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-23 02:34:35,291 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:35,291 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] [2022-11-23 02:34:35,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:34:35,293 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:35,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:35,293 INFO L85 PathProgramCache]: Analyzing trace with hash 292343181, now seen corresponding path program 2 times [2022-11-23 02:34:35,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:35,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868817241] [2022-11-23 02:34:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:35,534 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-23 02:34:35,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:35,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868817241] [2022-11-23 02:34:35,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868817241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:35,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:35,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:34:35,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232853436] [2022-11-23 02:34:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:35,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:34:35,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:35,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:34:35,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:34:35,547 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 247 [2022-11-23 02:34:35,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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-23 02:34:35,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:35,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 247 [2022-11-23 02:34:35,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:35,815 INFO L130 PetriNetUnfolder]: 952/1588 cut-off events. [2022-11-23 02:34:35,815 INFO L131 PetriNetUnfolder]: For 2579/2601 co-relation queries the response was YES. [2022-11-23 02:34:35,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5736 conditions, 1588 events. 952/1588 cut-off events. For 2579/2601 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8024 event pairs, 340 based on Foata normal form. 1/1555 useless extension candidates. Maximal degree in co-relation 5720. Up to 897 conditions per place. [2022-11-23 02:34:35,824 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 38 selfloop transitions, 2 changer transitions 28/70 dead transitions. [2022-11-23 02:34:35,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 496 flow [2022-11-23 02:34:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:34:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:34:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2022-11-23 02:34:35,826 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5141700404858299 [2022-11-23 02:34:35,826 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2022-11-23 02:34:35,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2022-11-23 02:34:35,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:35,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2022-11-23 02:34:35,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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-23 02:34:35,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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-23 02:34:35,831 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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-23 02:34:35,831 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 234 flow. Second operand 4 states and 508 transitions. [2022-11-23 02:34:35,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 496 flow [2022-11-23 02:34:35,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 474 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-23 02:34:35,856 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 186 flow [2022-11-23 02:34:35,856 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2022-11-23 02:34:35,857 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2022-11-23 02:34:35,857 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 186 flow [2022-11-23 02:34:35,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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-23 02:34:35,858 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:35,858 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] [2022-11-23 02:34:35,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:34:35,858 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:35,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:35,859 INFO L85 PathProgramCache]: Analyzing trace with hash 950092307, now seen corresponding path program 3 times [2022-11-23 02:34:35,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:35,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652955249] [2022-11-23 02:34:35,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:35,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:36,328 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-23 02:34:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:36,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652955249] [2022-11-23 02:34:36,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652955249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:36,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:36,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:34:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854540129] [2022-11-23 02:34:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:36,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:34:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:36,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:34:36,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:34:36,374 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 247 [2022-11-23 02:34:36,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-23 02:34:36,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:36,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 247 [2022-11-23 02:34:36,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:36,637 INFO L130 PetriNetUnfolder]: 219/407 cut-off events. [2022-11-23 02:34:36,637 INFO L131 PetriNetUnfolder]: For 726/726 co-relation queries the response was YES. [2022-11-23 02:34:36,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 407 events. 219/407 cut-off events. For 726/726 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1566 event pairs, 15 based on Foata normal form. 1/408 useless extension candidates. Maximal degree in co-relation 1499. Up to 117 conditions per place. [2022-11-23 02:34:36,640 INFO L137 encePairwiseOnDemand]: 237/247 looper letters, 36 selfloop transitions, 6 changer transitions 57/99 dead transitions. [2022-11-23 02:34:36,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 736 flow [2022-11-23 02:34:36,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:34:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:34:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 924 transitions. [2022-11-23 02:34:36,643 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4676113360323887 [2022-11-23 02:34:36,643 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 924 transitions. [2022-11-23 02:34:36,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 924 transitions. [2022-11-23 02:34:36,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:36,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 924 transitions. [2022-11-23 02:34:36,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.5) internal successors, (924), 8 states have internal predecessors, (924), 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-23 02:34:36,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 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-23 02:34:36,650 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 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-23 02:34:36,650 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 186 flow. Second operand 8 states and 924 transitions. [2022-11-23 02:34:36,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 736 flow [2022-11-23 02:34:36,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 678 flow, removed 5 selfloop flow, removed 9 redundant places. [2022-11-23 02:34:36,656 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 195 flow [2022-11-23 02:34:36,656 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=195, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2022-11-23 02:34:36,657 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2022-11-23 02:34:36,657 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 195 flow [2022-11-23 02:34:36,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-23 02:34:36,657 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:36,658 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] [2022-11-23 02:34:36,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:34:36,658 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:34:36,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:36,659 INFO L85 PathProgramCache]: Analyzing trace with hash -945774845, now seen corresponding path program 4 times [2022-11-23 02:34:36,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:36,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33438831] [2022-11-23 02:34:36,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:36,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:34:36,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:34:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:34:36,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:34:36,761 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:34:36,762 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-23 02:34:36,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-23 02:34:36,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-23 02:34:36,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-23 02:34:36,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-23 02:34:36,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-23 02:34:36,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-23 02:34:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 02:34:36,766 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:36,772 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:34:36,773 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:34:36,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:34:36 BasicIcfg [2022-11-23 02:34:36,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:34:36,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:34:36,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:34:36,862 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:34:36,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:21" (3/4) ... [2022-11-23 02:34:36,864 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 02:34:37,022 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:34:37,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:34:37,023 INFO L158 Benchmark]: Toolchain (without parser) took 17476.98ms. Allocated memory was 180.4MB in the beginning and 471.9MB in the end (delta: 291.5MB). Free memory was 137.0MB in the beginning and 215.8MB in the end (delta: -78.7MB). Peak memory consumption was 213.4MB. Max. memory is 16.1GB. [2022-11-23 02:34:37,023 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:34:37,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.61ms. Allocated memory is still 180.4MB. Free memory was 136.4MB in the beginning and 114.0MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 02:34:37,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.23ms. Allocated memory is still 180.4MB. Free memory was 113.4MB in the beginning and 111.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:34:37,024 INFO L158 Benchmark]: Boogie Preprocessor took 30.85ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 109.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:34:37,025 INFO L158 Benchmark]: RCFGBuilder took 879.29ms. Allocated memory is still 180.4MB. Free memory was 109.2MB in the beginning and 143.0MB in the end (delta: -33.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-11-23 02:34:37,025 INFO L158 Benchmark]: TraceAbstraction took 15641.10ms. Allocated memory was 180.4MB in the beginning and 471.9MB in the end (delta: 291.5MB). Free memory was 143.0MB in the beginning and 230.4MB in the end (delta: -87.4MB). Peak memory consumption was 204.0MB. Max. memory is 16.1GB. [2022-11-23 02:34:37,025 INFO L158 Benchmark]: Witness Printer took 160.94ms. Allocated memory is still 471.9MB. Free memory was 230.4MB in the beginning and 215.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-23 02:34:37,027 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.33ms. Allocated memory is still 138.4MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.61ms. Allocated memory is still 180.4MB. Free memory was 136.4MB in the beginning and 114.0MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.23ms. Allocated memory is still 180.4MB. Free memory was 113.4MB in the beginning and 111.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.85ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 109.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 879.29ms. Allocated memory is still 180.4MB. Free memory was 109.2MB in the beginning and 143.0MB in the end (delta: -33.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15641.10ms. Allocated memory was 180.4MB in the beginning and 471.9MB in the end (delta: 291.5MB). Free memory was 143.0MB in the beginning and 230.4MB in the end (delta: -87.4MB). Peak memory consumption was 204.0MB. Max. memory is 16.1GB. * Witness Printer took 160.94ms. Allocated memory is still 471.9MB. Free memory was 230.4MB in the beginning and 215.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 140 PlacesBefore, 40 PlacesAfterwards, 129 TransitionsBefore, 28 TransitionsAfterwards, 2828 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 6532 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3864, independent: 3694, independent conditional: 0, independent unconditional: 3694, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2085, independent: 2039, independent conditional: 0, independent unconditional: 2039, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2085, independent: 2014, independent conditional: 0, independent unconditional: 2014, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 278, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3864, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 2085, unknown conditional: 0, unknown unconditional: 2085] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 211, Positive conditional cache size: 0, Positive unconditional cache size: 211, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1365, ((void *)0), P0, ((void *)0))=-2, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1366, ((void *)0), P1, ((void *)0))=-1, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1367, ((void *)0), P2, ((void *)0))=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1368, ((void *)0), P3, ((void *)0))=1, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 847]: 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: 851]: 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: 849]: 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 9 procedures, 166 locations, 7 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.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 498 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 396 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 76 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=8, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 830 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-23 02:34:37,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47f278c-7ef9-4c7d-b0a2-1b83c107e94f/bin/uautomizer-QkZJyEgLgS/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