./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R --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 a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 --- 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-38b53e6 [2022-11-25 18:35:15,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:35:15,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:35:15,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:35:15,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:35:15,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:35:15,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:35:15,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:35:15,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:35:15,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:35:15,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:35:15,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:35:15,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:35:15,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:35:15,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:35:15,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:35:15,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:35:15,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:35:15,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:35:15,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:35:15,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:35:15,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:35:15,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:35:15,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:35:15,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:35:15,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:35:15,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:35:15,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:35:15,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:35:15,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:35:15,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:35:15,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:35:15,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:35:15,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:35:15,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:35:15,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:35:15,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:35:15,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:35:15,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:35:15,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:35:15,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:35:15,169 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:35:15,192 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:35:15,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:35:15,193 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:35:15,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:35:15,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:35:15,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:35:15,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:35:15,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:35:15,196 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:35:15,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:35:15,197 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:35:15,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:35:15,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:35:15,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:35:15,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:35:15,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:35:15,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:35:15,199 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:35:15,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:35:15,199 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:35:15,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:35:15,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:35:15,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:35:15,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:35:15,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:35:15,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:35:15,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:35:15,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:35:15,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:35:15,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:35:15,202 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:35:15,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:35:15,203 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:35:15,203 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:35:15,203 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/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_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R 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 -> a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 [2022-11-25 18:35:15,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:35:15,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:35:15,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:35:15,508 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:35:15,509 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:35:15,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 18:35:18,564 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:35:18,851 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:35:18,851 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 18:35:18,867 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/data/025ea8a96/ba21a63f72ff43c3963467e095da9d4f/FLAGb21d282e3 [2022-11-25 18:35:18,881 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/data/025ea8a96/ba21a63f72ff43c3963467e095da9d4f [2022-11-25 18:35:18,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:35:18,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:35:18,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:35:18,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:35:18,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:35:18,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:35:18" (1/1) ... [2022-11-25 18:35:18,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37550495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:18, skipping insertion in model container [2022-11-25 18:35:18,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:35:18" (1/1) ... [2022-11-25 18:35:18,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:35:18,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:35:19,133 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 18:35:19,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:35:19,488 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:35:19,504 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 18:35:19,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:35:19,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:35:19,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:35:19,652 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:35:19,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19 WrapperNode [2022-11-25 18:35:19,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:35:19,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:35:19,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:35:19,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:35:19,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,717 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-25 18:35:19,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:35:19,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:35:19,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:35:19,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:35:19,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,760 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:35:19,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:35:19,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:35:19,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:35:19,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (1/1) ... [2022-11-25 18:35:19,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:35:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:19,804 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:35:19,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:35:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:35:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:35:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:35:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:35:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:35:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:35:19,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:35:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:35:19,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:35:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:35:19,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:35:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 18:35:19,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 18:35:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:35:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:35:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:35:19,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:35:19,863 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:35:20,090 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:35:20,092 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:35:20,522 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:35:20,642 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:35:20,643 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:35:20,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:35:20 BoogieIcfgContainer [2022-11-25 18:35:20,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:35:20,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:35:20,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:35:20,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:35:20,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:35:18" (1/3) ... [2022-11-25 18:35:20,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187e2bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:35:20, skipping insertion in model container [2022-11-25 18:35:20,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:19" (2/3) ... [2022-11-25 18:35:20,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187e2bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:35:20, skipping insertion in model container [2022-11-25 18:35:20,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:35:20" (3/3) ... [2022-11-25 18:35:20,655 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 18:35:20,665 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:35:20,677 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:35:20,677 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 18:35:20,677 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:35:20,738 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:35:20,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-11-25 18:35:20,833 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-11-25 18:35:20,833 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:35:20,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-25 18:35:20,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2022-11-25 18:35:20,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2022-11-25 18:35:20,849 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:35:20,864 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2022-11-25 18:35:20,867 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2022-11-25 18:35:20,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2022-11-25 18:35:20,900 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-11-25 18:35:20,900 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:35:20,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-25 18:35:20,904 INFO L119 LiptonReduction]: Number of co-enabled transitions 3548 [2022-11-25 18:35:27,101 INFO L134 LiptonReduction]: Checked pairs total: 10050 [2022-11-25 18:35:27,102 INFO L136 LiptonReduction]: Total number of compositions: 117 [2022-11-25 18:35:27,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:35:27,134 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;@71a61c52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:35:27,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 18:35:27,138 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-11-25 18:35:27,139 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:35:27,139 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:27,140 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 18:35:27,141 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:35:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash 576090, now seen corresponding path program 1 times [2022-11-25 18:35:27,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:27,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846402621] [2022-11-25 18:35:27,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:27,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,561 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-25 18:35:27,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846402621] [2022-11-25 18:35:27,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846402621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:27,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:27,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:35:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569094114] [2022-11-25 18:35:27,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:27,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:35:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:27,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:35:27,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:35:27,621 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 257 [2022-11-25 18:35:27,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-25 18:35:27,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:35:27,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 257 [2022-11-25 18:35:27,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:35:29,176 INFO L130 PetriNetUnfolder]: 5879/8047 cut-off events. [2022-11-25 18:35:29,176 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-11-25 18:35:29,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16191 conditions, 8047 events. 5879/8047 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 40976 event pairs, 3031 based on Foata normal form. 0/7705 useless extension candidates. Maximal degree in co-relation 16179. Up to 6367 conditions per place. [2022-11-25 18:35:29,237 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2022-11-25 18:35:29,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 219 flow [2022-11-25 18:35:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:35:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:35:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2022-11-25 18:35:29,261 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5473411154345007 [2022-11-25 18:35:29,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2022-11-25 18:35:29,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2022-11-25 18:35:29,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:35:29,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2022-11-25 18:35:29,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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-25 18:35:29,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-25 18:35:29,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-25 18:35:29,289 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 422 transitions. [2022-11-25 18:35:29,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 219 flow [2022-11-25 18:35:29,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 18:35:29,298 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 72 flow [2022-11-25 18:35:29,300 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-11-25 18:35:29,305 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2022-11-25 18:35:29,305 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 72 flow [2022-11-25 18:35:29,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-25 18:35:29,305 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:29,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:29,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:35:29,306 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:35:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash -617101754, now seen corresponding path program 1 times [2022-11-25 18:35:29,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:29,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734962360] [2022-11-25 18:35:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:29,612 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-25 18:35:29,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:29,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734962360] [2022-11-25 18:35:29,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734962360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:29,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:29,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:35:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404269872] [2022-11-25 18:35:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:29,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:35:29,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:29,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:35:29,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:35:29,655 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-11-25 18:35:29,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand 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-25 18:35:29,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:35:29,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-11-25 18:35:29,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:35:34,602 INFO L130 PetriNetUnfolder]: 25803/34900 cut-off events. [2022-11-25 18:35:34,603 INFO L131 PetriNetUnfolder]: For 1145/1145 co-relation queries the response was YES. [2022-11-25 18:35:34,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71520 conditions, 34900 events. 25803/34900 cut-off events. For 1145/1145 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 191584 event pairs, 9305 based on Foata normal form. 1428/36328 useless extension candidates. Maximal degree in co-relation 71510. Up to 20929 conditions per place. [2022-11-25 18:35:34,938 INFO L137 encePairwiseOnDemand]: 247/257 looper letters, 47 selfloop transitions, 8 changer transitions 37/92 dead transitions. [2022-11-25 18:35:34,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 92 transitions, 390 flow [2022-11-25 18:35:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:35:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:35:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2022-11-25 18:35:34,941 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5050583657587548 [2022-11-25 18:35:34,942 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2022-11-25 18:35:34,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2022-11-25 18:35:34,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:35:34,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2022-11-25 18:35:34,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 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-25 18:35:34,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-25 18:35:34,950 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-25 18:35:34,950 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 5 states and 649 transitions. [2022-11-25 18:35:34,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 92 transitions, 390 flow [2022-11-25 18:35:34,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 92 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:35:34,954 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 148 flow [2022-11-25 18:35:34,958 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-11-25 18:35:34,959 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2022-11-25 18:35:34,959 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 148 flow [2022-11-25 18:35:34,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-25 18:35:34,961 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:34,962 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:34,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:35:34,963 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:35:34,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:34,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1950246032, now seen corresponding path program 1 times [2022-11-25 18:35:34,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:34,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972747023] [2022-11-25 18:35:34,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:34,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:35,296 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-25 18:35:35,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:35,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972747023] [2022-11-25 18:35:35,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972747023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:35,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:35,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:35:35,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690655539] [2022-11-25 18:35:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:35,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:35:35,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:35,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:35:35,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:35:35,331 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-11-25 18:35:35,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 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-25 18:35:35,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:35:35,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-11-25 18:35:35,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:35:39,288 INFO L130 PetriNetUnfolder]: 22479/30596 cut-off events. [2022-11-25 18:35:39,288 INFO L131 PetriNetUnfolder]: For 21410/21410 co-relation queries the response was YES. [2022-11-25 18:35:39,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82390 conditions, 30596 events. 22479/30596 cut-off events. For 21410/21410 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 163031 event pairs, 5169 based on Foata normal form. 1344/31940 useless extension candidates. Maximal degree in co-relation 82376. Up to 13763 conditions per place. [2022-11-25 18:35:39,458 INFO L137 encePairwiseOnDemand]: 247/257 looper letters, 59 selfloop transitions, 9 changer transitions 51/119 dead transitions. [2022-11-25 18:35:39,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 119 transitions, 680 flow [2022-11-25 18:35:39,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:35:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:35:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2022-11-25 18:35:39,462 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4936075597554197 [2022-11-25 18:35:39,462 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2022-11-25 18:35:39,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2022-11-25 18:35:39,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:35:39,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2022-11-25 18:35:39,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 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-25 18:35:39,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-25 18:35:39,470 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-25 18:35:39,470 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 148 flow. Second operand 7 states and 888 transitions. [2022-11-25 18:35:39,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 119 transitions, 680 flow [2022-11-25 18:35:39,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 119 transitions, 626 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 18:35:39,680 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 214 flow [2022-11-25 18:35:39,681 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-11-25 18:35:39,681 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2022-11-25 18:35:39,682 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 214 flow [2022-11-25 18:35:39,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 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-25 18:35:39,682 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:39,683 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:39,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:35:39,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:35:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash -650773515, now seen corresponding path program 1 times [2022-11-25 18:35:39,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:39,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111122400] [2022-11-25 18:35:39,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:39,864 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-25 18:35:39,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:39,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111122400] [2022-11-25 18:35:39,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111122400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:39,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:39,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:35:39,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815838202] [2022-11-25 18:35:39,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:39,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:35:39,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:39,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:35:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:35:39,907 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-11-25 18:35:39,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:35:39,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:35:39,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-11-25 18:35:39,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:35:43,506 INFO L130 PetriNetUnfolder]: 20717/28244 cut-off events. [2022-11-25 18:35:43,506 INFO L131 PetriNetUnfolder]: For 40768/40768 co-relation queries the response was YES. [2022-11-25 18:35:43,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82434 conditions, 28244 events. 20717/28244 cut-off events. For 40768/40768 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 153546 event pairs, 5304 based on Foata normal form. 954/29198 useless extension candidates. Maximal degree in co-relation 82414. Up to 17209 conditions per place. [2022-11-25 18:35:43,676 INFO L137 encePairwiseOnDemand]: 247/257 looper letters, 65 selfloop transitions, 18 changer transitions 41/124 dead transitions. [2022-11-25 18:35:43,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 772 flow [2022-11-25 18:35:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:35:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:35:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2022-11-25 18:35:43,680 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49694274596998333 [2022-11-25 18:35:43,680 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2022-11-25 18:35:43,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2022-11-25 18:35:43,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:35:43,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2022-11-25 18:35:43,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 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-25 18:35:43,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-25 18:35:43,689 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-25 18:35:43,689 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 214 flow. Second operand 7 states and 894 transitions. [2022-11-25 18:35:43,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 124 transitions, 772 flow [2022-11-25 18:35:43,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 124 transitions, 753 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-11-25 18:35:43,986 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 321 flow [2022-11-25 18:35:43,986 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2022-11-25 18:35:43,988 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2022-11-25 18:35:43,988 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 321 flow [2022-11-25 18:35:43,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:35:43,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:43,989 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:43,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:35:43,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:35:43,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:43,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1302741793, now seen corresponding path program 1 times [2022-11-25 18:35:43,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:43,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033166911] [2022-11-25 18:35:43,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:43,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:44,205 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-25 18:35:44,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:44,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033166911] [2022-11-25 18:35:44,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033166911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:44,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:44,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:35:44,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534164239] [2022-11-25 18:35:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:44,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:35:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:44,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:35:44,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:35:44,222 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 257 [2022-11-25 18:35:44,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 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-25 18:35:44,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:35:44,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 257 [2022-11-25 18:35:44,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:35:47,204 INFO L130 PetriNetUnfolder]: 14082/20309 cut-off events. [2022-11-25 18:35:47,204 INFO L131 PetriNetUnfolder]: For 34412/35319 co-relation queries the response was YES. [2022-11-25 18:35:47,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59931 conditions, 20309 events. 14082/20309 cut-off events. For 34412/35319 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 124936 event pairs, 4187 based on Foata normal form. 952/20685 useless extension candidates. Maximal degree in co-relation 59907. Up to 11882 conditions per place. [2022-11-25 18:35:47,391 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 46 selfloop transitions, 4 changer transitions 26/91 dead transitions. [2022-11-25 18:35:47,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 629 flow [2022-11-25 18:35:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:35:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:35:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2022-11-25 18:35:47,395 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5229571984435798 [2022-11-25 18:35:47,395 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2022-11-25 18:35:47,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2022-11-25 18:35:47,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:35:47,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2022-11-25 18:35:47,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 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-25 18:35:47,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-25 18:35:47,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-25 18:35:47,402 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 321 flow. Second operand 5 states and 672 transitions. [2022-11-25 18:35:47,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 629 flow [2022-11-25 18:35:48,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 603 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-11-25 18:35:48,003 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 315 flow [2022-11-25 18:35:48,003 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2022-11-25 18:35:48,004 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2022-11-25 18:35:48,004 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 315 flow [2022-11-25 18:35:48,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 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-25 18:35:48,005 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:48,005 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:48,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:35:48,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:35:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash -855989042, now seen corresponding path program 1 times [2022-11-25 18:35:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:48,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116667722] [2022-11-25 18:35:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:48,183 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-25 18:35:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:48,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116667722] [2022-11-25 18:35:48,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116667722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:48,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:48,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:35:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721112158] [2022-11-25 18:35:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:48,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:35:48,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:48,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:35:48,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:35:48,204 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 18:35:48,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 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-25 18:35:48,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:35:48,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 18:35:48,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:35:49,973 INFO L130 PetriNetUnfolder]: 9955/14805 cut-off events. [2022-11-25 18:35:49,973 INFO L131 PetriNetUnfolder]: For 14388/15390 co-relation queries the response was YES. [2022-11-25 18:35:50,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39870 conditions, 14805 events. 9955/14805 cut-off events. For 14388/15390 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 94397 event pairs, 2030 based on Foata normal form. 1228/15488 useless extension candidates. Maximal degree in co-relation 39846. Up to 6608 conditions per place. [2022-11-25 18:35:50,088 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 65 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2022-11-25 18:35:50,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 629 flow [2022-11-25 18:35:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:35:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:35:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2022-11-25 18:35:50,096 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5175097276264592 [2022-11-25 18:35:50,096 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2022-11-25 18:35:50,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2022-11-25 18:35:50,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:35:50,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2022-11-25 18:35:50,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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-25 18:35:50,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 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-25 18:35:50,101 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 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-25 18:35:50,101 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 315 flow. Second operand 4 states and 532 transitions. [2022-11-25 18:35:50,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 629 flow [2022-11-25 18:35:50,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 615 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-25 18:35:50,168 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 347 flow [2022-11-25 18:35:50,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2022-11-25 18:35:50,173 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2022-11-25 18:35:50,173 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 347 flow [2022-11-25 18:35:50,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 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-25 18:35:50,174 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:50,174 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:50,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:35:50,174 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:35:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:50,175 INFO L85 PathProgramCache]: Analyzing trace with hash 640745553, now seen corresponding path program 1 times [2022-11-25 18:35:50,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:50,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393892142] [2022-11-25 18:35:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:50,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:50,786 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-25 18:35:50,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:50,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393892142] [2022-11-25 18:35:50,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393892142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:50,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:50,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:35:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449216413] [2022-11-25 18:35:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:50,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:35:50,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:50,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:35:50,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:35:50,803 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 18:35:50,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 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-25 18:35:50,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:35:50,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 18:35:50,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:35:52,294 INFO L130 PetriNetUnfolder]: 7677/11826 cut-off events. [2022-11-25 18:35:52,294 INFO L131 PetriNetUnfolder]: For 13570/14742 co-relation queries the response was YES. [2022-11-25 18:35:52,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37618 conditions, 11826 events. 7677/11826 cut-off events. For 13570/14742 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 77444 event pairs, 1811 based on Foata normal form. 834/12242 useless extension candidates. Maximal degree in co-relation 37594. Up to 4359 conditions per place. [2022-11-25 18:35:52,387 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 83 selfloop transitions, 10 changer transitions 0/111 dead transitions. [2022-11-25 18:35:52,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 111 transitions, 804 flow [2022-11-25 18:35:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:35:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:35:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2022-11-25 18:35:52,390 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5198443579766537 [2022-11-25 18:35:52,391 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2022-11-25 18:35:52,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2022-11-25 18:35:52,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:35:52,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2022-11-25 18:35:52,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 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-25 18:35:52,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-25 18:35:52,397 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-25 18:35:52,398 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 347 flow. Second operand 5 states and 668 transitions. [2022-11-25 18:35:52,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 111 transitions, 804 flow [2022-11-25 18:35:52,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 111 transitions, 801 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:35:52,421 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 412 flow [2022-11-25 18:35:52,421 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2022-11-25 18:35:52,422 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2022-11-25 18:35:52,422 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 412 flow [2022-11-25 18:35:52,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 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-25 18:35:52,423 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:52,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] [2022-11-25 18:35:52,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:35:52,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:35:52,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1914515956, now seen corresponding path program 1 times [2022-11-25 18:35:52,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:52,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493260556] [2022-11-25 18:35:52,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:52,786 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-25 18:35:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:52,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493260556] [2022-11-25 18:35:52,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493260556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:52,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:52,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:35:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158835043] [2022-11-25 18:35:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:52,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:35:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:52,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:35:52,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:35:52,802 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 18:35:52,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 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-25 18:35:52,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:35:52,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 18:35:52,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:35:54,290 INFO L130 PetriNetUnfolder]: 7020/10813 cut-off events. [2022-11-25 18:35:54,290 INFO L131 PetriNetUnfolder]: For 21814/22974 co-relation queries the response was YES. [2022-11-25 18:35:54,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38705 conditions, 10813 events. 7020/10813 cut-off events. For 21814/22974 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 70673 event pairs, 1734 based on Foata normal form. 362/10768 useless extension candidates. Maximal degree in co-relation 38678. Up to 4359 conditions per place. [2022-11-25 18:35:54,380 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 95 selfloop transitions, 14 changer transitions 0/127 dead transitions. [2022-11-25 18:35:54,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 127 transitions, 957 flow [2022-11-25 18:35:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:35:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:35:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2022-11-25 18:35:54,384 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5201037613488976 [2022-11-25 18:35:54,385 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 802 transitions. [2022-11-25 18:35:54,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 802 transitions. [2022-11-25 18:35:54,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:35:54,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 802 transitions. [2022-11-25 18:35:54,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 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-25 18:35:54,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 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-25 18:35:54,392 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 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-25 18:35:54,393 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 412 flow. Second operand 6 states and 802 transitions. [2022-11-25 18:35:54,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 127 transitions, 957 flow [2022-11-25 18:35:54,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 127 transitions, 941 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 18:35:54,432 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 482 flow [2022-11-25 18:35:54,432 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2022-11-25 18:35:54,433 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2022-11-25 18:35:54,433 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 482 flow [2022-11-25 18:35:54,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 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-25 18:35:54,434 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:54,434 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] [2022-11-25 18:35:54,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:35:54,435 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:35:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash -848275598, now seen corresponding path program 1 times [2022-11-25 18:35:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:54,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403891380] [2022-11-25 18:35:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:54,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:55,543 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-25 18:35:55,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:55,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403891380] [2022-11-25 18:35:55,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403891380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:55,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:55,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:35:55,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696101167] [2022-11-25 18:35:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:55,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:35:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:35:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:35:55,615 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 257 [2022-11-25 18:35:55,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 482 flow. Second operand has 8 states, 8 states have (on average 119.75) internal successors, (958), 8 states have internal predecessors, (958), 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-25 18:35:55,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:35:55,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 257 [2022-11-25 18:35:55,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:35:57,354 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][76], [60#L847true, 20#L798true, 240#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 187#(<= ~x~0 0), Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 213#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 259#(and (<= ~a$r_buff0_thd2~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff1_thd2~0 0) (<= 0 ~a$r_buff0_thd2~0) (= ~a$w_buff0~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 109#P0EXITtrue, Black: 202#(= ~__unbuffered_p1_EAX~0 0), P2Thread1of1ForFork0InUse, 185#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 215#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 82#L878-3true, Black: 223#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 163#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 112#L811true, 227#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (not (= 4 ~__unbuffered_cnt~0))), Black: 236#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 171#(<= ~__unbuffered_p3_EAX~0 0), Black: 242#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 172#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 169#true]) [2022-11-25 18:35:57,354 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-11-25 18:35:57,355 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-11-25 18:35:57,355 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-11-25 18:35:57,355 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-11-25 18:35:57,610 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][76], [60#L847true, 240#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 20#L798true, Black: 187#(<= ~x~0 0), Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 213#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 259#(and (<= ~a$r_buff0_thd2~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff1_thd2~0 0) (<= 0 ~a$r_buff0_thd2~0) (= ~a$w_buff0~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 109#P0EXITtrue, Black: 202#(= ~__unbuffered_p1_EAX~0 0), P2Thread1of1ForFork0InUse, 185#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 215#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 223#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 163#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 116#L881true, 112#L811true, 227#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (not (= 4 ~__unbuffered_cnt~0))), Black: 236#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 171#(<= ~__unbuffered_p3_EAX~0 0), Black: 172#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 242#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), 169#true]) [2022-11-25 18:35:57,610 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,610 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,610 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,610 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,613 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][76], [60#L847true, 20#L798true, 240#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 187#(<= ~x~0 0), Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 259#(and (<= ~a$r_buff0_thd2~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff1_thd2~0 0) (<= 0 ~a$r_buff0_thd2~0) (= ~a$w_buff0~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 109#P0EXITtrue, Black: 202#(= ~__unbuffered_p1_EAX~0 0), P2Thread1of1ForFork0InUse, 185#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 213#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 215#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 223#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 163#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 116#L881true, 112#L811true, 227#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (not (= 4 ~__unbuffered_cnt~0))), Black: 236#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 171#(<= ~__unbuffered_p3_EAX~0 0), Black: 242#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 172#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 169#true]) [2022-11-25 18:35:57,614 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,614 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,614 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,614 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,615 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][76], [60#L847true, Black: 187#(<= ~x~0 0), Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 213#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 259#(and (<= ~a$r_buff0_thd2~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff1_thd2~0 0) (<= 0 ~a$r_buff0_thd2~0) (= ~a$w_buff0~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 109#P0EXITtrue, Black: 202#(= ~__unbuffered_p1_EAX~0 0), P2Thread1of1ForFork0InUse, 185#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 242#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 215#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 82#L878-3true, 223#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 227#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (not (= 4 ~__unbuffered_cnt~0))), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 163#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 115#P1EXITtrue, 112#L811true, Black: 236#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 171#(<= ~__unbuffered_p3_EAX~0 0), Black: 172#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 169#true]) [2022-11-25 18:35:57,615 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,615 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,616 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,616 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:35:57,842 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][76], [60#L847true, Black: 187#(<= ~x~0 0), Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 213#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 259#(and (<= ~a$r_buff0_thd2~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff1_thd2~0 0) (<= 0 ~a$r_buff0_thd2~0) (= ~a$w_buff0~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 109#P0EXITtrue, Black: 202#(= ~__unbuffered_p1_EAX~0 0), P2Thread1of1ForFork0InUse, 185#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 242#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 215#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 223#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 227#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (not (= 4 ~__unbuffered_cnt~0))), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 163#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 115#P1EXITtrue, 116#L881true, 112#L811true, Black: 236#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 171#(<= ~__unbuffered_p3_EAX~0 0), Black: 172#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 169#true]) [2022-11-25 18:35:57,842 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,842 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,842 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,842 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,846 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][76], [60#L847true, Black: 187#(<= ~x~0 0), Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 259#(and (<= ~a$r_buff0_thd2~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff1_thd2~0 0) (<= 0 ~a$r_buff0_thd2~0) (= ~a$w_buff0~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 109#P0EXITtrue, Black: 202#(= ~__unbuffered_p1_EAX~0 0), P2Thread1of1ForFork0InUse, 185#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 242#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 213#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 215#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 223#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 227#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (not (= 4 ~__unbuffered_cnt~0))), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 163#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 115#P1EXITtrue, 116#L881true, 112#L811true, Black: 236#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 171#(<= ~__unbuffered_p3_EAX~0 0), Black: 172#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 169#true]) [2022-11-25 18:35:57,846 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,846 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,846 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,846 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,849 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][76], [60#L847true, Black: 187#(<= ~x~0 0), Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 259#(and (<= ~a$r_buff0_thd2~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff1_thd2~0 0) (<= 0 ~a$r_buff0_thd2~0) (= ~a$w_buff0~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 109#P0EXITtrue, Black: 202#(= ~__unbuffered_p1_EAX~0 0), P2Thread1of1ForFork0InUse, 185#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 213#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 242#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 2)), Black: 215#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 227#(and (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (not (= 4 ~__unbuffered_cnt~0))), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 223#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 163#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 116#L881true, 115#P1EXITtrue, 112#L811true, Black: 171#(<= ~__unbuffered_p3_EAX~0 0), Black: 236#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), Black: 172#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 169#true]) [2022-11-25 18:35:57,850 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,850 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,850 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:35:57,850 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:35:58,330 INFO L130 PetriNetUnfolder]: 10783/17349 cut-off events. [2022-11-25 18:35:58,331 INFO L131 PetriNetUnfolder]: For 53174/53967 co-relation queries the response was YES. [2022-11-25 18:35:58,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69000 conditions, 17349 events. 10783/17349 cut-off events. For 53174/53967 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 128876 event pairs, 1822 based on Foata normal form. 82/17028 useless extension candidates. Maximal degree in co-relation 68971. Up to 5563 conditions per place. [2022-11-25 18:35:58,487 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 109 selfloop transitions, 7 changer transitions 63/197 dead transitions. [2022-11-25 18:35:58,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 197 transitions, 1797 flow [2022-11-25 18:35:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:35:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:35:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1034 transitions. [2022-11-25 18:35:58,492 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5029182879377432 [2022-11-25 18:35:58,493 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1034 transitions. [2022-11-25 18:35:58,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1034 transitions. [2022-11-25 18:35:58,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:35:58,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1034 transitions. [2022-11-25 18:35:58,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.25) internal successors, (1034), 8 states have internal predecessors, (1034), 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-25 18:35:58,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 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-25 18:35:58,502 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 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-25 18:35:58,502 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 482 flow. Second operand 8 states and 1034 transitions. [2022-11-25 18:35:58,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 197 transitions, 1797 flow [2022-11-25 18:35:59,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 197 transitions, 1657 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-11-25 18:35:59,610 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 520 flow [2022-11-25 18:35:59,611 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2022-11-25 18:35:59,611 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2022-11-25 18:35:59,611 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 520 flow [2022-11-25 18:35:59,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.75) internal successors, (958), 8 states have internal predecessors, (958), 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-25 18:35:59,612 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:35:59,612 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] [2022-11-25 18:35:59,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:35:59,613 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:35:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash -570821042, now seen corresponding path program 2 times [2022-11-25 18:35:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:59,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184929171] [2022-11-25 18:35:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:00,290 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-25 18:36:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:00,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184929171] [2022-11-25 18:36:00,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184929171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:00,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:00,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:36:00,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731475996] [2022-11-25 18:36:00,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:00,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:36:00,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:00,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:36:00,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:36:00,306 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 18:36:00,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 520 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 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-25 18:36:00,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:36:00,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 18:36:00,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:36:02,549 INFO L130 PetriNetUnfolder]: 8785/13854 cut-off events. [2022-11-25 18:36:02,550 INFO L131 PetriNetUnfolder]: For 33351/34850 co-relation queries the response was YES. [2022-11-25 18:36:02,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55048 conditions, 13854 events. 8785/13854 cut-off events. For 33351/34850 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 98893 event pairs, 1781 based on Foata normal form. 270/13648 useless extension candidates. Maximal degree in co-relation 55022. Up to 5484 conditions per place. [2022-11-25 18:36:02,671 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 86 selfloop transitions, 18 changer transitions 2/124 dead transitions. [2022-11-25 18:36:02,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 124 transitions, 1017 flow [2022-11-25 18:36:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:36:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:36:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 908 transitions. [2022-11-25 18:36:02,678 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5047248471372985 [2022-11-25 18:36:02,678 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 908 transitions. [2022-11-25 18:36:02,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 908 transitions. [2022-11-25 18:36:02,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:36:02,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 908 transitions. [2022-11-25 18:36:02,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 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-25 18:36:02,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-25 18:36:02,687 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-25 18:36:02,687 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 520 flow. Second operand 7 states and 908 transitions. [2022-11-25 18:36:02,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 124 transitions, 1017 flow [2022-11-25 18:36:03,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 998 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-25 18:36:03,753 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 551 flow [2022-11-25 18:36:03,753 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=551, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2022-11-25 18:36:03,754 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2022-11-25 18:36:03,754 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 551 flow [2022-11-25 18:36:03,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 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-25 18:36:03,755 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:36:03,755 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] [2022-11-25 18:36:03,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:36:03,756 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:36:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1136625646, now seen corresponding path program 1 times [2022-11-25 18:36:03,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:03,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196763068] [2022-11-25 18:36:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:03,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:04,126 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-25 18:36:04,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:04,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196763068] [2022-11-25 18:36:04,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196763068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:04,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:04,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:36:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074201628] [2022-11-25 18:36:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:04,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:36:04,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:36:04,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:36:04,173 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2022-11-25 18:36:04,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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-25 18:36:04,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:36:04,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2022-11-25 18:36:04,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:36:07,573 INFO L130 PetriNetUnfolder]: 18807/27739 cut-off events. [2022-11-25 18:36:07,573 INFO L131 PetriNetUnfolder]: For 105573/105573 co-relation queries the response was YES. [2022-11-25 18:36:07,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122337 conditions, 27739 events. 18807/27739 cut-off events. For 105573/105573 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 180745 event pairs, 1907 based on Foata normal form. 1/27740 useless extension candidates. Maximal degree in co-relation 122305. Up to 10482 conditions per place. [2022-11-25 18:36:07,715 INFO L137 encePairwiseOnDemand]: 246/257 looper letters, 102 selfloop transitions, 22 changer transitions 84/208 dead transitions. [2022-11-25 18:36:07,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 208 transitions, 2089 flow [2022-11-25 18:36:07,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:36:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:36:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2022-11-25 18:36:07,718 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4841578654808227 [2022-11-25 18:36:07,718 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2022-11-25 18:36:07,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2022-11-25 18:36:07,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:36:07,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2022-11-25 18:36:07,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 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-25 18:36:07,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-25 18:36:07,725 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-25 18:36:07,725 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 551 flow. Second operand 7 states and 871 transitions. [2022-11-25 18:36:07,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 208 transitions, 2089 flow [2022-11-25 18:36:09,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 208 transitions, 1890 flow, removed 52 selfloop flow, removed 5 redundant places. [2022-11-25 18:36:09,142 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 545 flow [2022-11-25 18:36:09,143 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2022-11-25 18:36:09,143 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2022-11-25 18:36:09,144 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 545 flow [2022-11-25 18:36:09,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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-25 18:36:09,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:36:09,144 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] [2022-11-25 18:36:09,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:36:09,145 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:36:09,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash 157560824, now seen corresponding path program 2 times [2022-11-25 18:36:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:09,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081542237] [2022-11-25 18:36:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:09,471 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-25 18:36:09,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:09,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081542237] [2022-11-25 18:36:09,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081542237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:09,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:09,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:36:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803827779] [2022-11-25 18:36:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:09,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:36:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:36:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:36:09,518 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2022-11-25 18:36:09,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 545 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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-25 18:36:09,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:36:09,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2022-11-25 18:36:09,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:36:10,997 INFO L130 PetriNetUnfolder]: 5941/9270 cut-off events. [2022-11-25 18:36:10,997 INFO L131 PetriNetUnfolder]: For 30535/30535 co-relation queries the response was YES. [2022-11-25 18:36:11,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38507 conditions, 9270 events. 5941/9270 cut-off events. For 30535/30535 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 55548 event pairs, 882 based on Foata normal form. 1/9271 useless extension candidates. Maximal degree in co-relation 38482. Up to 2857 conditions per place. [2022-11-25 18:36:11,074 INFO L137 encePairwiseOnDemand]: 246/257 looper letters, 93 selfloop transitions, 14 changer transitions 73/180 dead transitions. [2022-11-25 18:36:11,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 180 transitions, 1730 flow [2022-11-25 18:36:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:36:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:36:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-11-25 18:36:11,077 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4785992217898833 [2022-11-25 18:36:11,077 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2022-11-25 18:36:11,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2022-11-25 18:36:11,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:36:11,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2022-11-25 18:36:11,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 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-25 18:36:11,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-25 18:36:11,084 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-25 18:36:11,084 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 545 flow. Second operand 7 states and 861 transitions. [2022-11-25 18:36:11,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 180 transitions, 1730 flow [2022-11-25 18:36:11,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 180 transitions, 1357 flow, removed 53 selfloop flow, removed 14 redundant places. [2022-11-25 18:36:11,349 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 365 flow [2022-11-25 18:36:11,350 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=365, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2022-11-25 18:36:11,350 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2022-11-25 18:36:11,351 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 365 flow [2022-11-25 18:36:11,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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-25 18:36:11,351 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:36:11,351 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] [2022-11-25 18:36:11,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:36:11,352 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:36:11,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash -438377564, now seen corresponding path program 3 times [2022-11-25 18:36:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:11,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015308627] [2022-11-25 18:36:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:12,628 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-25 18:36:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:12,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015308627] [2022-11-25 18:36:12,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015308627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:12,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:12,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:36:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442865204] [2022-11-25 18:36:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:12,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:36:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:36:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:36:12,763 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 257 [2022-11-25 18:36:12,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 365 flow. Second operand has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 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-25 18:36:12,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:36:12,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 257 [2022-11-25 18:36:12,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:36:13,921 INFO L130 PetriNetUnfolder]: 2596/4519 cut-off events. [2022-11-25 18:36:13,921 INFO L131 PetriNetUnfolder]: For 8465/8659 co-relation queries the response was YES. [2022-11-25 18:36:13,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15027 conditions, 4519 events. 2596/4519 cut-off events. For 8465/8659 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 30174 event pairs, 388 based on Foata normal form. 68/4476 useless extension candidates. Maximal degree in co-relation 15008. Up to 2551 conditions per place. [2022-11-25 18:36:13,941 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 70 selfloop transitions, 6 changer transitions 37/126 dead transitions. [2022-11-25 18:36:13,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 126 transitions, 876 flow [2022-11-25 18:36:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:36:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:36:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1003 transitions. [2022-11-25 18:36:13,945 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48784046692607 [2022-11-25 18:36:13,945 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1003 transitions. [2022-11-25 18:36:13,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1003 transitions. [2022-11-25 18:36:13,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:36:13,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1003 transitions. [2022-11-25 18:36:13,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.375) internal successors, (1003), 8 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-25 18:36:13,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 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-25 18:36:13,953 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 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-25 18:36:13,953 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 365 flow. Second operand 8 states and 1003 transitions. [2022-11-25 18:36:13,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 126 transitions, 876 flow [2022-11-25 18:36:13,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 126 transitions, 808 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-11-25 18:36:13,977 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 335 flow [2022-11-25 18:36:13,977 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=335, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2022-11-25 18:36:13,978 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2022-11-25 18:36:13,978 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 335 flow [2022-11-25 18:36:13,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 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-25 18:36:13,979 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:36:13,979 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] [2022-11-25 18:36:13,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:36:13,979 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 18:36:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1941654294, now seen corresponding path program 4 times [2022-11-25 18:36:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:13,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99226532] [2022-11-25 18:36:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:36:14,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:36:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:36:14,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:36:14,216 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:36:14,217 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 18:36:14,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 18:36:14,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 18:36:14,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 18:36:14,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 18:36:14,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 18:36:14,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 18:36:14,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:36:14,223 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:14,232 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:36:14,232 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:36:14,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:36:14 BasicIcfg [2022-11-25 18:36:14,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:36:14,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:36:14,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:36:14,385 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:36:14,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:35:20" (3/4) ... [2022-11-25 18:36:14,388 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:36:14,509 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:36:14,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:36:14,510 INFO L158 Benchmark]: Toolchain (without parser) took 55624.05ms. Allocated memory was 184.5MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 139.2MB in the beginning and 7.2GB in the end (delta: -7.0GB). Peak memory consumption was 771.3MB. Max. memory is 16.1GB. [2022-11-25 18:36:14,510 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 138.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:36:14,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.61ms. Allocated memory is still 184.5MB. Free memory was 138.6MB in the beginning and 110.4MB in the end (delta: 28.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 18:36:14,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.02ms. Allocated memory is still 184.5MB. Free memory was 110.4MB in the beginning and 107.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:36:14,511 INFO L158 Benchmark]: Boogie Preprocessor took 42.85ms. Allocated memory is still 184.5MB. Free memory was 107.7MB in the beginning and 105.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:36:14,511 INFO L158 Benchmark]: RCFGBuilder took 879.08ms. Allocated memory is still 184.5MB. Free memory was 105.7MB in the beginning and 127.5MB in the end (delta: -21.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-11-25 18:36:14,512 INFO L158 Benchmark]: TraceAbstraction took 53736.25ms. Allocated memory was 184.5MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 126.5MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-25 18:36:14,512 INFO L158 Benchmark]: Witness Printer took 124.38ms. Allocated memory is still 8.0GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 18:36:14,514 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.29ms. Allocated memory is still 138.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.61ms. Allocated memory is still 184.5MB. Free memory was 138.6MB in the beginning and 110.4MB in the end (delta: 28.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.02ms. Allocated memory is still 184.5MB. Free memory was 110.4MB in the beginning and 107.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.85ms. Allocated memory is still 184.5MB. Free memory was 107.7MB in the beginning and 105.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 879.08ms. Allocated memory is still 184.5MB. Free memory was 105.7MB in the beginning and 127.5MB in the end (delta: -21.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 53736.25ms. Allocated memory was 184.5MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 126.5MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 124.38ms. Allocated memory is still 8.0GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 147 PlacesBefore, 45 PlacesAfterwards, 136 TransitionsBefore, 33 TransitionsAfterwards, 3548 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 10050 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4884, independent: 4643, independent conditional: 0, independent unconditional: 4643, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2481, independent: 2400, independent conditional: 0, independent unconditional: 2400, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2481, independent: 2368, independent conditional: 0, independent unconditional: 2368, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 113, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 856, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 799, dependent conditional: 0, dependent unconditional: 799, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4884, independent: 2243, independent conditional: 0, independent unconditional: 2243, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 2481, unknown conditional: 0, unknown unconditional: 2481] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 279, Positive conditional cache size: 0, Positive unconditional cache size: 279, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t353; [L872] FCALL, FORK 0 pthread_create(&t353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t353, ((void *)0), P0, ((void *)0))=-3, t353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t354; [L874] FCALL, FORK 0 pthread_create(&t354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t354, ((void *)0), P1, ((void *)0))=-2, t353={5:0}, t354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t355; [L876] FCALL, FORK 0 pthread_create(&t355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t355, ((void *)0), P2, ((void *)0))=-1, t353={5:0}, t354={6:0}, t355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t356; [L878] FCALL, FORK 0 pthread_create(&t356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t356, ((void *)0), P3, ((void *)0))=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L787] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L793] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=49, weak$$choice2=255, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=2, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=49, weak$$choice2=255, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 874]: 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: 872]: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1242 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1114 mSDsluCounter, 555 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 462 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2386 IncrementalHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 93 mSDtfsCounter, 2386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=10, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 2206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-25 18:36:14,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953e9339-67e9-4d1e-ad09-d20b85932b92/bin/uautomizer-ZsLfNo2U6R/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