./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8 --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 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --- 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-2329fc7 [2022-12-13 15:45:46,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:45:46,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:45:46,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:45:46,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:45:46,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:45:46,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:45:46,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:45:46,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:45:46,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:45:46,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:45:46,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:45:46,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:45:46,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:45:46,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:45:46,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:45:46,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:45:46,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:45:46,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:45:46,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:45:46,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:45:46,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:45:46,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:45:46,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:45:46,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:45:46,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:45:46,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:45:46,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:45:46,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:45:46,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:45:46,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:45:46,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:45:46,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:45:46,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:45:46,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:45:46,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:45:46,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:45:46,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:45:46,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:45:46,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:45:46,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:45:46,152 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 15:45:46,170 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:45:46,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:45:46,171 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:45:46,171 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:45:46,172 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:45:46,172 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:45:46,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:45:46,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:45:46,173 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:45:46,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:45:46,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:45:46,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:45:46,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:45:46,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:45:46,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 15:45:46,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:45:46,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 15:45:46,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:45:46,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:45:46,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:45:46,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 15:45:46,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:45:46,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:45:46,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:45:46,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:45:46,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:45:46,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:45:46,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 15:45:46,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:45:46,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:45:46,176 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:45:46,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 15:45:46,177 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:45:46,177 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:45:46,177 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:45:46,177 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_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/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_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8 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 -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc [2022-12-13 15:45:46,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:45:46,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:45:46,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:45:46,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:45:46,397 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:45:46,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:45:48,956 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:45:49,140 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:45:49,141 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:45:49,150 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/data/fbbd93ee3/0fbda6899d57465b93c0720cd8f79681/FLAGeac01c5b1 [2022-12-13 15:45:49,161 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/data/fbbd93ee3/0fbda6899d57465b93c0720cd8f79681 [2022-12-13 15:45:49,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:45:49,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:45:49,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:45:49,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:45:49,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:45:49,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7209f04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49, skipping insertion in model container [2022-12-13 15:45:49,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:45:49,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:45:49,322 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_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 15:45:49,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:45:49,479 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:45:49,489 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_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 15:45:49,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:45:49,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:45:49,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:45:49,549 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:45:49,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49 WrapperNode [2022-12-13 15:45:49,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:45:49,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:45:49,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:45:49,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:45:49,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,593 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 15:45:49,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:45:49,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:45:49,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:45:49,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:45:49,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,622 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:45:49,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:45:49,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:45:49,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:45:49,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (1/1) ... [2022-12-13 15:45:49,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:45:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:45:49,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:45:49,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:45:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 15:45:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:45:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:45:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:45:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:45:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:45:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:45:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:45:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:45:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:45:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:45:49,689 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 15:45:49,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 15:45:49,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:45:49,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:45:49,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:45:49,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:45:49,690 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 15:45:49,801 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:45:49,803 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:45:50,095 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:45:50,198 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:45:50,198 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:45:50,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:45:50 BoogieIcfgContainer [2022-12-13 15:45:50,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:45:50,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:45:50,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:45:50,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:45:50,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:45:49" (1/3) ... [2022-12-13 15:45:50,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e02735b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:45:50, skipping insertion in model container [2022-12-13 15:45:50,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:49" (2/3) ... [2022-12-13 15:45:50,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e02735b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:45:50, skipping insertion in model container [2022-12-13 15:45:50,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:45:50" (3/3) ... [2022-12-13 15:45:50,209 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:45:50,217 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 15:45:50,227 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:45:50,228 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 15:45:50,228 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:45:50,280 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:45:50,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-12-13 15:45:50,374 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 15:45:50,374 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:45:50,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-12-13 15:45:50,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-12-13 15:45:50,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-12-13 15:45:50,387 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:45:50,398 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2022-12-13 15:45:50,400 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2022-12-13 15:45:50,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2022-12-13 15:45:50,430 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 15:45:50,430 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:45:50,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-12-13 15:45:50,433 INFO L119 LiptonReduction]: Number of co-enabled transitions 3404 [2022-12-13 15:45:53,407 INFO L134 LiptonReduction]: Checked pairs total: 10085 [2022-12-13 15:45:53,407 INFO L136 LiptonReduction]: Total number of compositions: 114 [2022-12-13 15:45:53,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:45:53,422 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;@173a106b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:45:53,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 15:45:53,423 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 15:45:53,424 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:45:53,424 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:45:53,426 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:45:53,427 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-12-13 15:45:53,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:45:53,430 INFO L85 PathProgramCache]: Analyzing trace with hash 566248, now seen corresponding path program 1 times [2022-12-13 15:45:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:45:53,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733363099] [2022-12-13 15:45:53,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:45:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:45:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:45:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:45:53,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:45:53,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733363099] [2022-12-13 15:45:53,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733363099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:45:53,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:45:53,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:45:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851964036] [2022-12-13 15:45:53,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:45:53,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:45:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:45:53,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:45:53,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:45:53,724 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 251 [2022-12-13 15:45:53,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:53,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:45:53,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 251 [2022-12-13 15:45:53,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:45:54,891 INFO L130 PetriNetUnfolder]: 6855/9374 cut-off events. [2022-12-13 15:45:54,891 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-13 15:45:54,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18814 conditions, 9374 events. 6855/9374 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 47059 event pairs, 3527 based on Foata normal form. 320/9025 useless extension candidates. Maximal degree in co-relation 18802. Up to 7399 conditions per place. [2022-12-13 15:45:54,939 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 43 selfloop transitions, 2 changer transitions 4/53 dead transitions. [2022-12-13 15:45:54,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 225 flow [2022-12-13 15:45:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:45:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:45:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2022-12-13 15:45:54,955 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5511288180610889 [2022-12-13 15:45:54,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2022-12-13 15:45:54,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2022-12-13 15:45:54,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:45:54,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2022-12-13 15:45:54,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:54,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:54,971 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:54,973 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 415 transitions. [2022-12-13 15:45:54,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 225 flow [2022-12-13 15:45:54,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 15:45:54,980 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2022-12-13 15:45:54,982 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, 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=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-13 15:45:54,985 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2022-12-13 15:45:54,985 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2022-12-13 15:45:54,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:54,986 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:45:54,986 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:45:54,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:45:54,987 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-12-13 15:45:54,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:45:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash -346600587, now seen corresponding path program 1 times [2022-12-13 15:45:54,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:45:54,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277948725] [2022-12-13 15:45:54,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:45:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:45:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:45:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:45:55,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:45:55,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277948725] [2022-12-13 15:45:55,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277948725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:45:55,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:45:55,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:45:55,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574863862] [2022-12-13 15:45:55,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:45:55,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:45:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:45:55,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:45:55,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:45:55,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 15:45:55,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:55,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:45:55,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 15:45:55,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:45:57,838 INFO L130 PetriNetUnfolder]: 24071/32606 cut-off events. [2022-12-13 15:45:57,838 INFO L131 PetriNetUnfolder]: For 1485/1485 co-relation queries the response was YES. [2022-12-13 15:45:57,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67194 conditions, 32606 events. 24071/32606 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 180572 event pairs, 7406 based on Foata normal form. 1344/33950 useless extension candidates. Maximal degree in co-relation 67184. Up to 16320 conditions per place. [2022-12-13 15:45:57,966 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 45 selfloop transitions, 8 changer transitions 35/88 dead transitions. [2022-12-13 15:45:57,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 374 flow [2022-12-13 15:45:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:45:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:45:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2022-12-13 15:45:57,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5059760956175299 [2022-12-13 15:45:57,969 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2022-12-13 15:45:57,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2022-12-13 15:45:57,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:45:57,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2022-12-13 15:45:57,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:57,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:57,973 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:57,974 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 635 transitions. [2022-12-13 15:45:57,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 374 flow [2022-12-13 15:45:57,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 88 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:45:57,976 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 146 flow [2022-12-13 15:45:57,976 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-13 15:45:57,976 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2022-12-13 15:45:57,977 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 146 flow [2022-12-13 15:45:57,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:57,977 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:45:57,977 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:45:57,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:45:57,977 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-12-13 15:45:57,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:45:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2140264001, now seen corresponding path program 1 times [2022-12-13 15:45:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:45:57,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775294582] [2022-12-13 15:45:57,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:45:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:45:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:45:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:45:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:45:58,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775294582] [2022-12-13 15:45:58,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775294582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:45:58,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:45:58,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:45:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716125956] [2022-12-13 15:45:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:45:58,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:45:58,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:45:58,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:45:58,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:45:58,131 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 15:45:58,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:45:58,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:45:58,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 15:45:58,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:00,702 INFO L130 PetriNetUnfolder]: 20975/28640 cut-off events. [2022-12-13 15:46:00,703 INFO L131 PetriNetUnfolder]: For 22629/22629 co-relation queries the response was YES. [2022-12-13 15:46:00,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78592 conditions, 28640 events. 20975/28640 cut-off events. For 22629/22629 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 154281 event pairs, 4383 based on Foata normal form. 1302/29942 useless extension candidates. Maximal degree in co-relation 78578. Up to 11177 conditions per place. [2022-12-13 15:46:00,847 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 58 selfloop transitions, 9 changer transitions 51/118 dead transitions. [2022-12-13 15:46:00,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 118 transitions, 688 flow [2022-12-13 15:46:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:46:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:46:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2022-12-13 15:46:00,850 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49630051223676724 [2022-12-13 15:46:00,850 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2022-12-13 15:46:00,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2022-12-13 15:46:00,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:00,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2022-12-13 15:46:00,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:00,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:00,854 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:00,854 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 146 flow. Second operand 7 states and 872 transitions. [2022-12-13 15:46:00,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 118 transitions, 688 flow [2022-12-13 15:46:00,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 118 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:46:00,911 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 214 flow [2022-12-13 15:46:00,911 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2022-12-13 15:46:00,911 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2022-12-13 15:46:00,911 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 214 flow [2022-12-13 15:46:00,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:00,912 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:00,912 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:46:00,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:46:00,912 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-12-13 15:46:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1997961343, now seen corresponding path program 1 times [2022-12-13 15:46:00,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:00,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745501802] [2022-12-13 15:46:00,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:00,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:01,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:01,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745501802] [2022-12-13 15:46:01,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745501802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:01,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:01,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:46:01,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730427883] [2022-12-13 15:46:01,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:01,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:46:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:46:01,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:46:01,040 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 15:46:01,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:01,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:01,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 15:46:01,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:03,495 INFO L130 PetriNetUnfolder]: 19314/26406 cut-off events. [2022-12-13 15:46:03,495 INFO L131 PetriNetUnfolder]: For 50277/50277 co-relation queries the response was YES. [2022-12-13 15:46:03,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79752 conditions, 26406 events. 19314/26406 cut-off events. For 50277/50277 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 145142 event pairs, 2346 based on Foata normal form. 905/27311 useless extension candidates. Maximal degree in co-relation 79732. Up to 13278 conditions per place. [2022-12-13 15:46:03,610 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 65 selfloop transitions, 19 changer transitions 45/129 dead transitions. [2022-12-13 15:46:03,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 129 transitions, 862 flow [2022-12-13 15:46:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:46:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:46:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2022-12-13 15:46:03,613 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4985771200910643 [2022-12-13 15:46:03,613 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2022-12-13 15:46:03,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2022-12-13 15:46:03,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:03,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2022-12-13 15:46:03,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:03,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:03,619 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:03,619 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 214 flow. Second operand 7 states and 876 transitions. [2022-12-13 15:46:03,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 129 transitions, 862 flow [2022-12-13 15:46:03,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 129 transitions, 845 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 15:46:03,835 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 406 flow [2022-12-13 15:46:03,835 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=406, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2022-12-13 15:46:03,835 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2022-12-13 15:46:03,835 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 406 flow [2022-12-13 15:46:03,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:03,836 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:03,836 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:46:03,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:46:03,836 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-12-13 15:46:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1808766828, now seen corresponding path program 1 times [2022-12-13 15:46:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:03,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891475047] [2022-12-13 15:46:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:03,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:03,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:03,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891475047] [2022-12-13 15:46:03,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891475047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:03,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:03,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:46:03,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051389307] [2022-12-13 15:46:03,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:03,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:46:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:46:03,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:46:03,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 15:46:03,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:03,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:03,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 15:46:03,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:06,746 INFO L130 PetriNetUnfolder]: 18392/25137 cut-off events. [2022-12-13 15:46:06,746 INFO L131 PetriNetUnfolder]: For 72828/72828 co-relation queries the response was YES. [2022-12-13 15:46:06,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85111 conditions, 25137 events. 18392/25137 cut-off events. For 72828/72828 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 136466 event pairs, 3361 based on Foata normal form. 718/25855 useless extension candidates. Maximal degree in co-relation 85085. Up to 12884 conditions per place. [2022-12-13 15:46:06,856 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 67 selfloop transitions, 29 changer transitions 38/134 dead transitions. [2022-12-13 15:46:06,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 134 transitions, 1044 flow [2022-12-13 15:46:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:46:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:46:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2022-12-13 15:46:06,859 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4991462720546386 [2022-12-13 15:46:06,859 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2022-12-13 15:46:06,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2022-12-13 15:46:06,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:06,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2022-12-13 15:46:06,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:06,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:06,863 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:06,863 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 406 flow. Second operand 7 states and 877 transitions. [2022-12-13 15:46:06,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 134 transitions, 1044 flow [2022-12-13 15:46:07,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 134 transitions, 1012 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 15:46:07,209 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 566 flow [2022-12-13 15:46:07,209 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=566, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2022-12-13 15:46:07,210 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2022-12-13 15:46:07,210 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 566 flow [2022-12-13 15:46:07,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:07,210 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:07,210 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:46:07,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 15:46:07,210 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-12-13 15:46:07,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:07,210 INFO L85 PathProgramCache]: Analyzing trace with hash 209955844, now seen corresponding path program 1 times [2022-12-13 15:46:07,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:07,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184918302] [2022-12-13 15:46:07,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:07,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:07,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184918302] [2022-12-13 15:46:07,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184918302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:07,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:07,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:46:07,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572566803] [2022-12-13 15:46:07,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:07,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:46:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:07,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:46:07,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:46:07,375 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 15:46:07,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 566 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:07,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:07,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 15:46:07,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:10,588 INFO L130 PetriNetUnfolder]: 24728/33965 cut-off events. [2022-12-13 15:46:10,588 INFO L131 PetriNetUnfolder]: For 127326/127326 co-relation queries the response was YES. [2022-12-13 15:46:10,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118894 conditions, 33965 events. 24728/33965 cut-off events. For 127326/127326 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 194274 event pairs, 4359 based on Foata normal form. 864/34829 useless extension candidates. Maximal degree in co-relation 118863. Up to 14073 conditions per place. [2022-12-13 15:46:10,721 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 69 selfloop transitions, 31 changer transitions 43/143 dead transitions. [2022-12-13 15:46:10,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 143 transitions, 1259 flow [2022-12-13 15:46:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:46:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:46:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2022-12-13 15:46:10,724 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4991462720546386 [2022-12-13 15:46:10,724 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2022-12-13 15:46:10,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2022-12-13 15:46:10,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:10,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2022-12-13 15:46:10,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:10,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:10,728 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:10,728 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 566 flow. Second operand 7 states and 877 transitions. [2022-12-13 15:46:10,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 143 transitions, 1259 flow [2022-12-13 15:46:11,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 143 transitions, 1225 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-13 15:46:11,628 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 738 flow [2022-12-13 15:46:11,628 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=738, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2022-12-13 15:46:11,628 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2022-12-13 15:46:11,628 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 738 flow [2022-12-13 15:46:11,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:11,629 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:11,629 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:46:11,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 15:46:11,629 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-12-13 15:46:11,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash 211922050, now seen corresponding path program 1 times [2022-12-13 15:46:11,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:11,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756483077] [2022-12-13 15:46:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:11,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:11,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:11,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756483077] [2022-12-13 15:46:11,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756483077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:11,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:11,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:46:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924917022] [2022-12-13 15:46:11,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:11,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:46:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:11,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:46:11,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:46:11,715 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 251 [2022-12-13 15:46:11,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:11,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:11,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 251 [2022-12-13 15:46:11,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:13,367 INFO L130 PetriNetUnfolder]: 10029/14896 cut-off events. [2022-12-13 15:46:13,367 INFO L131 PetriNetUnfolder]: For 58048/59643 co-relation queries the response was YES. [2022-12-13 15:46:13,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49736 conditions, 14896 events. 10029/14896 cut-off events. For 58048/59643 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 93002 event pairs, 2478 based on Foata normal form. 811/15400 useless extension candidates. Maximal degree in co-relation 49702. Up to 12700 conditions per place. [2022-12-13 15:46:13,440 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 67 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2022-12-13 15:46:13,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 1160 flow [2022-12-13 15:46:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:46:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:46:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2022-12-13 15:46:13,442 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5258964143426295 [2022-12-13 15:46:13,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2022-12-13 15:46:13,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2022-12-13 15:46:13,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:13,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2022-12-13 15:46:13,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:13,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:13,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:13,444 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 738 flow. Second operand 3 states and 396 transitions. [2022-12-13 15:46:13,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 1160 flow [2022-12-13 15:46:13,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 96 transitions, 1148 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 15:46:13,534 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 761 flow [2022-12-13 15:46:13,534 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=761, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2022-12-13 15:46:13,534 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2022-12-13 15:46:13,534 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 761 flow [2022-12-13 15:46:13,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:13,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:13,535 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-12-13 15:46:13,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 15:46:13,535 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-12-13 15:46:13,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:13,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1927289334, now seen corresponding path program 1 times [2022-12-13 15:46:13,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:13,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392433356] [2022-12-13 15:46:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:13,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:13,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392433356] [2022-12-13 15:46:13,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392433356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:13,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:13,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:46:13,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754796182] [2022-12-13 15:46:13,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:13,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:46:13,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:13,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:46:13,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:46:13,719 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-12-13 15:46:13,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 761 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:13,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:13,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-12-13 15:46:13,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:17,021 INFO L130 PetriNetUnfolder]: 18255/26511 cut-off events. [2022-12-13 15:46:17,021 INFO L131 PetriNetUnfolder]: For 126528/126528 co-relation queries the response was YES. [2022-12-13 15:46:17,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104196 conditions, 26511 events. 18255/26511 cut-off events. For 126528/126528 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 164019 event pairs, 5504 based on Foata normal form. 528/27039 useless extension candidates. Maximal degree in co-relation 104161. Up to 12706 conditions per place. [2022-12-13 15:46:17,148 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 88 selfloop transitions, 24 changer transitions 47/159 dead transitions. [2022-12-13 15:46:17,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 159 transitions, 1634 flow [2022-12-13 15:46:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:46:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:46:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2022-12-13 15:46:17,151 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4985771200910643 [2022-12-13 15:46:17,151 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2022-12-13 15:46:17,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2022-12-13 15:46:17,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:17,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2022-12-13 15:46:17,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:17,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:17,155 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:17,155 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 761 flow. Second operand 7 states and 876 transitions. [2022-12-13 15:46:17,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 159 transitions, 1634 flow [2022-12-13 15:46:17,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 159 transitions, 1621 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:46:17,338 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 868 flow [2022-12-13 15:46:17,338 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=868, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2022-12-13 15:46:17,339 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2022-12-13 15:46:17,339 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 868 flow [2022-12-13 15:46:17,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:17,339 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:17,339 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-12-13 15:46:17,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 15:46:17,340 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-12-13 15:46:17,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash 297251157, now seen corresponding path program 1 times [2022-12-13 15:46:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:17,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958525654] [2022-12-13 15:46:17,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:17,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:17,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:17,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958525654] [2022-12-13 15:46:17,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958525654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:17,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:17,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:46:17,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844335520] [2022-12-13 15:46:17,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:17,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:46:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:17,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:46:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:46:17,448 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 251 [2022-12-13 15:46:17,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 868 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:17,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:17,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 251 [2022-12-13 15:46:17,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:18,532 INFO L130 PetriNetUnfolder]: 5657/9046 cut-off events. [2022-12-13 15:46:18,533 INFO L131 PetriNetUnfolder]: For 42889/43316 co-relation queries the response was YES. [2022-12-13 15:46:18,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33360 conditions, 9046 events. 5657/9046 cut-off events. For 42889/43316 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 58257 event pairs, 1183 based on Foata normal form. 900/9781 useless extension candidates. Maximal degree in co-relation 33318. Up to 4710 conditions per place. [2022-12-13 15:46:18,571 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 90 selfloop transitions, 9 changer transitions 3/124 dead transitions. [2022-12-13 15:46:18,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 124 transitions, 1675 flow [2022-12-13 15:46:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:46:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:46:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2022-12-13 15:46:18,573 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5278884462151394 [2022-12-13 15:46:18,573 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2022-12-13 15:46:18,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2022-12-13 15:46:18,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:18,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2022-12-13 15:46:18,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:18,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:18,575 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:18,575 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 868 flow. Second operand 4 states and 530 transitions. [2022-12-13 15:46:18,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 124 transitions, 1675 flow [2022-12-13 15:46:18,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 124 transitions, 1649 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 15:46:18,619 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 881 flow [2022-12-13 15:46:18,619 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=881, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2022-12-13 15:46:18,619 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2022-12-13 15:46:18,620 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 881 flow [2022-12-13 15:46:18,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:18,620 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:18,620 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-12-13 15:46:18,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 15:46:18,620 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-12-13 15:46:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash -900822469, now seen corresponding path program 1 times [2022-12-13 15:46:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:18,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747846582] [2022-12-13 15:46:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:18,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:18,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747846582] [2022-12-13 15:46:18,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747846582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:18,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:18,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:46:18,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423785065] [2022-12-13 15:46:18,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:18,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:46:18,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:18,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:46:18,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:46:18,756 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2022-12-13 15:46:18,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 881 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:18,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:18,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2022-12-13 15:46:18,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:20,708 INFO L130 PetriNetUnfolder]: 9206/14323 cut-off events. [2022-12-13 15:46:20,708 INFO L131 PetriNetUnfolder]: For 92964/92964 co-relation queries the response was YES. [2022-12-13 15:46:20,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62061 conditions, 14323 events. 9206/14323 cut-off events. For 92964/92964 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 90883 event pairs, 1161 based on Foata normal form. 180/14503 useless extension candidates. Maximal degree in co-relation 62018. Up to 7270 conditions per place. [2022-12-13 15:46:20,796 INFO L137 encePairwiseOnDemand]: 240/251 looper letters, 100 selfloop transitions, 41 changer transitions 34/175 dead transitions. [2022-12-13 15:46:20,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 175 transitions, 2133 flow [2022-12-13 15:46:20,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:46:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:46:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2022-12-13 15:46:20,801 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48662492885600456 [2022-12-13 15:46:20,801 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2022-12-13 15:46:20,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2022-12-13 15:46:20,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:20,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2022-12-13 15:46:20,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:20,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:20,809 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:20,810 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 881 flow. Second operand 7 states and 855 transitions. [2022-12-13 15:46:20,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 175 transitions, 2133 flow [2022-12-13 15:46:20,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 175 transitions, 2063 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-13 15:46:20,991 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 1290 flow [2022-12-13 15:46:20,991 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1290, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2022-12-13 15:46:20,992 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2022-12-13 15:46:20,992 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 1290 flow [2022-12-13 15:46:20,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:20,993 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:20,993 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-12-13 15:46:20,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:46:20,993 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-12-13 15:46:20,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:20,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1764506249, now seen corresponding path program 2 times [2022-12-13 15:46:20,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:20,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248870803] [2022-12-13 15:46:20,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:20,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:21,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:21,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248870803] [2022-12-13 15:46:21,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248870803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:21,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:21,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:46:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958681729] [2022-12-13 15:46:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:21,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:46:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:21,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:46:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:46:21,184 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 251 [2022-12-13 15:46:21,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 1290 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:21,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:21,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 251 [2022-12-13 15:46:21,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:22,454 INFO L130 PetriNetUnfolder]: 4383/7117 cut-off events. [2022-12-13 15:46:22,454 INFO L131 PetriNetUnfolder]: For 41341/41604 co-relation queries the response was YES. [2022-12-13 15:46:22,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29554 conditions, 7117 events. 4383/7117 cut-off events. For 41341/41604 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 45962 event pairs, 802 based on Foata normal form. 539/7530 useless extension candidates. Maximal degree in co-relation 29508. Up to 2660 conditions per place. [2022-12-13 15:46:22,480 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 125 selfloop transitions, 13 changer transitions 7/172 dead transitions. [2022-12-13 15:46:22,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 172 transitions, 2642 flow [2022-12-13 15:46:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:46:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:46:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2022-12-13 15:46:22,483 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5274900398406375 [2022-12-13 15:46:22,483 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2022-12-13 15:46:22,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2022-12-13 15:46:22,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:22,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2022-12-13 15:46:22,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:22,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:22,489 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:22,489 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 1290 flow. Second operand 5 states and 662 transitions. [2022-12-13 15:46:22,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 172 transitions, 2642 flow [2022-12-13 15:46:22,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 172 transitions, 2373 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-13 15:46:22,550 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 1179 flow [2022-12-13 15:46:22,551 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1179, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2022-12-13 15:46:22,551 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2022-12-13 15:46:22,551 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 1179 flow [2022-12-13 15:46:22,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:22,552 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:22,552 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:46:22,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 15:46:22,552 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-12-13 15:46:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:22,553 INFO L85 PathProgramCache]: Analyzing trace with hash -231708263, now seen corresponding path program 1 times [2022-12-13 15:46:22,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:22,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215051084] [2022-12-13 15:46:22,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:22,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:22,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:22,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215051084] [2022-12-13 15:46:22,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215051084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:22,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:22,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:46:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948459376] [2022-12-13 15:46:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:22,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:46:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:46:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:46:22,754 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 251 [2022-12-13 15:46:22,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 1179 flow. Second operand has 6 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:22,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:22,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 251 [2022-12-13 15:46:22,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:23,644 INFO L130 PetriNetUnfolder]: 4141/6629 cut-off events. [2022-12-13 15:46:23,644 INFO L131 PetriNetUnfolder]: For 29718/29954 co-relation queries the response was YES. [2022-12-13 15:46:23,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29297 conditions, 6629 events. 4141/6629 cut-off events. For 29718/29954 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 42392 event pairs, 775 based on Foata normal form. 197/6700 useless extension candidates. Maximal degree in co-relation 29253. Up to 2648 conditions per place. [2022-12-13 15:46:23,665 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 75 selfloop transitions, 17 changer transitions 64/168 dead transitions. [2022-12-13 15:46:23,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 168 transitions, 2362 flow [2022-12-13 15:46:23,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:46:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 15:46:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions. [2022-12-13 15:46:23,667 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5172642762284196 [2022-12-13 15:46:23,667 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 779 transitions. [2022-12-13 15:46:23,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions. [2022-12-13 15:46:23,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:23,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions. [2022-12-13 15:46:23,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:23,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:23,669 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:23,670 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 1179 flow. Second operand 6 states and 779 transitions. [2022-12-13 15:46:23,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 168 transitions, 2362 flow [2022-12-13 15:46:23,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 168 transitions, 2263 flow, removed 29 selfloop flow, removed 8 redundant places. [2022-12-13 15:46:23,883 INFO L231 Difference]: Finished difference. Result has 82 places, 57 transitions, 569 flow [2022-12-13 15:46:23,884 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=82, PETRI_TRANSITIONS=57} [2022-12-13 15:46:23,884 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2022-12-13 15:46:23,884 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 57 transitions, 569 flow [2022-12-13 15:46:23,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:23,884 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:23,884 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] [2022-12-13 15:46:23,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 15:46:23,884 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-12-13 15:46:23,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 923124677, now seen corresponding path program 1 times [2022-12-13 15:46:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:23,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904625911] [2022-12-13 15:46:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:24,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904625911] [2022-12-13 15:46:24,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904625911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:24,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:24,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:46:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093112693] [2022-12-13 15:46:24,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:24,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:46:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:24,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:46:24,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:46:24,895 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 251 [2022-12-13 15:46:24,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 57 transitions, 569 flow. Second operand has 9 states, 9 states have (on average 117.77777777777777) internal successors, (1060), 9 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:24,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:24,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 251 [2022-12-13 15:46:24,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:25,421 INFO L130 PetriNetUnfolder]: 1285/2091 cut-off events. [2022-12-13 15:46:25,422 INFO L131 PetriNetUnfolder]: For 8951/9068 co-relation queries the response was YES. [2022-12-13 15:46:25,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9296 conditions, 2091 events. 1285/2091 cut-off events. For 8951/9068 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11011 event pairs, 202 based on Foata normal form. 57/2121 useless extension candidates. Maximal degree in co-relation 9256. Up to 988 conditions per place. [2022-12-13 15:46:25,428 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 72 selfloop transitions, 3 changer transitions 58/145 dead transitions. [2022-12-13 15:46:25,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 145 transitions, 1538 flow [2022-12-13 15:46:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:46:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:46:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2022-12-13 15:46:25,430 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5008537279453614 [2022-12-13 15:46:25,430 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2022-12-13 15:46:25,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2022-12-13 15:46:25,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:25,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2022-12-13 15:46:25,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:25,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:25,435 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:25,435 INFO L175 Difference]: Start difference. First operand has 82 places, 57 transitions, 569 flow. Second operand 7 states and 880 transitions. [2022-12-13 15:46:25,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 145 transitions, 1538 flow [2022-12-13 15:46:25,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 145 transitions, 1210 flow, removed 65 selfloop flow, removed 16 redundant places. [2022-12-13 15:46:25,457 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 442 flow [2022-12-13 15:46:25,457 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=442, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2022-12-13 15:46:25,458 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2022-12-13 15:46:25,458 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 442 flow [2022-12-13 15:46:25,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.77777777777777) internal successors, (1060), 9 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:25,458 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:25,458 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] [2022-12-13 15:46:25,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 15:46:25,459 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-12-13 15:46:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1652907517, now seen corresponding path program 2 times [2022-12-13 15:46:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:25,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308971726] [2022-12-13 15:46:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:25,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:25,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308971726] [2022-12-13 15:46:25,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308971726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:25,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:25,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:46:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375336990] [2022-12-13 15:46:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:25,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:46:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:25,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:46:25,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:46:25,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2022-12-13 15:46:25,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:25,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:25,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2022-12-13 15:46:25,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:26,080 INFO L130 PetriNetUnfolder]: 1308/2075 cut-off events. [2022-12-13 15:46:26,080 INFO L131 PetriNetUnfolder]: For 5679/5679 co-relation queries the response was YES. [2022-12-13 15:46:26,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7896 conditions, 2075 events. 1308/2075 cut-off events. For 5679/5679 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9326 event pairs, 230 based on Foata normal form. 1/2076 useless extension candidates. Maximal degree in co-relation 7873. Up to 725 conditions per place. [2022-12-13 15:46:26,085 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 48 selfloop transitions, 5 changer transitions 65/118 dead transitions. [2022-12-13 15:46:26,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 118 transitions, 992 flow [2022-12-13 15:46:26,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:46:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:46:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2022-12-13 15:46:26,087 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46898121798520204 [2022-12-13 15:46:26,087 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2022-12-13 15:46:26,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2022-12-13 15:46:26,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:26,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2022-12-13 15:46:26,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:26,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:26,089 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:26,089 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 442 flow. Second operand 7 states and 824 transitions. [2022-12-13 15:46:26,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 118 transitions, 992 flow [2022-12-13 15:46:26,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 118 transitions, 973 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 15:46:26,108 INFO L231 Difference]: Finished difference. Result has 77 places, 41 transitions, 241 flow [2022-12-13 15:46:26,108 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=77, PETRI_TRANSITIONS=41} [2022-12-13 15:46:26,109 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2022-12-13 15:46:26,109 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 41 transitions, 241 flow [2022-12-13 15:46:26,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:26,109 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:26,110 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:46:26,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 15:46:26,110 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 15:46:26,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:26,110 INFO L85 PathProgramCache]: Analyzing trace with hash -119266291, now seen corresponding path program 3 times [2022-12-13 15:46:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:26,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743231666] [2022-12-13 15:46:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:26,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:46:26,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:46:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:46:26,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:46:26,212 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:46:26,213 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 15:46:26,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 15:46:26,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 15:46:26,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 15:46:26,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 15:46:26,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 15:46:26,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 15:46:26,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 15:46:26,215 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:46:26,219 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:46:26,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:46:26,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:46:26 BasicIcfg [2022-12-13 15:46:26,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:46:26,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:46:26,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:46:26,265 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:46:26,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:45:50" (3/4) ... [2022-12-13 15:46:26,266 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 15:46:26,329 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 15:46:26,329 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:46:26,329 INFO L158 Benchmark]: Toolchain (without parser) took 37165.06ms. Allocated memory was 136.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 93.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2022-12-13 15:46:26,330 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:46:26,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.47ms. Allocated memory is still 136.3MB. Free memory was 93.2MB in the beginning and 65.2MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 15:46:26,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.11ms. Allocated memory is still 136.3MB. Free memory was 65.2MB in the beginning and 106.0MB in the end (delta: -40.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-12-13 15:46:26,331 INFO L158 Benchmark]: Boogie Preprocessor took 32.84ms. Allocated memory is still 136.3MB. Free memory was 105.9MB in the beginning and 107.1MB in the end (delta: -1.2MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-12-13 15:46:26,331 INFO L158 Benchmark]: RCFGBuilder took 573.85ms. Allocated memory is still 136.3MB. Free memory was 107.1MB in the beginning and 68.7MB in the end (delta: 38.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-12-13 15:46:26,331 INFO L158 Benchmark]: TraceAbstraction took 36061.20ms. Allocated memory was 136.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 68.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-12-13 15:46:26,332 INFO L158 Benchmark]: Witness Printer took 64.21ms. Allocated memory is still 4.0GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 15:46:26,333 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.15ms. Allocated memory is still 102.8MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.47ms. Allocated memory is still 136.3MB. Free memory was 93.2MB in the beginning and 65.2MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.11ms. Allocated memory is still 136.3MB. Free memory was 65.2MB in the beginning and 106.0MB in the end (delta: -40.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.84ms. Allocated memory is still 136.3MB. Free memory was 105.9MB in the beginning and 107.1MB in the end (delta: -1.2MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 573.85ms. Allocated memory is still 136.3MB. Free memory was 107.1MB in the beginning and 68.7MB in the end (delta: 38.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 36061.20ms. Allocated memory was 136.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 68.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 64.21ms. Allocated memory is still 4.0GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 16.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: 3.0s, 144 PlacesBefore, 45 PlacesAfterwards, 133 TransitionsBefore, 33 TransitionsAfterwards, 3404 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 10085 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4494, independent: 4241, independent conditional: 0, independent unconditional: 4241, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1841, independent: 1804, independent conditional: 0, independent unconditional: 1804, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4494, independent: 2437, independent conditional: 0, independent unconditional: 2437, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 1841, unknown conditional: 0, unknown unconditional: 1841] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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(&t553, ((void *)0), P0, ((void *)0))=-3, t553={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t554, ((void *)0), P1, ((void *)0))=-2, t553={5:0}, t554={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t555; [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t555, ((void *)0), P2, ((void *)0))=-1, t553={5:0}, t554={6:0}, t555={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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, pthread_create(&t556, ((void *)0), P3, ((void *)0))=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 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) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 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 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 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_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=1, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L800] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, z=0] [L806] 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) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 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 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 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 [\result={0:0}, __unbuffered_cnt=1, __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=2, z=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L820] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 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) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, z=1] [L766] 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) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 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 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, z=1] [L842] 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) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 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 [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 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) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 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 [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 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_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, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=2, 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: 871]: 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: 865]: 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: 869]: 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: 867]: 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, 174 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: 35.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 29.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1105 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 932 mSDsluCounter, 491 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 344 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2196 IncrementalHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 147 mSDtfsCounter, 2196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1290occurred in iteration=10, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 1550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-12-13 15:46:26,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da2ad5-fd86-49bd-95a3-3a728e910c4c/bin/uautomizer-uyxdKDjOR8/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