./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:34:56,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:34:56,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:34:56,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:34:56,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:34:56,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:34:56,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:34:56,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:34:56,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:34:56,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:34:56,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:34:56,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:34:56,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:34:56,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:34:56,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:34:56,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:34:56,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:34:56,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:34:56,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:34:56,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:34:56,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:34:56,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:34:56,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:34:56,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:34:56,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:34:56,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:34:56,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:34:56,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:34:56,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:34:56,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:34:56,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:34:56,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:34:56,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:34:56,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:34:56,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:34:56,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:34:56,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:34:56,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:34:56,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:34:56,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:34:56,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:34:56,423 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:34:56,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:34:56,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:34:56,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:34:56,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:34:56,479 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:34:56,480 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:34:56,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:34:56,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:34:56,481 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:34:56,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:34:56,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:34:56,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:34:56,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:34:56,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:34:56,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:34:56,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:34:56,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:34:56,485 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:34:56,503 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:34:56,504 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:34:56,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:34:56,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:34:56,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:34:56,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:34:56,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:34:56,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:34:56,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:34:56,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:34:56,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:34:56,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:34:56,507 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:34:56,507 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:34:56,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:34:56,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d [2022-11-18 20:34:56,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:34:56,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:34:56,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:34:56,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:34:56,860 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:34:56,862 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:34:56,964 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/data/4d255fabc/fd8ea6625ef14b06b5e8268b68e3d399/FLAG679636ff6 [2022-11-18 20:34:57,550 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:34:57,551 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:34:57,569 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/data/4d255fabc/fd8ea6625ef14b06b5e8268b68e3d399/FLAG679636ff6 [2022-11-18 20:34:57,831 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/data/4d255fabc/fd8ea6625ef14b06b5e8268b68e3d399 [2022-11-18 20:34:57,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:34:57,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:34:57,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:34:57,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:34:57,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:34:57,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:57" (1/1) ... [2022-11-18 20:34:57,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50760426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:57, skipping insertion in model container [2022-11-18 20:34:57,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:57" (1/1) ... [2022-11-18 20:34:57,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:34:57,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:34:58,173 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-18 20:34:58,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:34:58,449 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:34:58,469 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-18 20:34:58,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:34:58,574 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:34:58,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58 WrapperNode [2022-11-18 20:34:58,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:34:58,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:34:58,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:34:58,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:34:58,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,628 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-11-18 20:34:58,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:34:58,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:34:58,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:34:58,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:34:58,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,657 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:34:58,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:34:58,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:34:58,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:34:58,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2022-11-18 20:34:58,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:34:58,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:58,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:34:58,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:34:58,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:34:58,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:34:58,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:34:58,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:34:58,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:34:58,770 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:34:58,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:34:58,770 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:34:58,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:34:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:34:58,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:34:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:34:58,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:34:58,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:34:58,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:34:58,775 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:34:58,958 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:34:58,961 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:34:59,380 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:34:59,676 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:34:59,676 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:34:59,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:59 BoogieIcfgContainer [2022-11-18 20:34:59,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:34:59,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:34:59,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:34:59,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:34:59,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:34:57" (1/3) ... [2022-11-18 20:34:59,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bca0dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:59, skipping insertion in model container [2022-11-18 20:34:59,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (2/3) ... [2022-11-18 20:34:59,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bca0dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:59, skipping insertion in model container [2022-11-18 20:34:59,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:59" (3/3) ... [2022-11-18 20:34:59,696 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:34:59,709 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:34:59,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:34:59,722 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:34:59,722 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:34:59,794 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:34:59,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-18 20:34:59,920 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-18 20:34:59,921 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:34:59,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-18 20:34:59,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-11-18 20:34:59,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-11-18 20:34:59,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:34:59,955 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;@1396d5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:34:59,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 20:34:59,969 INFO L130 PetriNetUnfolder]: 0/45 cut-off events. [2022-11-18 20:34:59,969 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:34:59,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:34:59,970 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:59,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:34:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2144712343, now seen corresponding path program 1 times [2022-11-18 20:34:59,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:59,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467773717] [2022-11-18 20:34:59,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:35:00,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:00,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467773717] [2022-11-18 20:35:00,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467773717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:00,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:00,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:35:00,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120010928] [2022-11-18 20:35:00,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:00,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:35:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:00,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:35:00,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:35:00,635 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2022-11-18 20:35:00,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:00,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:35:00,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2022-11-18 20:35:00,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:35:00,786 INFO L130 PetriNetUnfolder]: 58/275 cut-off events. [2022-11-18 20:35:00,786 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-18 20:35:00,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 275 events. 58/275 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1096 event pairs, 10 based on Foata normal form. 17/273 useless extension candidates. Maximal degree in co-relation 353. Up to 79 conditions per place. [2022-11-18 20:35:00,792 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 14 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-11-18 20:35:00,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 273 flow [2022-11-18 20:35:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:35:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:35:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-11-18 20:35:00,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-11-18 20:35:00,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-11-18 20:35:00,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-11-18 20:35:00,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:35:00,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-11-18 20:35:00,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:00,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:00,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:00,846 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-11-18 20:35:00,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 273 flow [2022-11-18 20:35:00,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:35:00,857 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-11-18 20:35:00,860 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-11-18 20:35:00,868 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-11-18 20:35:00,870 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-11-18 20:35:00,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:00,870 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:35:00,871 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:00,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:35:00,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:35:00,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash 497969646, now seen corresponding path program 1 times [2022-11-18 20:35:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:00,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59227027] [2022-11-18 20:35:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:35:01,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:01,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59227027] [2022-11-18 20:35:01,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59227027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:01,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:01,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:35:01,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283948232] [2022-11-18 20:35:01,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:01,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:35:01,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:01,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:35:01,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:35:01,309 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-11-18 20:35:01,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:01,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:35:01,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-11-18 20:35:01,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:35:03,102 INFO L130 PetriNetUnfolder]: 2476/6461 cut-off events. [2022-11-18 20:35:03,103 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-11-18 20:35:03,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10510 conditions, 6461 events. 2476/6461 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 58351 event pairs, 358 based on Foata normal form. 0/6256 useless extension candidates. Maximal degree in co-relation 10457. Up to 1119 conditions per place. [2022-11-18 20:35:03,147 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 38 selfloop transitions, 8 changer transitions 99/218 dead transitions. [2022-11-18 20:35:03,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 218 transitions, 742 flow [2022-11-18 20:35:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:35:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:35:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1268 transitions. [2022-11-18 20:35:03,152 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8556005398110661 [2022-11-18 20:35:03,153 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1268 transitions. [2022-11-18 20:35:03,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1268 transitions. [2022-11-18 20:35:03,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:35:03,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1268 transitions. [2022-11-18 20:35:03,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.53846153846153) internal successors, (1268), 13 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:03,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:03,164 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:03,164 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 13 states and 1268 transitions. [2022-11-18 20:35:03,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 218 transitions, 742 flow [2022-11-18 20:35:03,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 218 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:35:03,223 INFO L231 Difference]: Finished difference. Result has 138 places, 102 transitions, 292 flow [2022-11-18 20:35:03,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=292, PETRI_PLACES=138, PETRI_TRANSITIONS=102} [2022-11-18 20:35:03,225 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2022-11-18 20:35:03,225 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 102 transitions, 292 flow [2022-11-18 20:35:03,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:03,226 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:35:03,226 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:03,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:35:03,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:35:03,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1260417171, now seen corresponding path program 1 times [2022-11-18 20:35:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:03,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189110560] [2022-11-18 20:35:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:03,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:35:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:03,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189110560] [2022-11-18 20:35:03,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189110560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:03,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:03,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:35:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819706486] [2022-11-18 20:35:03,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:03,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:35:03,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:35:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:35:03,679 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-11-18 20:35:03,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 102 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:03,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:35:03,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-11-18 20:35:03,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:35:04,720 INFO L130 PetriNetUnfolder]: 1424/2978 cut-off events. [2022-11-18 20:35:04,721 INFO L131 PetriNetUnfolder]: For 4494/4514 co-relation queries the response was YES. [2022-11-18 20:35:04,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8195 conditions, 2978 events. 1424/2978 cut-off events. For 4494/4514 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21090 event pairs, 498 based on Foata normal form. 91/2959 useless extension candidates. Maximal degree in co-relation 8132. Up to 1369 conditions per place. [2022-11-18 20:35:04,744 INFO L137 encePairwiseOnDemand]: 107/114 looper letters, 23 selfloop transitions, 5 changer transitions 52/161 dead transitions. [2022-11-18 20:35:04,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 161 transitions, 772 flow [2022-11-18 20:35:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:35:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:35:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 885 transitions. [2022-11-18 20:35:04,748 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8625730994152047 [2022-11-18 20:35:04,748 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 885 transitions. [2022-11-18 20:35:04,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 885 transitions. [2022-11-18 20:35:04,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:35:04,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 885 transitions. [2022-11-18 20:35:04,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:04,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:04,755 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:04,755 INFO L175 Difference]: Start difference. First operand has 138 places, 102 transitions, 292 flow. Second operand 9 states and 885 transitions. [2022-11-18 20:35:04,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 161 transitions, 772 flow [2022-11-18 20:35:04,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 161 transitions, 750 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-11-18 20:35:04,773 INFO L231 Difference]: Finished difference. Result has 129 places, 105 transitions, 359 flow [2022-11-18 20:35:04,774 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=129, PETRI_TRANSITIONS=105} [2022-11-18 20:35:04,775 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-11-18 20:35:04,775 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 105 transitions, 359 flow [2022-11-18 20:35:04,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:04,775 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:35:04,776 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:04,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:35:04,776 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:35:04,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash 346180752, now seen corresponding path program 1 times [2022-11-18 20:35:04,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:04,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599844432] [2022-11-18 20:35:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:05,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-18 20:35:05,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:05,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599844432] [2022-11-18 20:35:05,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599844432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:05,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:05,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:35:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099132232] [2022-11-18 20:35:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:05,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:35:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:05,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:35:05,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:35:05,058 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-18 20:35:05,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 105 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:05,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:35:05,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-18 20:35:05,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:35:06,653 INFO L130 PetriNetUnfolder]: 2605/5341 cut-off events. [2022-11-18 20:35:06,653 INFO L131 PetriNetUnfolder]: For 5021/5665 co-relation queries the response was YES. [2022-11-18 20:35:06,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12209 conditions, 5341 events. 2605/5341 cut-off events. For 5021/5665 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 42479 event pairs, 184 based on Foata normal form. 101/5166 useless extension candidates. Maximal degree in co-relation 12140. Up to 1426 conditions per place. [2022-11-18 20:35:06,696 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 54 selfloop transitions, 13 changer transitions 28/179 dead transitions. [2022-11-18 20:35:06,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 179 transitions, 785 flow [2022-11-18 20:35:06,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:35:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:35:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 989 transitions. [2022-11-18 20:35:06,700 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8675438596491228 [2022-11-18 20:35:06,700 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 989 transitions. [2022-11-18 20:35:06,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 989 transitions. [2022-11-18 20:35:06,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:35:06,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 989 transitions. [2022-11-18 20:35:06,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.9) internal successors, (989), 10 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:06,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:06,707 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:06,707 INFO L175 Difference]: Start difference. First operand has 129 places, 105 transitions, 359 flow. Second operand 10 states and 989 transitions. [2022-11-18 20:35:06,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 179 transitions, 785 flow [2022-11-18 20:35:06,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 179 transitions, 758 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-11-18 20:35:06,726 INFO L231 Difference]: Finished difference. Result has 134 places, 116 transitions, 430 flow [2022-11-18 20:35:06,726 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=430, PETRI_PLACES=134, PETRI_TRANSITIONS=116} [2022-11-18 20:35:06,727 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2022-11-18 20:35:06,728 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 116 transitions, 430 flow [2022-11-18 20:35:06,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:06,728 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:35:06,728 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:06,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:35:06,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:35:06,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2079245692, now seen corresponding path program 1 times [2022-11-18 20:35:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:06,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37086360] [2022-11-18 20:35:06,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:35:07,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:07,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37086360] [2022-11-18 20:35:07,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37086360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:07,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:07,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:35:07,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566489792] [2022-11-18 20:35:07,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:07,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:35:07,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:07,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:35:07,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:35:07,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-11-18 20:35:07,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 116 transitions, 430 flow. Second operand has 7 states, 7 states have (on average 89.42857142857143) internal successors, (626), 7 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:07,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:35:07,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-11-18 20:35:07,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:35:08,408 INFO L130 PetriNetUnfolder]: 1197/4015 cut-off events. [2022-11-18 20:35:08,408 INFO L131 PetriNetUnfolder]: For 6599/6882 co-relation queries the response was YES. [2022-11-18 20:35:08,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10942 conditions, 4015 events. 1197/4015 cut-off events. For 6599/6882 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 39362 event pairs, 233 based on Foata normal form. 91/3891 useless extension candidates. Maximal degree in co-relation 10866. Up to 558 conditions per place. [2022-11-18 20:35:08,452 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 70 selfloop transitions, 26 changer transitions 21/201 dead transitions. [2022-11-18 20:35:08,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 201 transitions, 1110 flow [2022-11-18 20:35:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:35:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:35:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1239 transitions. [2022-11-18 20:35:08,457 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8360323886639676 [2022-11-18 20:35:08,457 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1239 transitions. [2022-11-18 20:35:08,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1239 transitions. [2022-11-18 20:35:08,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:35:08,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1239 transitions. [2022-11-18 20:35:08,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.3076923076923) internal successors, (1239), 13 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:08,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:08,465 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:08,465 INFO L175 Difference]: Start difference. First operand has 134 places, 116 transitions, 430 flow. Second operand 13 states and 1239 transitions. [2022-11-18 20:35:08,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 201 transitions, 1110 flow [2022-11-18 20:35:08,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 201 transitions, 1072 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-11-18 20:35:08,498 INFO L231 Difference]: Finished difference. Result has 154 places, 135 transitions, 706 flow [2022-11-18 20:35:08,498 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=706, PETRI_PLACES=154, PETRI_TRANSITIONS=135} [2022-11-18 20:35:08,502 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 35 predicate places. [2022-11-18 20:35:08,503 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 135 transitions, 706 flow [2022-11-18 20:35:08,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.42857142857143) internal successors, (626), 7 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:08,503 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:35:08,504 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:08,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:35:08,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:35:08,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:08,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1666525138, now seen corresponding path program 1 times [2022-11-18 20:35:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:08,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560497837] [2022-11-18 20:35:08,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:35:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:08,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560497837] [2022-11-18 20:35:08,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560497837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:08,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:08,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:35:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941799980] [2022-11-18 20:35:08,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:08,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:35:08,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:08,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:35:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:35:08,856 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-18 20:35:08,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 135 transitions, 706 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:08,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:35:08,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-18 20:35:08,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:35:10,957 INFO L130 PetriNetUnfolder]: 3433/7163 cut-off events. [2022-11-18 20:35:10,958 INFO L131 PetriNetUnfolder]: For 18600/19833 co-relation queries the response was YES. [2022-11-18 20:35:11,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22172 conditions, 7163 events. 3433/7163 cut-off events. For 18600/19833 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 62607 event pairs, 204 based on Foata normal form. 405/7370 useless extension candidates. Maximal degree in co-relation 22088. Up to 1280 conditions per place. [2022-11-18 20:35:11,018 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 70 selfloop transitions, 22 changer transitions 62/243 dead transitions. [2022-11-18 20:35:11,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 243 transitions, 1644 flow [2022-11-18 20:35:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:35:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:35:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1285 transitions. [2022-11-18 20:35:11,024 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8670715249662618 [2022-11-18 20:35:11,024 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1285 transitions. [2022-11-18 20:35:11,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1285 transitions. [2022-11-18 20:35:11,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:35:11,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1285 transitions. [2022-11-18 20:35:11,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.84615384615384) internal successors, (1285), 13 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:11,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:11,035 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:11,036 INFO L175 Difference]: Start difference. First operand has 154 places, 135 transitions, 706 flow. Second operand 13 states and 1285 transitions. [2022-11-18 20:35:11,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 243 transitions, 1644 flow [2022-11-18 20:35:11,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 243 transitions, 1595 flow, removed 22 selfloop flow, removed 1 redundant places. [2022-11-18 20:35:11,134 INFO L231 Difference]: Finished difference. Result has 171 places, 135 transitions, 736 flow [2022-11-18 20:35:11,135 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=736, PETRI_PLACES=171, PETRI_TRANSITIONS=135} [2022-11-18 20:35:11,136 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 52 predicate places. [2022-11-18 20:35:11,136 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 135 transitions, 736 flow [2022-11-18 20:35:11,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:11,137 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:35:11,137 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:11,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:35:11,138 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:35:11,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:11,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1210642559, now seen corresponding path program 1 times [2022-11-18 20:35:11,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:11,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563681230] [2022-11-18 20:35:11,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:11,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:35:11,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:11,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563681230] [2022-11-18 20:35:11,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563681230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:11,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:11,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:35:11,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046551674] [2022-11-18 20:35:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:11,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:35:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:11,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:35:11,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:35:11,594 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-18 20:35:11,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 135 transitions, 736 flow. Second operand has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:11,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:35:11,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-18 20:35:11,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:35:13,873 INFO L130 PetriNetUnfolder]: 2893/6491 cut-off events. [2022-11-18 20:35:13,876 INFO L131 PetriNetUnfolder]: For 22523/23757 co-relation queries the response was YES. [2022-11-18 20:35:13,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22372 conditions, 6491 events. 2893/6491 cut-off events. For 22523/23757 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 60464 event pairs, 230 based on Foata normal form. 311/6609 useless extension candidates. Maximal degree in co-relation 22330. Up to 992 conditions per place. [2022-11-18 20:35:13,918 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 45 selfloop transitions, 22 changer transitions 65/218 dead transitions. [2022-11-18 20:35:13,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 218 transitions, 1508 flow [2022-11-18 20:35:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:35:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:35:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1540 transitions. [2022-11-18 20:35:13,931 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8442982456140351 [2022-11-18 20:35:13,931 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1540 transitions. [2022-11-18 20:35:13,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1540 transitions. [2022-11-18 20:35:13,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:35:13,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1540 transitions. [2022-11-18 20:35:13,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 96.25) internal successors, (1540), 16 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:13,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:13,943 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:13,943 INFO L175 Difference]: Start difference. First operand has 171 places, 135 transitions, 736 flow. Second operand 16 states and 1540 transitions. [2022-11-18 20:35:13,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 218 transitions, 1508 flow [2022-11-18 20:35:14,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 218 transitions, 1281 flow, removed 109 selfloop flow, removed 18 redundant places. [2022-11-18 20:35:14,192 INFO L231 Difference]: Finished difference. Result has 166 places, 128 transitions, 637 flow [2022-11-18 20:35:14,193 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=637, PETRI_PLACES=166, PETRI_TRANSITIONS=128} [2022-11-18 20:35:14,193 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 47 predicate places. [2022-11-18 20:35:14,194 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 128 transitions, 637 flow [2022-11-18 20:35:14,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:14,194 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:35:14,194 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:14,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:35:14,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:35:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -922512968, now seen corresponding path program 1 times [2022-11-18 20:35:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:14,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556417157] [2022-11-18 20:35:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:14,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:35:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:15,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556417157] [2022-11-18 20:35:15,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556417157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:15,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:15,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:35:15,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095398040] [2022-11-18 20:35:15,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:15,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:35:15,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:15,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:35:15,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:35:15,491 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-11-18 20:35:15,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 128 transitions, 637 flow. Second operand has 10 states, 10 states have (on average 89.2) internal successors, (892), 10 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:15,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:35:15,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-11-18 20:35:15,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:35:16,294 INFO L130 PetriNetUnfolder]: 444/2869 cut-off events. [2022-11-18 20:35:16,294 INFO L131 PetriNetUnfolder]: For 7113/7225 co-relation queries the response was YES. [2022-11-18 20:35:16,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8832 conditions, 2869 events. 444/2869 cut-off events. For 7113/7225 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 34875 event pairs, 8 based on Foata normal form. 5/2744 useless extension candidates. Maximal degree in co-relation 8741. Up to 429 conditions per place. [2022-11-18 20:35:16,306 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 30 selfloop transitions, 8 changer transitions 15/156 dead transitions. [2022-11-18 20:35:16,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 156 transitions, 853 flow [2022-11-18 20:35:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:35:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:35:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1003 transitions. [2022-11-18 20:35:16,310 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7998405103668261 [2022-11-18 20:35:16,311 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1003 transitions. [2022-11-18 20:35:16,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1003 transitions. [2022-11-18 20:35:16,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:35:16,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1003 transitions. [2022-11-18 20:35:16,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.18181818181819) internal successors, (1003), 11 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:16,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:16,318 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:16,318 INFO L175 Difference]: Start difference. First operand has 166 places, 128 transitions, 637 flow. Second operand 11 states and 1003 transitions. [2022-11-18 20:35:16,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 156 transitions, 853 flow [2022-11-18 20:35:16,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 156 transitions, 769 flow, removed 19 selfloop flow, removed 16 redundant places. [2022-11-18 20:35:16,420 INFO L231 Difference]: Finished difference. Result has 157 places, 131 transitions, 604 flow [2022-11-18 20:35:16,421 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=604, PETRI_PLACES=157, PETRI_TRANSITIONS=131} [2022-11-18 20:35:16,421 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 38 predicate places. [2022-11-18 20:35:16,422 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 131 transitions, 604 flow [2022-11-18 20:35:16,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.2) internal successors, (892), 10 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:16,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:35:16,423 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:16,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:35:16,423 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:35:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:16,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1880914694, now seen corresponding path program 2 times [2022-11-18 20:35:16,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:16,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988942475] [2022-11-18 20:35:16,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:35:16,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:35:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:35:16,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:35:16,577 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:35:16,578 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-18 20:35:16,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-18 20:35:16,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-18 20:35:16,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-18 20:35:16,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-18 20:35:16,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-18 20:35:16,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:35:16,582 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:16,590 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:35:16,590 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:35:16,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:35:16 BasicIcfg [2022-11-18 20:35:16,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:35:16,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:35:16,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:35:16,701 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:35:16,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:59" (3/4) ... [2022-11-18 20:35:16,704 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:35:16,873 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:35:16,874 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:35:16,875 INFO L158 Benchmark]: Toolchain (without parser) took 19039.15ms. Allocated memory was 111.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 66.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 334.7MB. Max. memory is 16.1GB. [2022-11-18 20:35:16,876 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 111.1MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:35:16,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 732.40ms. Allocated memory is still 111.1MB. Free memory was 66.0MB in the beginning and 72.2MB in the end (delta: -6.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-11-18 20:35:16,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.55ms. Allocated memory is still 111.1MB. Free memory was 72.2MB in the beginning and 69.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:35:16,878 INFO L158 Benchmark]: Boogie Preprocessor took 33.18ms. Allocated memory is still 111.1MB. Free memory was 69.9MB in the beginning and 68.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:35:16,878 INFO L158 Benchmark]: RCFGBuilder took 1015.96ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 67.8MB in the beginning and 104.5MB in the end (delta: -36.7MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-11-18 20:35:16,879 INFO L158 Benchmark]: TraceAbstraction took 17018.75ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 103.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 320.2MB. Max. memory is 16.1GB. [2022-11-18 20:35:16,879 INFO L158 Benchmark]: Witness Printer took 173.25ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-18 20:35:16,881 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.22ms. Allocated memory is still 111.1MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 732.40ms. Allocated memory is still 111.1MB. Free memory was 66.0MB in the beginning and 72.2MB in the end (delta: -6.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.55ms. Allocated memory is still 111.1MB. Free memory was 72.2MB in the beginning and 69.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.18ms. Allocated memory is still 111.1MB. Free memory was 69.9MB in the beginning and 68.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1015.96ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 67.8MB in the beginning and 104.5MB in the end (delta: -36.7MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17018.75ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 103.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 320.2MB. Max. memory is 16.1GB. * Witness Printer took 173.25ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L728] 0 _Bool z$r_buff1_thd2; VAL [z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [z$r_buff1_thd0=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L736] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 int z$w_buff1; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L737] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L720] 0 _Bool z$flush_delayed; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L732] 0 int z$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L721] 0 int z$mem_tmp; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L730] 0 _Bool z$read_delayed; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t1489; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1489, ((void *)0), P0, ((void *)0))=-2, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 pthread_t t1490; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1490, ((void *)0), P1, ((void *)0))=-1, t1489={5:0}, t1490={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1491; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1491, ((void *)0), P2, ((void *)0))=0, t1489={5:0}, t1490={6:0}, t1491={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 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) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 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)) [L802] 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)) [L803] 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)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 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 [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 606 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 400 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 310 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1077 IncrementalHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 90 mSDtfsCounter, 1077 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=736occurred in iteration=6, InterpolantAutomatonStates: 88, 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, 3.6s InterpolantComputationTime, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 592 ConstructedInterpolants, 0 QuantifiedInterpolants, 2159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 20:35:16,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12cd4770-775d-4931-9811-93e91d24c58a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE