./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/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_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/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_d2068691-e6b8-4883-942e-5887b7e875d4/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 a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:29:25,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:29:25,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:29:25,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:29:25,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:29:25,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:29:25,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:29:25,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:29:25,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:29:25,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:29:25,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:29:25,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:29:25,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:29:25,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:29:25,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:29:25,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:29:25,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:29:25,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:29:25,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:29:25,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:29:25,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:29:25,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:29:25,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:29:25,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:29:25,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:29:25,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:29:25,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:29:25,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:29:25,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:29:25,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:29:25,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:29:25,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:29:25,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:29:25,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:29:25,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:29:25,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:29:25,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:29:25,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:29:25,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:29:25,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:29:25,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:29:25,563 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:29:25,602 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:29:25,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:29:25,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:29:25,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:29:25,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:29:25,605 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:29:25,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:29:25,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:29:25,606 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:29:25,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:29:25,607 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:29:25,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:29:25,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:29:25,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:29:25,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:29:25,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:29:25,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:29:25,608 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:29:25,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:29:25,609 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:29:25,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:29:25,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:29:25,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:29:25,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:29:25,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:29:25,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:29:25,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:29:25,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:29:25,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:29:25,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:29:25,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:29:25,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:29:25,612 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:29:25,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:29:25,613 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_d2068691-e6b8-4883-942e-5887b7e875d4/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_d2068691-e6b8-4883-942e-5887b7e875d4/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 -> a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef [2022-11-25 18:29:25,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:29:25,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:29:25,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:29:25,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:29:25,887 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:29:25,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2022-11-25 18:29:29,121 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:29:29,409 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:29:29,409 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2022-11-25 18:29:29,424 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/data/a2ba6ab33/2856ba2c69b24d3e9ade2db530c70eb6/FLAGd4567bfd1 [2022-11-25 18:29:29,438 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/data/a2ba6ab33/2856ba2c69b24d3e9ade2db530c70eb6 [2022-11-25 18:29:29,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:29:29,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:29:29,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:29:29,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:29:29,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:29:29,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:29:29" (1/1) ... [2022-11-25 18:29:29,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@479265df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:29, skipping insertion in model container [2022-11-25 18:29:29,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:29:29" (1/1) ... [2022-11-25 18:29:29,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:29:29,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:29:29,743 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_d2068691-e6b8-4883-942e-5887b7e875d4/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i[949,962] [2022-11-25 18:29:30,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:29:30,131 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:29:30,146 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_d2068691-e6b8-4883-942e-5887b7e875d4/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i[949,962] [2022-11-25 18:29:30,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:29:30,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:29:30,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:29:30,247 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:29:30,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30 WrapperNode [2022-11-25 18:29:30,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:29:30,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:29:30,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:29:30,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:29:30,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,318 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-11-25 18:29:30,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:29:30,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:29:30,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:29:30,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:29:30,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,361 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:29:30,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:29:30,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:29:30,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:29:30,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (1/1) ... [2022-11-25 18:29:30,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:29:30,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:29:30,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:29:30,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:29:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:29:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:29:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:29:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:29:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:29:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:29:30,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:29:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:29:30,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:29:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:29:30,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:29:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:29:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:29:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:29:30,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:29:30,488 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:29:30,745 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:29:30,747 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:29:31,133 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:29:31,453 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:29:31,456 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:29:31,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:29:31 BoogieIcfgContainer [2022-11-25 18:29:31,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:29:31,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:29:31,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:29:31,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:29:31,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:29:29" (1/3) ... [2022-11-25 18:29:31,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57597933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:29:31, skipping insertion in model container [2022-11-25 18:29:31,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:30" (2/3) ... [2022-11-25 18:29:31,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57597933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:29:31, skipping insertion in model container [2022-11-25 18:29:31,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:29:31" (3/3) ... [2022-11-25 18:29:31,473 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2022-11-25 18:29:31,483 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:29:31,495 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:29:31,495 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 18:29:31,496 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:29:31,583 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:29:31,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-11-25 18:29:31,695 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-11-25 18:29:31,696 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:29:31,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-11-25 18:29:31,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2022-11-25 18:29:31,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2022-11-25 18:29:31,710 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:29:31,729 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 245 flow [2022-11-25 18:29:31,732 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 245 flow [2022-11-25 18:29:31,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 245 flow [2022-11-25 18:29:31,765 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-11-25 18:29:31,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:29:31,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-11-25 18:29:31,768 INFO L119 LiptonReduction]: Number of co-enabled transitions 2398 [2022-11-25 18:29:38,818 INFO L134 LiptonReduction]: Checked pairs total: 6753 [2022-11-25 18:29:38,818 INFO L136 LiptonReduction]: Total number of compositions: 106 [2022-11-25 18:29:38,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:29:38,842 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;@24c6f394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:29:38,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 18:29:38,846 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-25 18:29:38,846 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:29:38,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:38,847 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:29:38,848 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:38,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:38,853 INFO L85 PathProgramCache]: Analyzing trace with hash 492105670, now seen corresponding path program 1 times [2022-11-25 18:29:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:38,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248887973] [2022-11-25 18:29:38,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:39,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248887973] [2022-11-25 18:29:39,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248887973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:39,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:39,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:29:39,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127267716] [2022-11-25 18:29:39,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:39,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:39,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:39,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:39,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:39,347 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 227 [2022-11-25 18:29:39,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:39,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:39,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 227 [2022-11-25 18:29:39,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:39,724 INFO L130 PetriNetUnfolder]: 711/1178 cut-off events. [2022-11-25 18:29:39,724 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 18:29:39,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 1178 events. 711/1178 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5791 event pairs, 197 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 2286. Up to 859 conditions per place. [2022-11-25 18:29:39,744 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 27 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-11-25 18:29:39,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 146 flow [2022-11-25 18:29:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:29:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2022-11-25 18:29:39,773 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5212922173274597 [2022-11-25 18:29:39,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2022-11-25 18:29:39,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2022-11-25 18:29:39,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:39,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2022-11-25 18:29:39,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:39,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:39,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:39,798 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 355 transitions. [2022-11-25 18:29:39,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 146 flow [2022-11-25 18:29:39,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 18:29:39,803 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2022-11-25 18:29:39,805 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-11-25 18:29:39,812 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-11-25 18:29:39,812 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2022-11-25 18:29:39,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:39,813 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:39,813 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:39,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:29:39,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1988743347, now seen corresponding path program 1 times [2022-11-25 18:29:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:39,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159423195] [2022-11-25 18:29:39,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:40,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:40,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159423195] [2022-11-25 18:29:40,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159423195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:40,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:40,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:29:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950538679] [2022-11-25 18:29:40,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:40,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:40,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:40,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:40,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:40,532 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 227 [2022-11-25 18:29:40,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:40,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:40,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 227 [2022-11-25 18:29:40,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:40,893 INFO L130 PetriNetUnfolder]: 1207/1794 cut-off events. [2022-11-25 18:29:40,894 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-11-25 18:29:40,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3728 conditions, 1794 events. 1207/1794 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8080 event pairs, 351 based on Foata normal form. 48/1841 useless extension candidates. Maximal degree in co-relation 3718. Up to 1345 conditions per place. [2022-11-25 18:29:40,906 INFO L137 encePairwiseOnDemand]: 224/227 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-11-25 18:29:40,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 150 flow [2022-11-25 18:29:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:29:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2022-11-25 18:29:40,908 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47430249632892807 [2022-11-25 18:29:40,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2022-11-25 18:29:40,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2022-11-25 18:29:40,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:40,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2022-11-25 18:29:40,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:40,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:40,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:40,914 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 3 states and 323 transitions. [2022-11-25 18:29:40,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 150 flow [2022-11-25 18:29:40,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:29:40,916 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 60 flow [2022-11-25 18:29:40,916 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-11-25 18:29:40,917 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-11-25 18:29:40,917 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 60 flow [2022-11-25 18:29:40,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:40,918 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:40,918 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:40,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:29:40,919 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -112152066, now seen corresponding path program 1 times [2022-11-25 18:29:40,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:40,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160581931] [2022-11-25 18:29:40,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:41,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160581931] [2022-11-25 18:29:41,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160581931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:41,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:41,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:29:41,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949899660] [2022-11-25 18:29:41,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:41,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:41,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:41,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:41,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:41,227 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 227 [2022-11-25 18:29:41,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:41,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:41,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 227 [2022-11-25 18:29:41,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:41,454 INFO L130 PetriNetUnfolder]: 602/981 cut-off events. [2022-11-25 18:29:41,455 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-11-25 18:29:41,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1995 conditions, 981 events. 602/981 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4556 event pairs, 239 based on Foata normal form. 24/992 useless extension candidates. Maximal degree in co-relation 1984. Up to 568 conditions per place. [2022-11-25 18:29:41,462 INFO L137 encePairwiseOnDemand]: 224/227 looper letters, 25 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-11-25 18:29:41,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 130 flow [2022-11-25 18:29:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:29:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2022-11-25 18:29:41,464 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5080763582966226 [2022-11-25 18:29:41,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2022-11-25 18:29:41,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2022-11-25 18:29:41,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:41,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2022-11-25 18:29:41,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:41,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:41,469 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:41,469 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 60 flow. Second operand 3 states and 346 transitions. [2022-11-25 18:29:41,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 130 flow [2022-11-25 18:29:41,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:29:41,471 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 64 flow [2022-11-25 18:29:41,471 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-11-25 18:29:41,473 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2022-11-25 18:29:41,473 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 64 flow [2022-11-25 18:29:41,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:41,473 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:41,473 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:41,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:29:41,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:41,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:41,475 INFO L85 PathProgramCache]: Analyzing trace with hash 372653299, now seen corresponding path program 1 times [2022-11-25 18:29:41,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:41,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510540246] [2022-11-25 18:29:41,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:41,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:42,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:42,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510540246] [2022-11-25 18:29:42,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510540246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:42,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:42,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:42,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504643282] [2022-11-25 18:29:42,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:42,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:29:42,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:42,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:29:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:29:42,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 227 [2022-11-25 18:29:42,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:42,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:42,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 227 [2022-11-25 18:29:42,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:42,640 INFO L130 PetriNetUnfolder]: 667/1093 cut-off events. [2022-11-25 18:29:42,641 INFO L131 PetriNetUnfolder]: For 120/120 co-relation queries the response was YES. [2022-11-25 18:29:42,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 1093 events. 667/1093 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4974 event pairs, 289 based on Foata normal form. 3/1068 useless extension candidates. Maximal degree in co-relation 2287. Up to 935 conditions per place. [2022-11-25 18:29:42,648 INFO L137 encePairwiseOnDemand]: 219/227 looper letters, 32 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2022-11-25 18:29:42,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 192 flow [2022-11-25 18:29:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:29:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2022-11-25 18:29:42,651 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.512114537444934 [2022-11-25 18:29:42,651 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2022-11-25 18:29:42,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2022-11-25 18:29:42,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:42,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2022-11-25 18:29:42,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:42,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:42,656 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:42,656 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 64 flow. Second operand 4 states and 465 transitions. [2022-11-25 18:29:42,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 192 flow [2022-11-25 18:29:42,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:29:42,658 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 113 flow [2022-11-25 18:29:42,658 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-11-25 18:29:42,659 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-11-25 18:29:42,659 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 113 flow [2022-11-25 18:29:42,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:42,660 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:42,660 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:42,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:29:42,660 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:42,661 INFO L85 PathProgramCache]: Analyzing trace with hash -297764235, now seen corresponding path program 2 times [2022-11-25 18:29:42,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:42,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612701813] [2022-11-25 18:29:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:43,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:43,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612701813] [2022-11-25 18:29:43,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612701813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:43,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:43,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:29:43,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921228574] [2022-11-25 18:29:43,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:43,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:29:43,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:43,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:29:43,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:29:44,087 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2022-11-25 18:29:44,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:44,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:44,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2022-11-25 18:29:44,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:44,611 INFO L130 PetriNetUnfolder]: 1749/2578 cut-off events. [2022-11-25 18:29:44,611 INFO L131 PetriNetUnfolder]: For 1128/1128 co-relation queries the response was YES. [2022-11-25 18:29:44,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6869 conditions, 2578 events. 1749/2578 cut-off events. For 1128/1128 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11269 event pairs, 485 based on Foata normal form. 24/2602 useless extension candidates. Maximal degree in co-relation 6855. Up to 1995 conditions per place. [2022-11-25 18:29:44,629 INFO L137 encePairwiseOnDemand]: 217/227 looper letters, 57 selfloop transitions, 18 changer transitions 0/75 dead transitions. [2022-11-25 18:29:44,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 75 transitions, 402 flow [2022-11-25 18:29:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:29:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:29:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2022-11-25 18:29:44,635 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46784140969162996 [2022-11-25 18:29:44,636 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2022-11-25 18:29:44,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2022-11-25 18:29:44,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:44,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2022-11-25 18:29:44,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:44,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:44,647 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:44,647 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 113 flow. Second operand 5 states and 531 transitions. [2022-11-25 18:29:44,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 75 transitions, 402 flow [2022-11-25 18:29:44,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 75 transitions, 402 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:29:44,653 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 259 flow [2022-11-25 18:29:44,653 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-11-25 18:29:44,655 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2022-11-25 18:29:44,656 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 259 flow [2022-11-25 18:29:44,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:44,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:44,658 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:44,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:29:44,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2126395632, now seen corresponding path program 1 times [2022-11-25 18:29:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:44,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780216622] [2022-11-25 18:29:44,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:44,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:45,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:45,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780216622] [2022-11-25 18:29:45,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780216622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:45,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:45,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:29:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9588965] [2022-11-25 18:29:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:45,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:29:45,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:45,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:29:45,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:29:45,640 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2022-11-25 18:29:45,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:45,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:45,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2022-11-25 18:29:45,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:46,316 INFO L130 PetriNetUnfolder]: 1816/2677 cut-off events. [2022-11-25 18:29:46,316 INFO L131 PetriNetUnfolder]: For 3398/3398 co-relation queries the response was YES. [2022-11-25 18:29:46,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9059 conditions, 2677 events. 1816/2677 cut-off events. For 3398/3398 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11935 event pairs, 285 based on Foata normal form. 8/2685 useless extension candidates. Maximal degree in co-relation 9040. Up to 2210 conditions per place. [2022-11-25 18:29:46,340 INFO L137 encePairwiseOnDemand]: 217/227 looper letters, 78 selfloop transitions, 25 changer transitions 0/103 dead transitions. [2022-11-25 18:29:46,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 103 transitions, 704 flow [2022-11-25 18:29:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:29:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:29:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 735 transitions. [2022-11-25 18:29:46,344 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46255506607929514 [2022-11-25 18:29:46,344 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 735 transitions. [2022-11-25 18:29:46,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 735 transitions. [2022-11-25 18:29:46,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:46,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 735 transitions. [2022-11-25 18:29:46,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:46,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:46,350 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:46,350 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 259 flow. Second operand 7 states and 735 transitions. [2022-11-25 18:29:46,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 103 transitions, 704 flow [2022-11-25 18:29:46,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 103 transitions, 696 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-25 18:29:46,359 INFO L231 Difference]: Finished difference. Result has 54 places, 60 transitions, 453 flow [2022-11-25 18:29:46,360 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=453, PETRI_PLACES=54, PETRI_TRANSITIONS=60} [2022-11-25 18:29:46,360 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2022-11-25 18:29:46,361 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 60 transitions, 453 flow [2022-11-25 18:29:46,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:46,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:46,361 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:46,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:29:46,361 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:46,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:46,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1698715204, now seen corresponding path program 2 times [2022-11-25 18:29:46,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:46,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441846338] [2022-11-25 18:29:46,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:46,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:46,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:46,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441846338] [2022-11-25 18:29:46,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441846338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:46,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:46,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:29:46,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129981031] [2022-11-25 18:29:46,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:46,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:29:46,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:46,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:29:46,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:29:46,800 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-11-25 18:29:46,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 60 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 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 18:29:46,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:46,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-11-25 18:29:46,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:47,266 INFO L130 PetriNetUnfolder]: 981/1667 cut-off events. [2022-11-25 18:29:47,279 INFO L131 PetriNetUnfolder]: For 4944/5104 co-relation queries the response was YES. [2022-11-25 18:29:47,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6734 conditions, 1667 events. 981/1667 cut-off events. For 4944/5104 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8958 event pairs, 179 based on Foata normal form. 18/1619 useless extension candidates. Maximal degree in co-relation 6709. Up to 1110 conditions per place. [2022-11-25 18:29:47,311 INFO L137 encePairwiseOnDemand]: 219/227 looper letters, 59 selfloop transitions, 24 changer transitions 0/92 dead transitions. [2022-11-25 18:29:47,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 796 flow [2022-11-25 18:29:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:29:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:29:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-11-25 18:29:47,323 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4986784140969163 [2022-11-25 18:29:47,324 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 566 transitions. [2022-11-25 18:29:47,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions. [2022-11-25 18:29:47,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:47,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions. [2022-11-25 18:29:47,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:47,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:47,328 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:47,328 INFO L175 Difference]: Start difference. First operand has 54 places, 60 transitions, 453 flow. Second operand 5 states and 566 transitions. [2022-11-25 18:29:47,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 796 flow [2022-11-25 18:29:47,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 749 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-11-25 18:29:47,344 INFO L231 Difference]: Finished difference. Result has 59 places, 70 transitions, 595 flow [2022-11-25 18:29:47,345 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=595, PETRI_PLACES=59, PETRI_TRANSITIONS=70} [2022-11-25 18:29:47,345 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2022-11-25 18:29:47,346 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 70 transitions, 595 flow [2022-11-25 18:29:47,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 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 18:29:47,346 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:47,346 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:47,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:29:47,347 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:47,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:47,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1924660886, now seen corresponding path program 1 times [2022-11-25 18:29:47,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:47,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954680539] [2022-11-25 18:29:47,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:47,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:47,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954680539] [2022-11-25 18:29:47,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954680539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:47,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:47,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:29:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107804054] [2022-11-25 18:29:47,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:47,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:29:47,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:47,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:29:47,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:29:47,958 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2022-11-25 18:29:47,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 70 transitions, 595 flow. Second operand has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 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 18:29:47,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:47,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2022-11-25 18:29:47,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:49,147 INFO L130 PetriNetUnfolder]: 2958/4418 cut-off events. [2022-11-25 18:29:49,147 INFO L131 PetriNetUnfolder]: For 19876/19900 co-relation queries the response was YES. [2022-11-25 18:29:49,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19415 conditions, 4418 events. 2958/4418 cut-off events. For 19876/19900 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22921 event pairs, 169 based on Foata normal form. 113/4465 useless extension candidates. Maximal degree in co-relation 19387. Up to 1873 conditions per place. [2022-11-25 18:29:49,194 INFO L137 encePairwiseOnDemand]: 217/227 looper letters, 111 selfloop transitions, 38 changer transitions 58/211 dead transitions. [2022-11-25 18:29:49,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 211 transitions, 2131 flow [2022-11-25 18:29:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:29:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 18:29:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 931 transitions. [2022-11-25 18:29:49,198 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.455702398433676 [2022-11-25 18:29:49,198 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 931 transitions. [2022-11-25 18:29:49,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 931 transitions. [2022-11-25 18:29:49,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:49,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 931 transitions. [2022-11-25 18:29:49,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.44444444444444) internal successors, (931), 9 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:49,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:49,209 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:49,209 INFO L175 Difference]: Start difference. First operand has 59 places, 70 transitions, 595 flow. Second operand 9 states and 931 transitions. [2022-11-25 18:29:49,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 211 transitions, 2131 flow [2022-11-25 18:29:49,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 211 transitions, 1958 flow, removed 67 selfloop flow, removed 1 redundant places. [2022-11-25 18:29:49,271 INFO L231 Difference]: Finished difference. Result has 73 places, 101 transitions, 1071 flow [2022-11-25 18:29:49,272 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1071, PETRI_PLACES=73, PETRI_TRANSITIONS=101} [2022-11-25 18:29:49,273 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2022-11-25 18:29:49,273 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 101 transitions, 1071 flow [2022-11-25 18:29:49,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 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 18:29:49,274 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:49,274 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:49,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:29:49,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:49,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:49,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1609995042, now seen corresponding path program 1 times [2022-11-25 18:29:49,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:49,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696011943] [2022-11-25 18:29:49,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:49,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:50,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696011943] [2022-11-25 18:29:50,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696011943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:50,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:50,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:29:50,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767545360] [2022-11-25 18:29:50,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:50,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:29:50,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:50,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:29:50,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:29:50,075 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 227 [2022-11-25 18:29:50,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 101 transitions, 1071 flow. Second operand has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:50,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:50,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 227 [2022-11-25 18:29:50,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:50,787 INFO L130 PetriNetUnfolder]: 1568/2734 cut-off events. [2022-11-25 18:29:50,787 INFO L131 PetriNetUnfolder]: For 22016/22288 co-relation queries the response was YES. [2022-11-25 18:29:50,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14017 conditions, 2734 events. 1568/2734 cut-off events. For 22016/22288 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16750 event pairs, 328 based on Foata normal form. 65/2696 useless extension candidates. Maximal degree in co-relation 13981. Up to 1872 conditions per place. [2022-11-25 18:29:50,819 INFO L137 encePairwiseOnDemand]: 219/227 looper letters, 82 selfloop transitions, 36 changer transitions 0/129 dead transitions. [2022-11-25 18:29:50,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 129 transitions, 1490 flow [2022-11-25 18:29:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:29:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:29:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-11-25 18:29:50,822 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5030837004405286 [2022-11-25 18:29:50,822 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 571 transitions. [2022-11-25 18:29:50,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 571 transitions. [2022-11-25 18:29:50,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:50,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 571 transitions. [2022-11-25 18:29:50,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:50,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:50,829 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:50,829 INFO L175 Difference]: Start difference. First operand has 73 places, 101 transitions, 1071 flow. Second operand 5 states and 571 transitions. [2022-11-25 18:29:50,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 129 transitions, 1490 flow [2022-11-25 18:29:50,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 1446 flow, removed 22 selfloop flow, removed 1 redundant places. [2022-11-25 18:29:50,877 INFO L231 Difference]: Finished difference. Result has 75 places, 103 transitions, 1164 flow [2022-11-25 18:29:50,877 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1164, PETRI_PLACES=75, PETRI_TRANSITIONS=103} [2022-11-25 18:29:50,878 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2022-11-25 18:29:50,879 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 103 transitions, 1164 flow [2022-11-25 18:29:50,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:50,882 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:50,882 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:50,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:29:50,883 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash 197051598, now seen corresponding path program 2 times [2022-11-25 18:29:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:50,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834272010] [2022-11-25 18:29:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:51,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:51,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834272010] [2022-11-25 18:29:51,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834272010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:51,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:51,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:51,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689084412] [2022-11-25 18:29:51,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:51,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:51,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:51,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:51,112 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 227 [2022-11-25 18:29:51,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 103 transitions, 1164 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:51,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:51,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 227 [2022-11-25 18:29:51,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:51,574 INFO L130 PetriNetUnfolder]: 1079/1917 cut-off events. [2022-11-25 18:29:51,575 INFO L131 PetriNetUnfolder]: For 31174/31670 co-relation queries the response was YES. [2022-11-25 18:29:51,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10931 conditions, 1917 events. 1079/1917 cut-off events. For 31174/31670 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11815 event pairs, 185 based on Foata normal form. 379/2212 useless extension candidates. Maximal degree in co-relation 10893. Up to 965 conditions per place. [2022-11-25 18:29:51,594 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 119 selfloop transitions, 8 changer transitions 21/162 dead transitions. [2022-11-25 18:29:51,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 162 transitions, 2242 flow [2022-11-25 18:29:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:29:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:29:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2022-11-25 18:29:51,597 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4863436123348018 [2022-11-25 18:29:51,597 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2022-11-25 18:29:51,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2022-11-25 18:29:51,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:51,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2022-11-25 18:29:51,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:51,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:51,603 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:51,603 INFO L175 Difference]: Start difference. First operand has 75 places, 103 transitions, 1164 flow. Second operand 5 states and 552 transitions. [2022-11-25 18:29:51,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 162 transitions, 2242 flow [2022-11-25 18:29:51,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 162 transitions, 2049 flow, removed 68 selfloop flow, removed 3 redundant places. [2022-11-25 18:29:51,645 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 873 flow [2022-11-25 18:29:51,646 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=873, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2022-11-25 18:29:51,647 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2022-11-25 18:29:51,648 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 873 flow [2022-11-25 18:29:51,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:51,648 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:51,648 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:51,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:29:51,649 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:51,650 INFO L85 PathProgramCache]: Analyzing trace with hash 547424754, now seen corresponding path program 1 times [2022-11-25 18:29:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:51,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516107244] [2022-11-25 18:29:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:51,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:51,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516107244] [2022-11-25 18:29:51,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516107244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:51,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:51,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:29:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679344281] [2022-11-25 18:29:51,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:51,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:29:51,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:51,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:29:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:29:51,845 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 227 [2022-11-25 18:29:51,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 873 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:51,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:51,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 227 [2022-11-25 18:29:51,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:52,277 INFO L130 PetriNetUnfolder]: 804/1498 cut-off events. [2022-11-25 18:29:52,277 INFO L131 PetriNetUnfolder]: For 19750/20140 co-relation queries the response was YES. [2022-11-25 18:29:52,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8293 conditions, 1498 events. 804/1498 cut-off events. For 19750/20140 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9131 event pairs, 72 based on Foata normal form. 211/1678 useless extension candidates. Maximal degree in co-relation 8253. Up to 453 conditions per place. [2022-11-25 18:29:52,290 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 118 selfloop transitions, 14 changer transitions 28/174 dead transitions. [2022-11-25 18:29:52,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 174 transitions, 2219 flow [2022-11-25 18:29:52,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:29:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:29:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2022-11-25 18:29:52,294 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48646947765890497 [2022-11-25 18:29:52,294 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2022-11-25 18:29:52,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2022-11-25 18:29:52,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:52,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2022-11-25 18:29:52,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:52,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:52,300 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:52,301 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 873 flow. Second operand 7 states and 773 transitions. [2022-11-25 18:29:52,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 174 transitions, 2219 flow [2022-11-25 18:29:52,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 174 transitions, 1989 flow, removed 47 selfloop flow, removed 5 redundant places. [2022-11-25 18:29:52,324 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 791 flow [2022-11-25 18:29:52,324 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=791, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2022-11-25 18:29:52,325 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2022-11-25 18:29:52,325 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 791 flow [2022-11-25 18:29:52,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:52,325 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:52,325 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] [2022-11-25 18:29:52,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:29:52,326 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:52,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:52,326 INFO L85 PathProgramCache]: Analyzing trace with hash -346443880, now seen corresponding path program 1 times [2022-11-25 18:29:52,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:52,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962340328] [2022-11-25 18:29:52,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:52,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:52,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:52,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962340328] [2022-11-25 18:29:52,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962340328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:52,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:52,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:29:52,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820631392] [2022-11-25 18:29:52,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:52,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:29:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:52,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:29:52,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:29:52,843 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2022-11-25 18:29:52,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 791 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:52,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:52,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2022-11-25 18:29:52,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:53,710 INFO L130 PetriNetUnfolder]: 1881/3263 cut-off events. [2022-11-25 18:29:53,711 INFO L131 PetriNetUnfolder]: For 21535/21549 co-relation queries the response was YES. [2022-11-25 18:29:53,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17553 conditions, 3263 events. 1881/3263 cut-off events. For 21535/21549 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20183 event pairs, 449 based on Foata normal form. 9/3264 useless extension candidates. Maximal degree in co-relation 17511. Up to 1813 conditions per place. [2022-11-25 18:29:53,732 INFO L137 encePairwiseOnDemand]: 220/227 looper letters, 84 selfloop transitions, 10 changer transitions 73/171 dead transitions. [2022-11-25 18:29:53,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 171 transitions, 1953 flow [2022-11-25 18:29:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:29:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:29:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2022-11-25 18:29:53,735 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4632892804698972 [2022-11-25 18:29:53,735 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 631 transitions. [2022-11-25 18:29:53,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 631 transitions. [2022-11-25 18:29:53,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:53,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 631 transitions. [2022-11-25 18:29:53,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 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 18:29:53,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:53,741 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:53,741 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 791 flow. Second operand 6 states and 631 transitions. [2022-11-25 18:29:53,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 171 transitions, 1953 flow [2022-11-25 18:29:53,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 171 transitions, 1874 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-11-25 18:29:53,830 INFO L231 Difference]: Finished difference. Result has 88 places, 66 transitions, 661 flow [2022-11-25 18:29:53,830 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=661, PETRI_PLACES=88, PETRI_TRANSITIONS=66} [2022-11-25 18:29:53,832 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 53 predicate places. [2022-11-25 18:29:53,832 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 66 transitions, 661 flow [2022-11-25 18:29:53,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:53,833 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:53,833 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:53,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:29:53,833 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash -130167430, now seen corresponding path program 1 times [2022-11-25 18:29:53,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:53,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447351477] [2022-11-25 18:29:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:54,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447351477] [2022-11-25 18:29:54,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447351477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:54,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:54,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:29:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488924558] [2022-11-25 18:29:54,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:54,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:29:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:54,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:29:54,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:29:54,082 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 227 [2022-11-25 18:29:54,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 66 transitions, 661 flow. Second operand has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:54,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:29:54,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 227 [2022-11-25 18:29:54,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:29:54,381 INFO L130 PetriNetUnfolder]: 425/903 cut-off events. [2022-11-25 18:29:54,381 INFO L131 PetriNetUnfolder]: For 7977/8032 co-relation queries the response was YES. [2022-11-25 18:29:54,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 903 events. 425/903 cut-off events. For 7977/8032 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5369 event pairs, 59 based on Foata normal form. 50/934 useless extension candidates. Maximal degree in co-relation 4725. Up to 302 conditions per place. [2022-11-25 18:29:54,388 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 28 selfloop transitions, 10 changer transitions 59/102 dead transitions. [2022-11-25 18:29:54,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 102 transitions, 1155 flow [2022-11-25 18:29:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:29:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:29:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 754 transitions. [2022-11-25 18:29:54,392 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47451227186910006 [2022-11-25 18:29:54,392 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 754 transitions. [2022-11-25 18:29:54,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 754 transitions. [2022-11-25 18:29:54,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:29:54,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 754 transitions. [2022-11-25 18:29:54,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.71428571428571) internal successors, (754), 7 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:54,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:54,399 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:54,399 INFO L175 Difference]: Start difference. First operand has 88 places, 66 transitions, 661 flow. Second operand 7 states and 754 transitions. [2022-11-25 18:29:54,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 102 transitions, 1155 flow [2022-11-25 18:29:54,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 102 transitions, 1096 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-11-25 18:29:54,414 INFO L231 Difference]: Finished difference. Result has 88 places, 32 transitions, 280 flow [2022-11-25 18:29:54,414 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=280, PETRI_PLACES=88, PETRI_TRANSITIONS=32} [2022-11-25 18:29:54,415 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 53 predicate places. [2022-11-25 18:29:54,415 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 32 transitions, 280 flow [2022-11-25 18:29:54,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:54,416 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:29:54,416 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] [2022-11-25 18:29:54,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:29:54,417 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:29:54,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:54,417 INFO L85 PathProgramCache]: Analyzing trace with hash -730596163, now seen corresponding path program 1 times [2022-11-25 18:29:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:54,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057111733] [2022-11-25 18:29:54,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:54,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:29:54,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:29:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:29:54,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:29:54,577 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:29:54,579 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 18:29:54,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 18:29:54,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 18:29:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 18:29:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 18:29:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 18:29:54,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:29:54,583 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:54,592 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:29:54,592 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:29:54,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:29:54 BasicIcfg [2022-11-25 18:29:54,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:29:54,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:29:54,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:29:54,683 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:29:54,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:29:31" (3/4) ... [2022-11-25 18:29:54,685 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:29:54,758 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:29:54,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:29:54,759 INFO L158 Benchmark]: Toolchain (without parser) took 25312.82ms. Allocated memory was 148.9MB in the beginning and 457.2MB in the end (delta: 308.3MB). Free memory was 106.4MB in the beginning and 156.5MB in the end (delta: -50.1MB). Peak memory consumption was 259.0MB. Max. memory is 16.1GB. [2022-11-25 18:29:54,759 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 148.9MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:29:54,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 800.81ms. Allocated memory is still 148.9MB. Free memory was 106.4MB in the beginning and 78.9MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 18:29:54,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.61ms. Allocated memory is still 148.9MB. Free memory was 78.9MB in the beginning and 76.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:29:54,760 INFO L158 Benchmark]: Boogie Preprocessor took 47.65ms. Allocated memory is still 148.9MB. Free memory was 76.1MB in the beginning and 74.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:29:54,761 INFO L158 Benchmark]: RCFGBuilder took 1094.42ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 74.3MB in the beginning and 127.2MB in the end (delta: -52.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-11-25 18:29:54,761 INFO L158 Benchmark]: TraceAbstraction took 23217.33ms. Allocated memory was 180.4MB in the beginning and 457.2MB in the end (delta: 276.8MB). Free memory was 126.5MB in the beginning and 169.1MB in the end (delta: -42.6MB). Peak memory consumption was 235.6MB. Max. memory is 16.1GB. [2022-11-25 18:29:54,761 INFO L158 Benchmark]: Witness Printer took 75.78ms. Allocated memory is still 457.2MB. Free memory was 169.1MB in the beginning and 156.5MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:29:54,763 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.28ms. Allocated memory is still 148.9MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 800.81ms. Allocated memory is still 148.9MB. Free memory was 106.4MB in the beginning and 78.9MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.61ms. Allocated memory is still 148.9MB. Free memory was 78.9MB in the beginning and 76.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.65ms. Allocated memory is still 148.9MB. Free memory was 76.1MB in the beginning and 74.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1094.42ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 74.3MB in the beginning and 127.2MB in the end (delta: -52.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23217.33ms. Allocated memory was 180.4MB in the beginning and 457.2MB in the end (delta: 276.8MB). Free memory was 126.5MB in the beginning and 169.1MB in the end (delta: -42.6MB). Peak memory consumption was 235.6MB. Max. memory is 16.1GB. * Witness Printer took 75.78ms. Allocated memory is still 457.2MB. Free memory was 169.1MB in the beginning and 156.5MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 126 PlacesBefore, 35 PlacesAfterwards, 118 TransitionsBefore, 26 TransitionsAfterwards, 2398 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 6753 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3482, independent: 3268, independent conditional: 0, independent unconditional: 3268, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1877, independent: 1786, independent conditional: 0, independent unconditional: 1786, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1877, independent: 1760, independent conditional: 0, independent unconditional: 1760, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 117, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 868, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 831, dependent conditional: 0, dependent unconditional: 831, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3482, independent: 1482, independent conditional: 0, independent unconditional: 1482, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 1877, unknown conditional: 0, unknown unconditional: 1877] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299, ((void *)0), P0, ((void *)0))=-1, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300, ((void *)0), P1, ((void *)0))=0, t299={5:0}, t300={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L839] 0 pthread_t t301; [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t301, ((void *)0), P2, ((void *)0))=1, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 665 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 528 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 217 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1539 IncrementalHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 117 mSDtfsCounter, 1539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=9, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 2216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 18:29:54,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2068691-e6b8-4883-942e-5887b7e875d4/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