./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:41:38,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:41:38,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:41:38,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:41:38,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:41:38,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:41:38,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:41:38,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:41:38,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:41:38,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:41:38,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:41:38,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:41:38,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:41:38,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:41:38,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:41:38,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:41:38,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:41:38,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:41:38,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:41:38,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:41:38,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:41:38,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:41:38,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:41:38,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:41:38,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:41:38,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:41:38,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:41:38,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:41:38,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:41:38,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:41:38,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:41:38,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:41:38,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:41:38,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:41:38,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:41:38,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:41:38,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:41:38,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:41:38,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:41:38,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:41:38,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:41:38,270 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:41:38,327 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:41:38,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:41:38,328 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:41:38,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:41:38,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:41:38,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:41:38,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:41:38,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:41:38,332 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:41:38,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:41:38,333 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:41:38,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:41:38,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:41:38,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:41:38,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:41:38,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:41:38,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:41:38,335 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:41:38,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:41:38,336 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:41:38,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:41:38,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:41:38,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:41:38,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:41:38,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:41:38,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:41:38,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:41:38,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:41:38,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:41:38,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:41:38,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:41:38,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:41:38,340 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:41:38,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:41:38,341 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_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 [2022-11-25 16:41:38,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:41:38,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:41:38,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:41:38,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:41:38,805 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:41:38,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix055.opt.i [2022-11-25 16:41:42,738 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:41:43,192 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:41:43,193 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/sv-benchmarks/c/pthread-wmm/mix055.opt.i [2022-11-25 16:41:43,208 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/data/2af1bfaff/2e59aaecde3f4b6a8be6f82743019273/FLAGdf8dec4b0 [2022-11-25 16:41:43,227 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/data/2af1bfaff/2e59aaecde3f4b6a8be6f82743019273 [2022-11-25 16:41:43,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:41:43,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:41:43,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:41:43,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:41:43,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:41:43,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:41:43" (1/1) ... [2022-11-25 16:41:43,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a65469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:43, skipping insertion in model container [2022-11-25 16:41:43,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:41:43" (1/1) ... [2022-11-25 16:41:43,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:41:43,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:41:43,608 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_eea55d1d-4636-4719-996c-53c3d858948e/sv-benchmarks/c/pthread-wmm/mix055.opt.i[944,957] [2022-11-25 16:41:43,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:41:43,930 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:41:43,947 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_eea55d1d-4636-4719-996c-53c3d858948e/sv-benchmarks/c/pthread-wmm/mix055.opt.i[944,957] [2022-11-25 16:41:43,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:43,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:43,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:44,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:44,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:44,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:44,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:44,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:44,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:44,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:44,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:44,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:44,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:41:44,095 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:41:44,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44 WrapperNode [2022-11-25 16:41:44,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:41:44,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:41:44,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:41:44,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:41:44,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,243 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-11-25 16:41:44,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:41:44,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:41:44,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:41:44,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:41:44,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,341 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:41:44,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:41:44,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:41:44,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:41:44,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (1/1) ... [2022-11-25 16:41:44,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:41:44,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:41:44,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:41:44,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:41:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:41:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:41:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:41:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:41:44,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:41:44,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:41:44,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:41:44,464 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:41:44,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:41:44,464 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 16:41:44,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 16:41:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 16:41:44,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 16:41:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:41:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:41:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:41:44,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:41:44,469 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:41:44,710 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:41:44,713 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:41:45,284 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:41:45,483 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:41:45,483 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:41:45,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:41:45 BoogieIcfgContainer [2022-11-25 16:41:45,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:41:45,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:41:45,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:41:45,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:41:45,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:41:43" (1/3) ... [2022-11-25 16:41:45,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78dc6334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:41:45, skipping insertion in model container [2022-11-25 16:41:45,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:44" (2/3) ... [2022-11-25 16:41:45,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78dc6334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:41:45, skipping insertion in model container [2022-11-25 16:41:45,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:41:45" (3/3) ... [2022-11-25 16:41:45,499 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2022-11-25 16:41:45,511 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:41:45,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:41:45,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 16:41:45,527 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:41:45,631 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:41:45,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-11-25 16:41:45,820 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-25 16:41:45,820 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:41:45,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-25 16:41:45,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-11-25 16:41:45,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-11-25 16:41:45,850 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:41:45,878 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-11-25 16:41:45,882 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-11-25 16:41:45,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-11-25 16:41:45,928 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-25 16:41:45,929 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:41:45,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-25 16:41:45,933 INFO L119 LiptonReduction]: Number of co-enabled transitions 2952 [2022-11-25 16:41:52,825 INFO L134 LiptonReduction]: Checked pairs total: 7180 [2022-11-25 16:41:52,825 INFO L136 LiptonReduction]: Total number of compositions: 114 [2022-11-25 16:41:52,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:41:52,852 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;@69772589, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:41:52,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 16:41:52,861 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-11-25 16:41:52,861 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:41:52,861 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:52,862 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:52,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:41:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1569147829, now seen corresponding path program 1 times [2022-11-25 16:41:52,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:52,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899343279] [2022-11-25 16:41:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:53,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:53,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899343279] [2022-11-25 16:41:53,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899343279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:53,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:53,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:41:53,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278632478] [2022-11-25 16:41:53,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:53,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:41:53,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:53,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:41:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:41:53,674 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 247 [2022-11-25 16:41:53,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 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-11-25 16:41:53,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:53,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 247 [2022-11-25 16:41:53,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:54,498 INFO L130 PetriNetUnfolder]: 2483/3683 cut-off events. [2022-11-25 16:41:54,498 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-11-25 16:41:54,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7231 conditions, 3683 events. 2483/3683 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20187 event pairs, 593 based on Foata normal form. 0/3526 useless extension candidates. Maximal degree in co-relation 7219. Up to 2539 conditions per place. [2022-11-25 16:41:54,538 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 31 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2022-11-25 16:41:54,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 160 flow [2022-11-25 16:41:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:41:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:41:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2022-11-25 16:41:54,565 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5330634278002699 [2022-11-25 16:41:54,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2022-11-25 16:41:54,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2022-11-25 16:41:54,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:54,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2022-11-25 16:41:54,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:54,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:54,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:54,595 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 395 transitions. [2022-11-25 16:41:54,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 160 flow [2022-11-25 16:41:54,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 16:41:54,605 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-11-25 16:41:54,608 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-25 16:41:54,613 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-25 16:41:54,613 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-11-25 16:41:54,614 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-11-25 16:41:54,614 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:54,614 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:54,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:41:54,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:41:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash -57802983, now seen corresponding path program 1 times [2022-11-25 16:41:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:54,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415083158] [2022-11-25 16:41:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:54,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:55,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:55,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415083158] [2022-11-25 16:41:55,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415083158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:55,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:55,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:41:55,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973999300] [2022-11-25 16:41:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:55,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:41:55,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:55,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:41:55,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:41:55,908 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2022-11-25 16:41:55,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:55,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:55,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2022-11-25 16:41:55,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:41:57,285 INFO L130 PetriNetUnfolder]: 5159/7121 cut-off events. [2022-11-25 16:41:57,285 INFO L131 PetriNetUnfolder]: For 327/327 co-relation queries the response was YES. [2022-11-25 16:41:57,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14765 conditions, 7121 events. 5159/7121 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 34429 event pairs, 965 based on Foata normal form. 309/7429 useless extension candidates. Maximal degree in co-relation 14755. Up to 5602 conditions per place. [2022-11-25 16:41:57,336 INFO L137 encePairwiseOnDemand]: 238/247 looper letters, 40 selfloop transitions, 8 changer transitions 30/79 dead transitions. [2022-11-25 16:41:57,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 79 transitions, 340 flow [2022-11-25 16:41:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:41:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:41:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2022-11-25 16:41:57,339 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5043377674956623 [2022-11-25 16:41:57,340 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2022-11-25 16:41:57,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2022-11-25 16:41:57,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:57,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2022-11-25 16:41:57,343 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-11-25 16:41:57,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:57,349 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:57,349 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 7 states and 872 transitions. [2022-11-25 16:41:57,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 79 transitions, 340 flow [2022-11-25 16:41:57,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 79 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:41:57,356 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 129 flow [2022-11-25 16:41:57,357 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-11-25 16:41:57,358 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-11-25 16:41:57,358 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 129 flow [2022-11-25 16:41:57,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:57,359 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:41:57,359 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:57,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:41:57,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:41:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1791909453, now seen corresponding path program 1 times [2022-11-25 16:41:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:57,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989358038] [2022-11-25 16:41:57,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:57,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:41:58,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:58,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989358038] [2022-11-25 16:41:58,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989358038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:58,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:58,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:41:58,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101288152] [2022-11-25 16:41:58,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:58,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:41:58,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:58,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:41:58,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:41:58,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2022-11-25 16:41:58,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:41:58,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:41:58,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2022-11-25 16:41:58,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:00,120 INFO L130 PetriNetUnfolder]: 4842/7009 cut-off events. [2022-11-25 16:42:00,121 INFO L131 PetriNetUnfolder]: For 5848/5872 co-relation queries the response was YES. [2022-11-25 16:42:00,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19115 conditions, 7009 events. 4842/7009 cut-off events. For 5848/5872 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 36346 event pairs, 2030 based on Foata normal form. 206/7155 useless extension candidates. Maximal degree in co-relation 19100. Up to 5877 conditions per place. [2022-11-25 16:42:00,190 INFO L137 encePairwiseOnDemand]: 239/247 looper letters, 43 selfloop transitions, 9 changer transitions 18/73 dead transitions. [2022-11-25 16:42:00,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 73 transitions, 402 flow [2022-11-25 16:42:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:42:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:42:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2022-11-25 16:42:00,196 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5020242914979757 [2022-11-25 16:42:00,196 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2022-11-25 16:42:00,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2022-11-25 16:42:00,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:00,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2022-11-25 16:42:00,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:00,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:00,205 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:00,205 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 129 flow. Second operand 6 states and 744 transitions. [2022-11-25 16:42:00,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 73 transitions, 402 flow [2022-11-25 16:42:00,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 400 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 16:42:00,226 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 212 flow [2022-11-25 16:42:00,227 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-11-25 16:42:00,228 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2022-11-25 16:42:00,229 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 212 flow [2022-11-25 16:42:00,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:00,230 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:00,230 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:00,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:42:00,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash 285007333, now seen corresponding path program 1 times [2022-11-25 16:42:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:00,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548627042] [2022-11-25 16:42:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:01,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:01,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548627042] [2022-11-25 16:42:01,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548627042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:01,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:01,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:42:01,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700086595] [2022-11-25 16:42:01,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:01,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:42:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:42:01,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:42:01,088 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 247 [2022-11-25 16:42:01,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:01,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:01,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 247 [2022-11-25 16:42:01,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:02,432 INFO L130 PetriNetUnfolder]: 4185/6158 cut-off events. [2022-11-25 16:42:02,432 INFO L131 PetriNetUnfolder]: For 9958/10015 co-relation queries the response was YES. [2022-11-25 16:42:02,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19484 conditions, 6158 events. 4185/6158 cut-off events. For 9958/10015 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32971 event pairs, 1020 based on Foata normal form. 170/6189 useless extension candidates. Maximal degree in co-relation 19464. Up to 4663 conditions per place. [2022-11-25 16:42:02,498 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 55 selfloop transitions, 12 changer transitions 4/77 dead transitions. [2022-11-25 16:42:02,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 502 flow [2022-11-25 16:42:02,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:42:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:42:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2022-11-25 16:42:02,502 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5121457489878543 [2022-11-25 16:42:02,502 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2022-11-25 16:42:02,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2022-11-25 16:42:02,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:02,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2022-11-25 16:42:02,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:02,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:02,511 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:02,512 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 212 flow. Second operand 6 states and 759 transitions. [2022-11-25 16:42:02,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 502 flow [2022-11-25 16:42:02,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 492 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-11-25 16:42:02,534 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 292 flow [2022-11-25 16:42:02,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2022-11-25 16:42:02,537 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2022-11-25 16:42:02,537 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 292 flow [2022-11-25 16:42:02,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:02,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:02,538 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:02,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:42:02,539 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash 226457660, now seen corresponding path program 1 times [2022-11-25 16:42:02,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:02,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891631047] [2022-11-25 16:42:02,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:02,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:03,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:03,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891631047] [2022-11-25 16:42:03,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891631047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:03,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:03,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:42:03,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227925221] [2022-11-25 16:42:03,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:03,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:42:03,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:42:03,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:42:03,473 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 247 [2022-11-25 16:42:03,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 292 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:03,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:03,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 247 [2022-11-25 16:42:03,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:05,993 INFO L130 PetriNetUnfolder]: 9283/13137 cut-off events. [2022-11-25 16:42:05,994 INFO L131 PetriNetUnfolder]: For 30638/30746 co-relation queries the response was YES. [2022-11-25 16:42:06,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43458 conditions, 13137 events. 9283/13137 cut-off events. For 30638/30746 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 71411 event pairs, 2016 based on Foata normal form. 494/13560 useless extension candidates. Maximal degree in co-relation 43434. Up to 8166 conditions per place. [2022-11-25 16:42:06,105 INFO L137 encePairwiseOnDemand]: 236/247 looper letters, 62 selfloop transitions, 23 changer transitions 43/133 dead transitions. [2022-11-25 16:42:06,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 133 transitions, 954 flow [2022-11-25 16:42:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:42:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:42:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2022-11-25 16:42:06,110 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4950838635049161 [2022-11-25 16:42:06,112 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2022-11-25 16:42:06,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2022-11-25 16:42:06,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:06,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2022-11-25 16:42:06,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:06,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:06,120 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:06,120 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 292 flow. Second operand 7 states and 856 transitions. [2022-11-25 16:42:06,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 133 transitions, 954 flow [2022-11-25 16:42:06,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 133 transitions, 896 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-11-25 16:42:06,324 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 449 flow [2022-11-25 16:42:06,325 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=449, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2022-11-25 16:42:06,329 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2022-11-25 16:42:06,329 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 449 flow [2022-11-25 16:42:06,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:06,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:06,330 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:06,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:42:06,331 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1521514224, now seen corresponding path program 1 times [2022-11-25 16:42:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:06,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145789853] [2022-11-25 16:42:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:06,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:06,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145789853] [2022-11-25 16:42:06,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145789853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:06,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:06,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:42:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689473743] [2022-11-25 16:42:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:06,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:42:06,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:42:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:42:06,880 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 247 [2022-11-25 16:42:06,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:06,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:06,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 247 [2022-11-25 16:42:06,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:08,470 INFO L130 PetriNetUnfolder]: 6255/9186 cut-off events. [2022-11-25 16:42:08,470 INFO L131 PetriNetUnfolder]: For 37962/38096 co-relation queries the response was YES. [2022-11-25 16:42:08,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37864 conditions, 9186 events. 6255/9186 cut-off events. For 37962/38096 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 51759 event pairs, 1361 based on Foata normal form. 274/9363 useless extension candidates. Maximal degree in co-relation 37836. Up to 5599 conditions per place. [2022-11-25 16:42:08,575 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 62 selfloop transitions, 16 changer transitions 26/114 dead transitions. [2022-11-25 16:42:08,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 114 transitions, 1000 flow [2022-11-25 16:42:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:42:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:42:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2022-11-25 16:42:08,581 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5089647194910353 [2022-11-25 16:42:08,581 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2022-11-25 16:42:08,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2022-11-25 16:42:08,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:08,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2022-11-25 16:42:08,585 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-11-25 16:42:08,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:08,590 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:08,590 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 449 flow. Second operand 7 states and 880 transitions. [2022-11-25 16:42:08,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 114 transitions, 1000 flow [2022-11-25 16:42:08,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 114 transitions, 938 flow, removed 31 selfloop flow, removed 4 redundant places. [2022-11-25 16:42:08,792 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 513 flow [2022-11-25 16:42:08,792 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=513, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2022-11-25 16:42:08,794 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2022-11-25 16:42:08,795 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 513 flow [2022-11-25 16:42:08,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:08,795 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:08,795 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:08,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:42:08,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:08,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1375884385, now seen corresponding path program 1 times [2022-11-25 16:42:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:08,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230498795] [2022-11-25 16:42:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:09,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:09,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230498795] [2022-11-25 16:42:09,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230498795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:09,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:09,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529333066] [2022-11-25 16:42:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:09,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:42:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:09,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:42:09,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:42:09,538 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247 [2022-11-25 16:42:09,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 513 flow. Second operand has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:09,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:09,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247 [2022-11-25 16:42:09,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:10,843 INFO L130 PetriNetUnfolder]: 5962/8724 cut-off events. [2022-11-25 16:42:10,844 INFO L131 PetriNetUnfolder]: For 30948/31033 co-relation queries the response was YES. [2022-11-25 16:42:10,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35679 conditions, 8724 events. 5962/8724 cut-off events. For 30948/31033 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 47576 event pairs, 1107 based on Foata normal form. 189/8835 useless extension candidates. Maximal degree in co-relation 35649. Up to 5593 conditions per place. [2022-11-25 16:42:10,933 INFO L137 encePairwiseOnDemand]: 242/247 looper letters, 63 selfloop transitions, 12 changer transitions 16/101 dead transitions. [2022-11-25 16:42:10,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 101 transitions, 878 flow [2022-11-25 16:42:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:42:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:42:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions. [2022-11-25 16:42:10,937 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.50472334682861 [2022-11-25 16:42:10,937 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 748 transitions. [2022-11-25 16:42:10,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 748 transitions. [2022-11-25 16:42:10,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:10,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 748 transitions. [2022-11-25 16:42:10,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:10,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:10,944 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:10,944 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 513 flow. Second operand 6 states and 748 transitions. [2022-11-25 16:42:10,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 101 transitions, 878 flow [2022-11-25 16:42:11,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 856 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-25 16:42:11,033 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 531 flow [2022-11-25 16:42:11,034 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2022-11-25 16:42:11,036 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2022-11-25 16:42:11,036 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 531 flow [2022-11-25 16:42:11,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:11,037 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:11,037 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:11,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:42:11,037 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1248863202, now seen corresponding path program 1 times [2022-11-25 16:42:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:11,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119160634] [2022-11-25 16:42:11,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:11,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:11,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:11,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119160634] [2022-11-25 16:42:11,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119160634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:11,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:11,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799033709] [2022-11-25 16:42:11,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:11,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:42:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:42:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:42:11,665 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247 [2022-11-25 16:42:11,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 531 flow. Second operand has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:11,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:11,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247 [2022-11-25 16:42:11,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:13,502 INFO L130 PetriNetUnfolder]: 6499/9410 cut-off events. [2022-11-25 16:42:13,502 INFO L131 PetriNetUnfolder]: For 34818/35246 co-relation queries the response was YES. [2022-11-25 16:42:13,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39048 conditions, 9410 events. 6499/9410 cut-off events. For 34818/35246 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 51551 event pairs, 1490 based on Foata normal form. 226/9468 useless extension candidates. Maximal degree in co-relation 39017. Up to 5831 conditions per place. [2022-11-25 16:42:13,574 INFO L137 encePairwiseOnDemand]: 239/247 looper letters, 62 selfloop transitions, 28 changer transitions 11/111 dead transitions. [2022-11-25 16:42:13,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 111 transitions, 1030 flow [2022-11-25 16:42:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:42:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:42:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2022-11-25 16:42:13,578 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5067476383265856 [2022-11-25 16:42:13,578 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2022-11-25 16:42:13,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2022-11-25 16:42:13,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:13,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2022-11-25 16:42:13,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:13,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:13,587 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:13,587 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 531 flow. Second operand 6 states and 751 transitions. [2022-11-25 16:42:13,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 111 transitions, 1030 flow [2022-11-25 16:42:13,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 111 transitions, 1008 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 16:42:13,664 INFO L231 Difference]: Finished difference. Result has 68 places, 76 transitions, 731 flow [2022-11-25 16:42:13,664 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=731, PETRI_PLACES=68, PETRI_TRANSITIONS=76} [2022-11-25 16:42:13,666 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2022-11-25 16:42:13,667 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 76 transitions, 731 flow [2022-11-25 16:42:13,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:13,668 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:13,668 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:13,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:42:13,668 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:13,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1141961562, now seen corresponding path program 2 times [2022-11-25 16:42:13,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:13,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925625525] [2022-11-25 16:42:13,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:14,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925625525] [2022-11-25 16:42:14,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925625525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:14,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:14,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292341602] [2022-11-25 16:42:14,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:14,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:42:14,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:14,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:42:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:42:14,683 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 247 [2022-11-25 16:42:14,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 76 transitions, 731 flow. Second operand has 7 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:14,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:14,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 247 [2022-11-25 16:42:14,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:16,329 INFO L130 PetriNetUnfolder]: 7240/10389 cut-off events. [2022-11-25 16:42:16,329 INFO L131 PetriNetUnfolder]: For 52500/53081 co-relation queries the response was YES. [2022-11-25 16:42:16,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47847 conditions, 10389 events. 7240/10389 cut-off events. For 52500/53081 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 57796 event pairs, 3571 based on Foata normal form. 278/10443 useless extension candidates. Maximal degree in co-relation 47815. Up to 7187 conditions per place. [2022-11-25 16:42:16,410 INFO L137 encePairwiseOnDemand]: 239/247 looper letters, 62 selfloop transitions, 33 changer transitions 19/124 dead transitions. [2022-11-25 16:42:16,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 124 transitions, 1338 flow [2022-11-25 16:42:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:42:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:42:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-11-25 16:42:16,422 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4973973395026027 [2022-11-25 16:42:16,422 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 860 transitions. [2022-11-25 16:42:16,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 860 transitions. [2022-11-25 16:42:16,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:16,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 860 transitions. [2022-11-25 16:42:16,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:16,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:16,431 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:16,431 INFO L175 Difference]: Start difference. First operand has 68 places, 76 transitions, 731 flow. Second operand 7 states and 860 transitions. [2022-11-25 16:42:16,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 124 transitions, 1338 flow [2022-11-25 16:42:16,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 124 transitions, 1308 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-11-25 16:42:16,585 INFO L231 Difference]: Finished difference. Result has 75 places, 87 transitions, 964 flow [2022-11-25 16:42:16,585 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=964, PETRI_PLACES=75, PETRI_TRANSITIONS=87} [2022-11-25 16:42:16,586 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2022-11-25 16:42:16,586 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 87 transitions, 964 flow [2022-11-25 16:42:16,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:16,590 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:16,590 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:16,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:42:16,592 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1143403062, now seen corresponding path program 3 times [2022-11-25 16:42:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:16,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469249975] [2022-11-25 16:42:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:17,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469249975] [2022-11-25 16:42:17,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469249975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:17,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:17,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:17,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630524327] [2022-11-25 16:42:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:17,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:42:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:42:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:42:17,144 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247 [2022-11-25 16:42:17,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 87 transitions, 964 flow. Second operand has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:17,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:17,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247 [2022-11-25 16:42:17,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:19,251 INFO L130 PetriNetUnfolder]: 7298/10527 cut-off events. [2022-11-25 16:42:19,251 INFO L131 PetriNetUnfolder]: For 71668/72287 co-relation queries the response was YES. [2022-11-25 16:42:19,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52887 conditions, 10527 events. 7298/10527 cut-off events. For 71668/72287 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 58690 event pairs, 1691 based on Foata normal form. 267/10596 useless extension candidates. Maximal degree in co-relation 52851. Up to 6800 conditions per place. [2022-11-25 16:42:19,371 INFO L137 encePairwiseOnDemand]: 239/247 looper letters, 78 selfloop transitions, 30 changer transitions 11/129 dead transitions. [2022-11-25 16:42:19,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 129 transitions, 1501 flow [2022-11-25 16:42:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:42:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:42:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2022-11-25 16:42:19,375 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5060728744939271 [2022-11-25 16:42:19,376 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2022-11-25 16:42:19,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2022-11-25 16:42:19,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:19,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2022-11-25 16:42:19,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:19,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:19,393 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:19,393 INFO L175 Difference]: Start difference. First operand has 75 places, 87 transitions, 964 flow. Second operand 6 states and 750 transitions. [2022-11-25 16:42:19,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 129 transitions, 1501 flow [2022-11-25 16:42:19,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 129 transitions, 1462 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-11-25 16:42:19,746 INFO L231 Difference]: Finished difference. Result has 77 places, 91 transitions, 1071 flow [2022-11-25 16:42:19,747 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1071, PETRI_PLACES=77, PETRI_TRANSITIONS=91} [2022-11-25 16:42:19,747 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2022-11-25 16:42:19,748 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 91 transitions, 1071 flow [2022-11-25 16:42:19,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:19,749 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:19,749 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:19,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:42:19,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:19,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:19,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1250823642, now seen corresponding path program 4 times [2022-11-25 16:42:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:19,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811816573] [2022-11-25 16:42:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:21,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:21,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811816573] [2022-11-25 16:42:21,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811816573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:21,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:21,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:21,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889780144] [2022-11-25 16:42:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:21,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:42:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:21,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:42:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:42:21,363 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 247 [2022-11-25 16:42:21,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 91 transitions, 1071 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:21,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:21,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 247 [2022-11-25 16:42:21,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:24,266 INFO L130 PetriNetUnfolder]: 10972/15251 cut-off events. [2022-11-25 16:42:24,266 INFO L131 PetriNetUnfolder]: For 92260/92260 co-relation queries the response was YES. [2022-11-25 16:42:24,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75649 conditions, 15251 events. 10972/15251 cut-off events. For 92260/92260 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 79292 event pairs, 920 based on Foata normal form. 440/15691 useless extension candidates. Maximal degree in co-relation 75612. Up to 7980 conditions per place. [2022-11-25 16:42:24,382 INFO L137 encePairwiseOnDemand]: 235/247 looper letters, 86 selfloop transitions, 69 changer transitions 34/189 dead transitions. [2022-11-25 16:42:24,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 189 transitions, 2245 flow [2022-11-25 16:42:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:42:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 16:42:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 940 transitions. [2022-11-25 16:42:24,402 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4757085020242915 [2022-11-25 16:42:24,403 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 940 transitions. [2022-11-25 16:42:24,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 940 transitions. [2022-11-25 16:42:24,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:24,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 940 transitions. [2022-11-25 16:42:24,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.5) internal successors, (940), 8 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:24,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:24,414 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:24,415 INFO L175 Difference]: Start difference. First operand has 77 places, 91 transitions, 1071 flow. Second operand 8 states and 940 transitions. [2022-11-25 16:42:24,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 189 transitions, 2245 flow [2022-11-25 16:42:24,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 189 transitions, 2174 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-11-25 16:42:24,708 INFO L231 Difference]: Finished difference. Result has 85 places, 122 transitions, 1719 flow [2022-11-25 16:42:24,709 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1719, PETRI_PLACES=85, PETRI_TRANSITIONS=122} [2022-11-25 16:42:24,710 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2022-11-25 16:42:24,710 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 122 transitions, 1719 flow [2022-11-25 16:42:24,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:24,711 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:24,711 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:24,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:42:24,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:24,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1596106538, now seen corresponding path program 1 times [2022-11-25 16:42:24,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:24,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297127783] [2022-11-25 16:42:24,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:24,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:24,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:24,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297127783] [2022-11-25 16:42:24,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297127783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:24,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:24,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:42:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665907776] [2022-11-25 16:42:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:24,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:42:24,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:24,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:42:24,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:42:24,928 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2022-11-25 16:42:24,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 122 transitions, 1719 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:24,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:24,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2022-11-25 16:42:24,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:26,693 INFO L130 PetriNetUnfolder]: 6420/9513 cut-off events. [2022-11-25 16:42:26,693 INFO L131 PetriNetUnfolder]: For 118265/121475 co-relation queries the response was YES. [2022-11-25 16:42:26,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56585 conditions, 9513 events. 6420/9513 cut-off events. For 118265/121475 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 57371 event pairs, 789 based on Foata normal form. 1392/10607 useless extension candidates. Maximal degree in co-relation 56543. Up to 4397 conditions per place. [2022-11-25 16:42:26,774 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 175 selfloop transitions, 6 changer transitions 0/208 dead transitions. [2022-11-25 16:42:26,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 208 transitions, 3307 flow [2022-11-25 16:42:26,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:42:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:42:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2022-11-25 16:42:26,777 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5091093117408907 [2022-11-25 16:42:26,778 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2022-11-25 16:42:26,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2022-11-25 16:42:26,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:26,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2022-11-25 16:42:26,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:26,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:26,783 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:26,784 INFO L175 Difference]: Start difference. First operand has 85 places, 122 transitions, 1719 flow. Second operand 4 states and 503 transitions. [2022-11-25 16:42:26,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 208 transitions, 3307 flow [2022-11-25 16:42:26,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 208 transitions, 3250 flow, removed 28 selfloop flow, removed 1 redundant places. [2022-11-25 16:42:26,955 INFO L231 Difference]: Finished difference. Result has 87 places, 122 transitions, 1690 flow [2022-11-25 16:42:26,955 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1690, PETRI_PLACES=87, PETRI_TRANSITIONS=122} [2022-11-25 16:42:26,956 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2022-11-25 16:42:26,956 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 122 transitions, 1690 flow [2022-11-25 16:42:26,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:26,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:26,957 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:26,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:42:26,958 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:26,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash 854242759, now seen corresponding path program 1 times [2022-11-25 16:42:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:26,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456711044] [2022-11-25 16:42:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:27,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456711044] [2022-11-25 16:42:27,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456711044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:27,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:27,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:42:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962751792] [2022-11-25 16:42:27,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:27,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:42:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:27,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:42:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:42:27,187 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2022-11-25 16:42:27,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 122 transitions, 1690 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:27,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:27,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2022-11-25 16:42:27,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:28,429 INFO L130 PetriNetUnfolder]: 4586/7059 cut-off events. [2022-11-25 16:42:28,429 INFO L131 PetriNetUnfolder]: For 95388/99003 co-relation queries the response was YES. [2022-11-25 16:42:28,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43882 conditions, 7059 events. 4586/7059 cut-off events. For 95388/99003 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 43986 event pairs, 498 based on Foata normal form. 1343/8113 useless extension candidates. Maximal degree in co-relation 43837. Up to 2946 conditions per place. [2022-11-25 16:42:28,490 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 206 selfloop transitions, 10 changer transitions 0/243 dead transitions. [2022-11-25 16:42:28,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 243 transitions, 3876 flow [2022-11-25 16:42:28,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:42:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:42:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2022-11-25 16:42:28,493 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5109311740890689 [2022-11-25 16:42:28,493 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2022-11-25 16:42:28,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2022-11-25 16:42:28,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:28,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2022-11-25 16:42:28,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:28,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:28,500 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:28,500 INFO L175 Difference]: Start difference. First operand has 87 places, 122 transitions, 1690 flow. Second operand 5 states and 631 transitions. [2022-11-25 16:42:28,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 243 transitions, 3876 flow [2022-11-25 16:42:28,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 243 transitions, 3873 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:42:28,614 INFO L231 Difference]: Finished difference. Result has 92 places, 119 transitions, 1664 flow [2022-11-25 16:42:28,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=1557, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1664, PETRI_PLACES=92, PETRI_TRANSITIONS=119} [2022-11-25 16:42:28,615 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2022-11-25 16:42:28,616 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 119 transitions, 1664 flow [2022-11-25 16:42:28,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:28,616 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:28,616 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:28,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:42:28,617 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:28,618 INFO L85 PathProgramCache]: Analyzing trace with hash -471513179, now seen corresponding path program 1 times [2022-11-25 16:42:28,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:28,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56920279] [2022-11-25 16:42:28,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:28,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:29,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56920279] [2022-11-25 16:42:29,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56920279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:29,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:29,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253475158] [2022-11-25 16:42:29,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:29,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:42:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:29,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:42:29,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:42:29,533 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 247 [2022-11-25 16:42:29,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 119 transitions, 1664 flow. Second operand has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:29,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:29,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 247 [2022-11-25 16:42:29,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:32,039 INFO L130 PetriNetUnfolder]: 8491/12787 cut-off events. [2022-11-25 16:42:32,039 INFO L131 PetriNetUnfolder]: For 132094/132631 co-relation queries the response was YES. [2022-11-25 16:42:32,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83467 conditions, 12787 events. 8491/12787 cut-off events. For 132094/132631 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 78782 event pairs, 589 based on Foata normal form. 483/13111 useless extension candidates. Maximal degree in co-relation 83419. Up to 5215 conditions per place. [2022-11-25 16:42:32,134 INFO L137 encePairwiseOnDemand]: 235/247 looper letters, 155 selfloop transitions, 48 changer transitions 76/288 dead transitions. [2022-11-25 16:42:32,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 288 transitions, 4240 flow [2022-11-25 16:42:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:42:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:42:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2022-11-25 16:42:32,139 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48640832851359167 [2022-11-25 16:42:32,139 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2022-11-25 16:42:32,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2022-11-25 16:42:32,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:32,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2022-11-25 16:42:32,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:32,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:32,146 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:32,146 INFO L175 Difference]: Start difference. First operand has 92 places, 119 transitions, 1664 flow. Second operand 7 states and 841 transitions. [2022-11-25 16:42:32,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 288 transitions, 4240 flow [2022-11-25 16:42:32,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 288 transitions, 4189 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-11-25 16:42:32,456 INFO L231 Difference]: Finished difference. Result has 101 places, 130 transitions, 2029 flow [2022-11-25 16:42:32,456 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2029, PETRI_PLACES=101, PETRI_TRANSITIONS=130} [2022-11-25 16:42:32,457 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-11-25 16:42:32,457 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 130 transitions, 2029 flow [2022-11-25 16:42:32,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:32,458 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:32,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] [2022-11-25 16:42:32,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:42:32,459 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:32,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash 66037687, now seen corresponding path program 1 times [2022-11-25 16:42:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:32,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348929513] [2022-11-25 16:42:32,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:32,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:32,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348929513] [2022-11-25 16:42:32,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348929513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:32,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:32,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:32,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351781313] [2022-11-25 16:42:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:32,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:42:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:32,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:42:32,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:42:32,716 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2022-11-25 16:42:32,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 130 transitions, 2029 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:32,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:32,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2022-11-25 16:42:32,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:34,481 INFO L130 PetriNetUnfolder]: 5186/8167 cut-off events. [2022-11-25 16:42:34,481 INFO L131 PetriNetUnfolder]: For 123344/128060 co-relation queries the response was YES. [2022-11-25 16:42:34,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53799 conditions, 8167 events. 5186/8167 cut-off events. For 123344/128060 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 55581 event pairs, 447 based on Foata normal form. 1693/9443 useless extension candidates. Maximal degree in co-relation 53746. Up to 3025 conditions per place. [2022-11-25 16:42:34,543 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 190 selfloop transitions, 14 changer transitions 7/241 dead transitions. [2022-11-25 16:42:34,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 241 transitions, 4142 flow [2022-11-25 16:42:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:42:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:42:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 757 transitions. [2022-11-25 16:42:34,547 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5107962213225371 [2022-11-25 16:42:34,548 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 757 transitions. [2022-11-25 16:42:34,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 757 transitions. [2022-11-25 16:42:34,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:34,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 757 transitions. [2022-11-25 16:42:34,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:34,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:34,555 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:34,555 INFO L175 Difference]: Start difference. First operand has 101 places, 130 transitions, 2029 flow. Second operand 6 states and 757 transitions. [2022-11-25 16:42:34,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 241 transitions, 4142 flow [2022-11-25 16:42:34,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 241 transitions, 3866 flow, removed 37 selfloop flow, removed 8 redundant places. [2022-11-25 16:42:34,787 INFO L231 Difference]: Finished difference. Result has 99 places, 119 transitions, 1694 flow [2022-11-25 16:42:34,787 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1694, PETRI_PLACES=99, PETRI_TRANSITIONS=119} [2022-11-25 16:42:34,787 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-11-25 16:42:34,788 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 119 transitions, 1694 flow [2022-11-25 16:42:34,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:34,788 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:34,789 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:34,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:42:34,789 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2122427579, now seen corresponding path program 1 times [2022-11-25 16:42:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:34,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486407818] [2022-11-25 16:42:34,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:34,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:34,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486407818] [2022-11-25 16:42:34,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486407818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:34,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:34,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:42:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176377452] [2022-11-25 16:42:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:34,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:42:34,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:34,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:42:34,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:42:34,998 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 247 [2022-11-25 16:42:34,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 119 transitions, 1694 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:34,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:34,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 247 [2022-11-25 16:42:35,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:37,071 INFO L130 PetriNetUnfolder]: 7083/11442 cut-off events. [2022-11-25 16:42:37,071 INFO L131 PetriNetUnfolder]: For 132912/135329 co-relation queries the response was YES. [2022-11-25 16:42:37,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76810 conditions, 11442 events. 7083/11442 cut-off events. For 132912/135329 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 81824 event pairs, 1552 based on Foata normal form. 767/11650 useless extension candidates. Maximal degree in co-relation 76758. Up to 5551 conditions per place. [2022-11-25 16:42:37,158 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 107 selfloop transitions, 13 changer transitions 41/177 dead transitions. [2022-11-25 16:42:37,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 177 transitions, 2677 flow [2022-11-25 16:42:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:42:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:42:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2022-11-25 16:42:37,161 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5125506072874494 [2022-11-25 16:42:37,162 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2022-11-25 16:42:37,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2022-11-25 16:42:37,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:37,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2022-11-25 16:42:37,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:37,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:37,169 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:37,169 INFO L175 Difference]: Start difference. First operand has 99 places, 119 transitions, 1694 flow. Second operand 5 states and 633 transitions. [2022-11-25 16:42:37,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 177 transitions, 2677 flow [2022-11-25 16:42:38,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 177 transitions, 2613 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-11-25 16:42:38,075 INFO L231 Difference]: Finished difference. Result has 102 places, 106 transitions, 1468 flow [2022-11-25 16:42:38,076 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1468, PETRI_PLACES=102, PETRI_TRANSITIONS=106} [2022-11-25 16:42:38,076 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2022-11-25 16:42:38,076 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 106 transitions, 1468 flow [2022-11-25 16:42:38,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:38,077 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:38,077 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:38,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:42:38,077 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2095468319, now seen corresponding path program 2 times [2022-11-25 16:42:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:38,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942076162] [2022-11-25 16:42:38,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:38,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:38,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:38,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942076162] [2022-11-25 16:42:38,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942076162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:38,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:38,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:42:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360216548] [2022-11-25 16:42:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:38,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:42:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:38,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:42:38,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:42:38,383 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2022-11-25 16:42:38,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 106 transitions, 1468 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:38,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:38,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2022-11-25 16:42:38,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:40,294 INFO L130 PetriNetUnfolder]: 5382/8433 cut-off events. [2022-11-25 16:42:40,295 INFO L131 PetriNetUnfolder]: For 109761/114521 co-relation queries the response was YES. [2022-11-25 16:42:40,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55692 conditions, 8433 events. 5382/8433 cut-off events. For 109761/114521 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 57940 event pairs, 473 based on Foata normal form. 1563/9544 useless extension candidates. Maximal degree in co-relation 55645. Up to 3183 conditions per place. [2022-11-25 16:42:40,354 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 88 selfloop transitions, 18 changer transitions 76/196 dead transitions. [2022-11-25 16:42:40,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 196 transitions, 3118 flow [2022-11-25 16:42:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:42:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:42:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-11-25 16:42:40,358 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4979757085020243 [2022-11-25 16:42:40,358 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2022-11-25 16:42:40,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2022-11-25 16:42:40,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:40,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2022-11-25 16:42:40,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:40,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:40,365 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:40,365 INFO L175 Difference]: Start difference. First operand has 102 places, 106 transitions, 1468 flow. Second operand 7 states and 861 transitions. [2022-11-25 16:42:40,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 196 transitions, 3118 flow [2022-11-25 16:42:40,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 196 transitions, 2905 flow, removed 73 selfloop flow, removed 6 redundant places. [2022-11-25 16:42:40,888 INFO L231 Difference]: Finished difference. Result has 102 places, 72 transitions, 849 flow [2022-11-25 16:42:40,888 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=849, PETRI_PLACES=102, PETRI_TRANSITIONS=72} [2022-11-25 16:42:40,888 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2022-11-25 16:42:40,888 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 72 transitions, 849 flow [2022-11-25 16:42:40,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:40,889 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:40,889 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:40,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:42:40,890 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:40,890 INFO L85 PathProgramCache]: Analyzing trace with hash -571575165, now seen corresponding path program 1 times [2022-11-25 16:42:40,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:40,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316958870] [2022-11-25 16:42:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:40,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:41,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:41,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316958870] [2022-11-25 16:42:41,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316958870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:41,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:41,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920444021] [2022-11-25 16:42:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:41,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:42:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:42:41,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:42:41,899 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 247 [2022-11-25 16:42:41,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 72 transitions, 849 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:41,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:41,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 247 [2022-11-25 16:42:41,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:42,733 INFO L130 PetriNetUnfolder]: 1585/2588 cut-off events. [2022-11-25 16:42:42,733 INFO L131 PetriNetUnfolder]: For 27184/27296 co-relation queries the response was YES. [2022-11-25 16:42:42,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17237 conditions, 2588 events. 1585/2588 cut-off events. For 27184/27296 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 14309 event pairs, 116 based on Foata normal form. 99/2665 useless extension candidates. Maximal degree in co-relation 17189. Up to 1336 conditions per place. [2022-11-25 16:42:42,746 INFO L137 encePairwiseOnDemand]: 237/247 looper letters, 51 selfloop transitions, 7 changer transitions 90/150 dead transitions. [2022-11-25 16:42:42,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 150 transitions, 1918 flow [2022-11-25 16:42:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:42:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:42:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 806 transitions. [2022-11-25 16:42:42,750 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46616541353383456 [2022-11-25 16:42:42,750 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 806 transitions. [2022-11-25 16:42:42,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 806 transitions. [2022-11-25 16:42:42,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:42,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 806 transitions. [2022-11-25 16:42:42,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:42,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:42,757 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:42,757 INFO L175 Difference]: Start difference. First operand has 102 places, 72 transitions, 849 flow. Second operand 7 states and 806 transitions. [2022-11-25 16:42:42,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 150 transitions, 1918 flow [2022-11-25 16:42:42,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 150 transitions, 1491 flow, removed 90 selfloop flow, removed 28 redundant places. [2022-11-25 16:42:42,852 INFO L231 Difference]: Finished difference. Result has 82 places, 46 transitions, 369 flow [2022-11-25 16:42:42,853 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=82, PETRI_TRANSITIONS=46} [2022-11-25 16:42:42,853 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2022-11-25 16:42:42,854 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 46 transitions, 369 flow [2022-11-25 16:42:42,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:42,854 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:42,855 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:42,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:42:42,855 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:42,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1792497733, now seen corresponding path program 2 times [2022-11-25 16:42:42,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:42,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147214292] [2022-11-25 16:42:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:42,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:44,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:44,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147214292] [2022-11-25 16:42:44,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147214292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:44,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:44,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:42:44,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88138404] [2022-11-25 16:42:44,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:44,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:42:44,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:44,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:42:44,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:42:44,475 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 247 [2022-11-25 16:42:44,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 46 transitions, 369 flow. Second operand has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 9 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:44,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:44,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 247 [2022-11-25 16:42:44,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:44,903 INFO L130 PetriNetUnfolder]: 217/408 cut-off events. [2022-11-25 16:42:44,903 INFO L131 PetriNetUnfolder]: For 1835/1839 co-relation queries the response was YES. [2022-11-25 16:42:44,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2083 conditions, 408 events. 217/408 cut-off events. For 1835/1839 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1581 event pairs, 18 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 2057. Up to 142 conditions per place. [2022-11-25 16:42:44,905 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 40 selfloop transitions, 5 changer transitions 40/88 dead transitions. [2022-11-25 16:42:44,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 88 transitions, 849 flow [2022-11-25 16:42:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:42:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 16:42:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 936 transitions. [2022-11-25 16:42:44,910 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-11-25 16:42:44,910 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 936 transitions. [2022-11-25 16:42:44,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 936 transitions. [2022-11-25 16:42:44,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:44,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 936 transitions. [2022-11-25 16:42:44,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:44,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:44,918 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:44,918 INFO L175 Difference]: Start difference. First operand has 82 places, 46 transitions, 369 flow. Second operand 8 states and 936 transitions. [2022-11-25 16:42:44,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 88 transitions, 849 flow [2022-11-25 16:42:44,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 588 flow, removed 33 selfloop flow, removed 18 redundant places. [2022-11-25 16:42:44,928 INFO L231 Difference]: Finished difference. Result has 67 places, 40 transitions, 209 flow [2022-11-25 16:42:44,928 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=67, PETRI_TRANSITIONS=40} [2022-11-25 16:42:44,930 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2022-11-25 16:42:44,930 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 40 transitions, 209 flow [2022-11-25 16:42:44,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 9 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:44,931 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:44,932 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:44,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 16:42:44,932 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:42:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1610145239, now seen corresponding path program 3 times [2022-11-25 16:42:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:44,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113115171] [2022-11-25 16:42:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:42:44,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:42:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:42:45,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:42:45,066 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:42:45,068 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 16:42:45,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 16:42:45,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 16:42:45,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 16:42:45,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 16:42:45,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 16:42:45,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 16:42:45,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 16:42:45,072 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:45,082 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:42:45,082 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:42:45,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:42:45 BasicIcfg [2022-11-25 16:42:45,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:42:45,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:42:45,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:42:45,176 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:42:45,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:41:45" (3/4) ... [2022-11-25 16:42:45,179 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 16:42:45,287 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:42:45,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:42:45,288 INFO L158 Benchmark]: Toolchain (without parser) took 62056.47ms. Allocated memory was 151.0MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 104.1MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 891.8MB. Max. memory is 16.1GB. [2022-11-25 16:42:45,288 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 151.0MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:42:45,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 862.75ms. Allocated memory is still 151.0MB. Free memory was 103.8MB in the beginning and 76.8MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 16:42:45,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.02ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 76.8MB in the beginning and 177.8MB in the end (delta: -100.9MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-11-25 16:42:45,290 INFO L158 Benchmark]: Boogie Preprocessor took 98.51ms. Allocated memory is still 207.6MB. Free memory was 177.7MB in the beginning and 177.2MB in the end (delta: 508.8kB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-11-25 16:42:45,290 INFO L158 Benchmark]: RCFGBuilder took 1139.96ms. Allocated memory is still 207.6MB. Free memory was 177.2MB in the beginning and 143.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-25 16:42:45,291 INFO L158 Benchmark]: TraceAbstraction took 59684.39ms. Allocated memory was 207.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 142.8MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 856.8MB. Max. memory is 16.1GB. [2022-11-25 16:42:45,291 INFO L158 Benchmark]: Witness Printer took 112.31ms. Allocated memory is still 4.3GB. Free memory was 3.3GB in the beginning and 3.3GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 16:42:45,294 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.35ms. Allocated memory is still 151.0MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 862.75ms. Allocated memory is still 151.0MB. Free memory was 103.8MB in the beginning and 76.8MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.02ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 76.8MB in the beginning and 177.8MB in the end (delta: -100.9MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.51ms. Allocated memory is still 207.6MB. Free memory was 177.7MB in the beginning and 177.2MB in the end (delta: 508.8kB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1139.96ms. Allocated memory is still 207.6MB. Free memory was 177.2MB in the beginning and 143.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 59684.39ms. Allocated memory was 207.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 142.8MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 856.8MB. Max. memory is 16.1GB. * Witness Printer took 112.31ms. Allocated memory is still 4.3GB. Free memory was 3.3GB in the beginning and 3.3GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 140 PlacesBefore, 41 PlacesAfterwards, 129 TransitionsBefore, 29 TransitionsAfterwards, 2952 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 7180 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3901, independent: 3719, independent conditional: 0, independent unconditional: 3719, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2155, independent: 2100, independent conditional: 0, independent unconditional: 2100, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2155, independent: 2063, independent conditional: 0, independent unconditional: 2063, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 92, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 568, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 496, dependent conditional: 0, dependent unconditional: 496, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3901, independent: 1619, independent conditional: 0, independent unconditional: 1619, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 2155, unknown conditional: 0, unknown unconditional: 2155] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 214, Positive conditional cache size: 0, Positive unconditional cache size: 214, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-3, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-2, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] 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_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 839]: 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: 837]: 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: 843]: 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, 167 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: 59.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1538 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1311 mSDsluCounter, 856 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 706 mSDsCounter, 265 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3208 IncrementalHoareTripleChecker+Invalid, 3473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 265 mSolverCounterUnsat, 150 mSDtfsCounter, 3208 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2029occurred in iteration=14, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 3056 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 16:42:45,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eea55d1d-4636-4719-996c-53c3d858948e/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE