./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:50:35,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:50:35,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:50:35,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:50:35,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:50:35,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:50:35,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:50:35,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:50:35,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:50:35,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:50:35,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:50:35,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:50:35,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:50:35,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:50:35,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:50:35,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:50:35,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:50:35,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:50:35,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:50:35,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:50:35,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:50:35,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:50:35,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:50:35,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:50:35,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:50:35,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:50:35,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:50:35,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:50:35,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:50:35,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:50:35,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:50:35,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:50:35,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:50:35,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:50:35,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:50:35,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:50:35,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:50:35,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:50:35,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:50:35,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:50:35,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:50:35,881 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 19:50:35,895 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:50:35,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:50:35,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:50:35,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:50:35,896 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:50:35,896 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:50:35,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:50:35,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:50:35,903 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:50:35,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:50:35,903 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:50:35,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:50:35,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:50:35,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:50:35,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:50:35,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:50:35,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:50:35,905 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:50:35,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:50:35,905 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:50:35,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:50:35,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:50:35,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:50:35,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:50:35,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:50:35,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:50:35,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:50:35,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:50:35,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:50:35,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:50:35,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:50:35,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:50:35,907 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:50:35,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:50:35,907 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:50:35,907 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_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 [2022-12-13 19:50:36,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:50:36,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:50:36,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:50:36,096 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:50:36,096 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:50:36,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix001.opt.i [2022-12-13 19:50:38,664 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:50:38,893 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:50:38,894 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/sv-benchmarks/c/pthread-wmm/mix001.opt.i [2022-12-13 19:50:38,905 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/data/b4731421a/ac883f076d8546b890378eb55213232c/FLAG20b8ceaaf [2022-12-13 19:50:39,237 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/data/b4731421a/ac883f076d8546b890378eb55213232c [2022-12-13 19:50:39,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:50:39,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:50:39,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:50:39,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:50:39,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:50:39,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4d3b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39, skipping insertion in model container [2022-12-13 19:50:39,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:50:39,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:50:39,384 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_6e5bb826-d548-4b2d-8914-798edb2ba789/sv-benchmarks/c/pthread-wmm/mix001.opt.i[944,957] [2022-12-13 19:50:39,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:50:39,523 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:50:39,534 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_6e5bb826-d548-4b2d-8914-798edb2ba789/sv-benchmarks/c/pthread-wmm/mix001.opt.i[944,957] [2022-12-13 19:50:39,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:50:39,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:50:39,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:50:39,609 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:50:39,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39 WrapperNode [2022-12-13 19:50:39,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:50:39,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:50:39,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:50:39,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:50:39,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,644 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-13 19:50:39,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:50:39,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:50:39,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:50:39,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:50:39,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,663 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:50:39,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:50:39,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:50:39,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:50:39,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (1/1) ... [2022-12-13 19:50:39,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:50:39,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:50:39,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:50:39,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:50:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:50:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 19:50:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:50:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:50:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:50:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 19:50:39,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 19:50:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 19:50:39,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 19:50:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 19:50:39,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 19:50:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:50:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 19:50:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:50:39,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:50:39,726 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 19:50:39,835 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:50:39,837 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:50:40,079 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:50:40,185 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:50:40,185 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 19:50:40,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:50:40 BoogieIcfgContainer [2022-12-13 19:50:40,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:50:40,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:50:40,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:50:40,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:50:40,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:50:39" (1/3) ... [2022-12-13 19:50:40,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71abf50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:50:40, skipping insertion in model container [2022-12-13 19:50:40,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:39" (2/3) ... [2022-12-13 19:50:40,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71abf50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:50:40, skipping insertion in model container [2022-12-13 19:50:40,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:50:40" (3/3) ... [2022-12-13 19:50:40,196 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.opt.i [2022-12-13 19:50:40,204 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 19:50:40,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:50:40,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 19:50:40,214 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 19:50:40,259 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:50:40,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-12-13 19:50:40,336 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-12-13 19:50:40,337 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:50:40,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-13 19:50:40,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-12-13 19:50:40,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-12-13 19:50:40,347 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:50:40,355 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2022-12-13 19:50:40,357 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2022-12-13 19:50:40,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2022-12-13 19:50:40,375 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-12-13 19:50:40,375 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:50:40,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-13 19:50:40,377 INFO L119 LiptonReduction]: Number of co-enabled transitions 2162 [2022-12-13 19:50:43,141 INFO L134 LiptonReduction]: Checked pairs total: 5527 [2022-12-13 19:50:43,141 INFO L136 LiptonReduction]: Total number of compositions: 107 [2022-12-13 19:50:43,155 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:50:43,159 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;@60fcbb6f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:50:43,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 19:50:43,163 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-13 19:50:43,163 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:50:43,163 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:43,164 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:43,164 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:43,167 INFO L85 PathProgramCache]: Analyzing trace with hash 131061030, now seen corresponding path program 1 times [2022-12-13 19:50:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:43,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332281872] [2022-12-13 19:50:43,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:43,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:43,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:43,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332281872] [2022-12-13 19:50:43,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332281872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:43,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:43,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:50:43,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509127559] [2022-12-13 19:50:43,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:43,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:50:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:50:43,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:50:43,521 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 227 [2022-12-13 19:50:43,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 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-12-13 19:50:43,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:43,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 227 [2022-12-13 19:50:43,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:43,738 INFO L130 PetriNetUnfolder]: 644/1043 cut-off events. [2022-12-13 19:50:43,738 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 19:50:43,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 1043 events. 644/1043 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5347 event pairs, 112 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 2044. Up to 773 conditions per place. [2022-12-13 19:50:43,746 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 24 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2022-12-13 19:50:43,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 129 flow [2022-12-13 19:50:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:50:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:50:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2022-12-13 19:50:43,766 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5168869309838473 [2022-12-13 19:50:43,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2022-12-13 19:50:43,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2022-12-13 19:50:43,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:43,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2022-12-13 19:50:43,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:43,778 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-12-13 19:50:43,779 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-12-13 19:50:43,780 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 352 transitions. [2022-12-13 19:50:43,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 129 flow [2022-12-13 19:50:43,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 19:50:43,785 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-12-13 19:50:43,787 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=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-13 19:50:43,790 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-13 19:50:43,790 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-12-13 19:50:43,791 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-12-13 19:50:43,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:43,791 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:43,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:50:43,792 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1395663710, now seen corresponding path program 1 times [2022-12-13 19:50:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:43,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228455099] [2022-12-13 19:50:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:43,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228455099] [2022-12-13 19:50:43,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228455099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:43,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:43,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:50:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787266173] [2022-12-13 19:50:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:43,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:50:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:50:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:50:43,996 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2022-12-13 19:50:43,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:43,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:43,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2022-12-13 19:50:43,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:44,292 INFO L130 PetriNetUnfolder]: 1375/2028 cut-off events. [2022-12-13 19:50:44,292 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-13 19:50:44,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4218 conditions, 2028 events. 1375/2028 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8290 event pairs, 597 based on Foata normal form. 8/2036 useless extension candidates. Maximal degree in co-relation 4208. Up to 1953 conditions per place. [2022-12-13 19:50:44,303 INFO L137 encePairwiseOnDemand]: 222/227 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-13 19:50:44,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 152 flow [2022-12-13 19:50:44,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:50:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:50:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2022-12-13 19:50:44,306 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4831130690161527 [2022-12-13 19:50:44,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2022-12-13 19:50:44,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2022-12-13 19:50:44,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:44,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2022-12-13 19:50:44,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:44,310 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-12-13 19:50:44,310 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-12-13 19:50:44,310 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 329 transitions. [2022-12-13 19:50:44,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 152 flow [2022-12-13 19:50:44,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:50:44,312 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 76 flow [2022-12-13 19:50:44,312 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-12-13 19:50:44,313 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-13 19:50:44,313 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 76 flow [2022-12-13 19:50:44,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:44,314 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:44,314 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:44,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:50:44,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash -807623205, now seen corresponding path program 1 times [2022-12-13 19:50:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:44,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863978473] [2022-12-13 19:50:44,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:44,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:44,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863978473] [2022-12-13 19:50:44,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863978473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:44,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:44,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:50:44,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361669836] [2022-12-13 19:50:44,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:44,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:50:44,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:44,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:50:44,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:50:44,502 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2022-12-13 19:50:44,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:44,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:44,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2022-12-13 19:50:44,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:44,706 INFO L130 PetriNetUnfolder]: 1269/1880 cut-off events. [2022-12-13 19:50:44,706 INFO L131 PetriNetUnfolder]: For 312/312 co-relation queries the response was YES. [2022-12-13 19:50:44,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1880 events. 1269/1880 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7457 event pairs, 405 based on Foata normal form. 42/1922 useless extension candidates. Maximal degree in co-relation 4279. Up to 1316 conditions per place. [2022-12-13 19:50:44,713 INFO L137 encePairwiseOnDemand]: 224/227 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-13 19:50:44,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 170 flow [2022-12-13 19:50:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:50:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:50:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-12-13 19:50:44,714 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4801762114537445 [2022-12-13 19:50:44,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2022-12-13 19:50:44,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2022-12-13 19:50:44,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:44,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2022-12-13 19:50:44,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:44,717 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-12-13 19:50:44,718 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-12-13 19:50:44,718 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 76 flow. Second operand 3 states and 327 transitions. [2022-12-13 19:50:44,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 170 flow [2022-12-13 19:50:44,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:50:44,719 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 83 flow [2022-12-13 19:50:44,719 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-13 19:50:44,720 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2022-12-13 19:50:44,720 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 83 flow [2022-12-13 19:50:44,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:44,720 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:44,721 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:44,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:50:44,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:44,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1155639932, now seen corresponding path program 1 times [2022-12-13 19:50:44,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:44,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000757661] [2022-12-13 19:50:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:44,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:44,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000757661] [2022-12-13 19:50:44,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000757661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:44,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:44,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:50:44,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775542296] [2022-12-13 19:50:44,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:44,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:50:44,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:44,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:50:44,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:50:44,891 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2022-12-13 19:50:44,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:44,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:44,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2022-12-13 19:50:44,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:45,141 INFO L130 PetriNetUnfolder]: 1167/1738 cut-off events. [2022-12-13 19:50:45,141 INFO L131 PetriNetUnfolder]: For 584/584 co-relation queries the response was YES. [2022-12-13 19:50:45,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 1738 events. 1167/1738 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6909 event pairs, 726 based on Foata normal form. 40/1778 useless extension candidates. Maximal degree in co-relation 4091. Up to 1181 conditions per place. [2022-12-13 19:50:45,148 INFO L137 encePairwiseOnDemand]: 224/227 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2022-12-13 19:50:45,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 204 flow [2022-12-13 19:50:45,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:50:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:50:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2022-12-13 19:50:45,149 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48751835535976507 [2022-12-13 19:50:45,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2022-12-13 19:50:45,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2022-12-13 19:50:45,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:45,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2022-12-13 19:50:45,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:45,151 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-12-13 19:50:45,151 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-12-13 19:50:45,152 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 83 flow. Second operand 3 states and 332 transitions. [2022-12-13 19:50:45,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 204 flow [2022-12-13 19:50:45,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:50:45,153 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 88 flow [2022-12-13 19:50:45,153 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-13 19:50:45,154 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-13 19:50:45,154 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 88 flow [2022-12-13 19:50:45,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:45,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:45,154 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:45,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:50:45,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:45,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:45,155 INFO L85 PathProgramCache]: Analyzing trace with hash -202730945, now seen corresponding path program 1 times [2022-12-13 19:50:45,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:45,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189304619] [2022-12-13 19:50:45,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:45,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:45,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:45,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189304619] [2022-12-13 19:50:45,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189304619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:45,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:45,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:50:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350330325] [2022-12-13 19:50:45,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:45,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:50:45,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:50:45,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:50:45,271 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 227 [2022-12-13 19:50:45,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:45,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:45,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 227 [2022-12-13 19:50:45,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:45,431 INFO L130 PetriNetUnfolder]: 631/1020 cut-off events. [2022-12-13 19:50:45,431 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2022-12-13 19:50:45,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 1020 events. 631/1020 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4699 event pairs, 235 based on Foata normal form. 12/1026 useless extension candidates. Maximal degree in co-relation 2325. Up to 646 conditions per place. [2022-12-13 19:50:45,435 INFO L137 encePairwiseOnDemand]: 224/227 looper letters, 28 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-13 19:50:45,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 175 flow [2022-12-13 19:50:45,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:50:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:50:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2022-12-13 19:50:45,436 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5110132158590308 [2022-12-13 19:50:45,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2022-12-13 19:50:45,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2022-12-13 19:50:45,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:45,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2022-12-13 19:50:45,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:45,438 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-12-13 19:50:45,439 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-12-13 19:50:45,439 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 88 flow. Second operand 3 states and 348 transitions. [2022-12-13 19:50:45,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 175 flow [2022-12-13 19:50:45,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:50:45,440 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 93 flow [2022-12-13 19:50:45,440 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2022-12-13 19:50:45,440 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 19:50:45,440 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 93 flow [2022-12-13 19:50:45,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:45,441 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:45,441 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:45,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:50:45,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1750084782, now seen corresponding path program 1 times [2022-12-13 19:50:45,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:45,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681659595] [2022-12-13 19:50:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:45,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:45,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681659595] [2022-12-13 19:50:45,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681659595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:45,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:45,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:50:45,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766509634] [2022-12-13 19:50:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:45,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:50:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:45,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:50:45,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:50:45,609 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-12-13 19:50:45,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:45,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:45,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-12-13 19:50:45,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:45,780 INFO L130 PetriNetUnfolder]: 448/790 cut-off events. [2022-12-13 19:50:45,781 INFO L131 PetriNetUnfolder]: For 183/187 co-relation queries the response was YES. [2022-12-13 19:50:45,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 790 events. 448/790 cut-off events. For 183/187 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3885 event pairs, 88 based on Foata normal form. 88/862 useless extension candidates. Maximal degree in co-relation 1801. Up to 437 conditions per place. [2022-12-13 19:50:45,783 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 43 selfloop transitions, 7 changer transitions 2/58 dead transitions. [2022-12-13 19:50:45,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 279 flow [2022-12-13 19:50:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:50:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:50:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-12-13 19:50:45,785 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4995594713656388 [2022-12-13 19:50:45,785 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 567 transitions. [2022-12-13 19:50:45,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 567 transitions. [2022-12-13 19:50:45,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:45,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 567 transitions. [2022-12-13 19:50:45,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:45,788 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-12-13 19:50:45,788 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-12-13 19:50:45,788 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 93 flow. Second operand 5 states and 567 transitions. [2022-12-13 19:50:45,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 279 flow [2022-12-13 19:50:45,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:50:45,790 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 141 flow [2022-12-13 19:50:45,790 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-13 19:50:45,790 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-12-13 19:50:45,790 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 141 flow [2022-12-13 19:50:45,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:45,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:45,791 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:45,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:50:45,791 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1381242107, now seen corresponding path program 1 times [2022-12-13 19:50:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:45,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155807163] [2022-12-13 19:50:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:45,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:45,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155807163] [2022-12-13 19:50:45,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155807163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:45,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:45,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:50:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241632542] [2022-12-13 19:50:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:45,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:50:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:50:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:50:45,945 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 227 [2022-12-13 19:50:45,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:45,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:45,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 227 [2022-12-13 19:50:45,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:46,226 INFO L130 PetriNetUnfolder]: 1071/1751 cut-off events. [2022-12-13 19:50:46,226 INFO L131 PetriNetUnfolder]: For 1453/1453 co-relation queries the response was YES. [2022-12-13 19:50:46,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 1751 events. 1071/1751 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8529 event pairs, 103 based on Foata normal form. 18/1769 useless extension candidates. Maximal degree in co-relation 5505. Up to 1059 conditions per place. [2022-12-13 19:50:46,231 INFO L137 encePairwiseOnDemand]: 220/227 looper letters, 53 selfloop transitions, 9 changer transitions 20/82 dead transitions. [2022-12-13 19:50:46,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 82 transitions, 510 flow [2022-12-13 19:50:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:50:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 19:50:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2022-12-13 19:50:46,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4720998531571219 [2022-12-13 19:50:46,235 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2022-12-13 19:50:46,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2022-12-13 19:50:46,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:46,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2022-12-13 19:50:46,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:46,239 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-12-13 19:50:46,239 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-12-13 19:50:46,239 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 141 flow. Second operand 6 states and 643 transitions. [2022-12-13 19:50:46,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 82 transitions, 510 flow [2022-12-13 19:50:46,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:50:46,245 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 161 flow [2022-12-13 19:50:46,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2022-12-13 19:50:46,245 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-13 19:50:46,245 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 161 flow [2022-12-13 19:50:46,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:46,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:46,246 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:46,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:50:46,246 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1451762939, now seen corresponding path program 2 times [2022-12-13 19:50:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:46,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487157911] [2022-12-13 19:50:46,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:46,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-12-13 19:50:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:46,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487157911] [2022-12-13 19:50:46,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487157911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:46,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:46,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:50:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322852556] [2022-12-13 19:50:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:46,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:50:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:50:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:50:46,471 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-12-13 19:50:46,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:46,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:46,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-12-13 19:50:46,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:46,676 INFO L130 PetriNetUnfolder]: 337/656 cut-off events. [2022-12-13 19:50:46,676 INFO L131 PetriNetUnfolder]: For 492/495 co-relation queries the response was YES. [2022-12-13 19:50:46,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 656 events. 337/656 cut-off events. For 492/495 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3317 event pairs, 64 based on Foata normal form. 74/710 useless extension candidates. Maximal degree in co-relation 1948. Up to 252 conditions per place. [2022-12-13 19:50:46,681 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 45 selfloop transitions, 10 changer transitions 9/72 dead transitions. [2022-12-13 19:50:46,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 437 flow [2022-12-13 19:50:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:50:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 19:50:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 681 transitions. [2022-12-13 19:50:46,683 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 19:50:46,683 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 681 transitions. [2022-12-13 19:50:46,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 681 transitions. [2022-12-13 19:50:46,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:46,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 681 transitions. [2022-12-13 19:50:46,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:46,685 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-12-13 19:50:46,686 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-12-13 19:50:46,686 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 161 flow. Second operand 6 states and 681 transitions. [2022-12-13 19:50:46,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 437 flow [2022-12-13 19:50:46,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 429 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 19:50:46,689 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 233 flow [2022-12-13 19:50:46,689 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2022-12-13 19:50:46,689 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-12-13 19:50:46,690 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 233 flow [2022-12-13 19:50:46,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:46,690 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:46,690 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:46,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 19:50:46,690 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash -630719173, now seen corresponding path program 1 times [2022-12-13 19:50:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581606891] [2022-12-13 19:50:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:46,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:46,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581606891] [2022-12-13 19:50:46,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581606891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:46,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:46,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:50:46,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731215421] [2022-12-13 19:50:46,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:46,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:50:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:46,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:50:46,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:50:46,868 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-12-13 19:50:46,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:46,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:46,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-12-13 19:50:46,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:47,077 INFO L130 PetriNetUnfolder]: 294/588 cut-off events. [2022-12-13 19:50:47,078 INFO L131 PetriNetUnfolder]: For 783/785 co-relation queries the response was YES. [2022-12-13 19:50:47,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 588 events. 294/588 cut-off events. For 783/785 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3015 event pairs, 59 based on Foata normal form. 21/589 useless extension candidates. Maximal degree in co-relation 2031. Up to 225 conditions per place. [2022-12-13 19:50:47,081 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 34 selfloop transitions, 11 changer transitions 22/72 dead transitions. [2022-12-13 19:50:47,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 483 flow [2022-12-13 19:50:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:50:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 19:50:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 887 transitions. [2022-12-13 19:50:47,086 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4884361233480176 [2022-12-13 19:50:47,086 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 887 transitions. [2022-12-13 19:50:47,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 887 transitions. [2022-12-13 19:50:47,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:47,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 887 transitions. [2022-12-13 19:50:47,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,091 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,091 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 233 flow. Second operand 8 states and 887 transitions. [2022-12-13 19:50:47,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 483 flow [2022-12-13 19:50:47,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 434 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-13 19:50:47,100 INFO L231 Difference]: Finished difference. Result has 57 places, 31 transitions, 182 flow [2022-12-13 19:50:47,101 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2022-12-13 19:50:47,101 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2022-12-13 19:50:47,101 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 31 transitions, 182 flow [2022-12-13 19:50:47,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,102 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:47,102 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:47,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 19:50:47,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:47,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1959411871, now seen corresponding path program 1 times [2022-12-13 19:50:47,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:47,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769492828] [2022-12-13 19:50:47,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:47,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:47,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:47,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769492828] [2022-12-13 19:50:47,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769492828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:47,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:47,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:50:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582675101] [2022-12-13 19:50:47,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:47,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:50:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:50:47,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:50:47,284 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 227 [2022-12-13 19:50:47,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 31 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:47,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 227 [2022-12-13 19:50:47,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:47,447 INFO L130 PetriNetUnfolder]: 368/690 cut-off events. [2022-12-13 19:50:47,447 INFO L131 PetriNetUnfolder]: For 1157/1157 co-relation queries the response was YES. [2022-12-13 19:50:47,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2364 conditions, 690 events. 368/690 cut-off events. For 1157/1157 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3198 event pairs, 79 based on Foata normal form. 1/691 useless extension candidates. Maximal degree in co-relation 2345. Up to 482 conditions per place. [2022-12-13 19:50:47,450 INFO L137 encePairwiseOnDemand]: 218/227 looper letters, 44 selfloop transitions, 11 changer transitions 16/71 dead transitions. [2022-12-13 19:50:47,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 546 flow [2022-12-13 19:50:47,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:50:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:50:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-12-13 19:50:47,452 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4713656387665198 [2022-12-13 19:50:47,452 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2022-12-13 19:50:47,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2022-12-13 19:50:47,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:47,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2022-12-13 19:50:47,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,454 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-12-13 19:50:47,455 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-12-13 19:50:47,455 INFO L175 Difference]: Start difference. First operand has 57 places, 31 transitions, 182 flow. Second operand 5 states and 535 transitions. [2022-12-13 19:50:47,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 546 flow [2022-12-13 19:50:47,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 444 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-12-13 19:50:47,459 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 199 flow [2022-12-13 19:50:47,459 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-13 19:50:47,460 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-13 19:50:47,460 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 199 flow [2022-12-13 19:50:47,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:47,461 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:47,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 19:50:47,461 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:47,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:47,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1148554681, now seen corresponding path program 2 times [2022-12-13 19:50:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:47,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961622286] [2022-12-13 19:50:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:47,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:47,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961622286] [2022-12-13 19:50:47,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961622286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:47,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:47,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:50:47,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389709775] [2022-12-13 19:50:47,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:47,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:50:47,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:50:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:50:47,664 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 227 [2022-12-13 19:50:47,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:47,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 227 [2022-12-13 19:50:47,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:47,878 INFO L130 PetriNetUnfolder]: 320/620 cut-off events. [2022-12-13 19:50:47,879 INFO L131 PetriNetUnfolder]: For 884/884 co-relation queries the response was YES. [2022-12-13 19:50:47,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 620 events. 320/620 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2828 event pairs, 94 based on Foata normal form. 1/621 useless extension candidates. Maximal degree in co-relation 2160. Up to 320 conditions per place. [2022-12-13 19:50:47,882 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 27 selfloop transitions, 3 changer transitions 42/72 dead transitions. [2022-12-13 19:50:47,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 501 flow [2022-12-13 19:50:47,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:50:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 19:50:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2022-12-13 19:50:47,886 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4632892804698972 [2022-12-13 19:50:47,886 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 631 transitions. [2022-12-13 19:50:47,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 631 transitions. [2022-12-13 19:50:47,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:47,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 631 transitions. [2022-12-13 19:50:47,890 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-12-13 19:50:47,894 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-12-13 19:50:47,894 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-12-13 19:50:47,895 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 199 flow. Second operand 6 states and 631 transitions. [2022-12-13 19:50:47,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 501 flow [2022-12-13 19:50:47,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 497 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 19:50:47,899 INFO L231 Difference]: Finished difference. Result has 52 places, 28 transitions, 142 flow [2022-12-13 19:50:47,900 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=52, PETRI_TRANSITIONS=28} [2022-12-13 19:50:47,900 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-12-13 19:50:47,900 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 28 transitions, 142 flow [2022-12-13 19:50:47,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:47,901 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:47,901 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:47,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 19:50:47,901 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2041023719, now seen corresponding path program 3 times [2022-12-13 19:50:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:47,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567167193] [2022-12-13 19:50:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:47,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:50:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:50:48,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:50:48,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567167193] [2022-12-13 19:50:48,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567167193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:50:48,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:50:48,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:50:48,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862658567] [2022-12-13 19:50:48,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:50:48,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:50:48,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:50:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:50:48,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:50:48,803 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 227 [2022-12-13 19:50:48,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 28 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:48,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:50:48,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 227 [2022-12-13 19:50:48,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:50:49,069 INFO L130 PetriNetUnfolder]: 69/177 cut-off events. [2022-12-13 19:50:49,070 INFO L131 PetriNetUnfolder]: For 302/314 co-relation queries the response was YES. [2022-12-13 19:50:49,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 177 events. 69/177 cut-off events. For 302/314 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 718 event pairs, 15 based on Foata normal form. 1/172 useless extension candidates. Maximal degree in co-relation 607. Up to 68 conditions per place. [2022-12-13 19:50:49,070 INFO L137 encePairwiseOnDemand]: 220/227 looper letters, 21 selfloop transitions, 4 changer transitions 21/50 dead transitions. [2022-12-13 19:50:49,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 354 flow [2022-12-13 19:50:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:50:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 19:50:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 849 transitions. [2022-12-13 19:50:49,072 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46751101321585903 [2022-12-13 19:50:49,072 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 849 transitions. [2022-12-13 19:50:49,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 849 transitions. [2022-12-13 19:50:49,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:50:49,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 849 transitions. [2022-12-13 19:50:49,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:49,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:49,076 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:49,076 INFO L175 Difference]: Start difference. First operand has 52 places, 28 transitions, 142 flow. Second operand 8 states and 849 transitions. [2022-12-13 19:50:49,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 354 flow [2022-12-13 19:50:49,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 338 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 19:50:49,078 INFO L231 Difference]: Finished difference. Result has 54 places, 28 transitions, 145 flow [2022-12-13 19:50:49,078 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=145, PETRI_PLACES=54, PETRI_TRANSITIONS=28} [2022-12-13 19:50:49,078 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-12-13 19:50:49,079 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 28 transitions, 145 flow [2022-12-13 19:50:49,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:50:49,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:50:49,079 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:49,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 19:50:49,079 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 19:50:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:50:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1052334493, now seen corresponding path program 4 times [2022-12-13 19:50:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:50:49,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339019734] [2022-12-13 19:50:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:50:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:50:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:50:49,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:50:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:50:49,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:50:49,147 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:50:49,148 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 19:50:49,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 19:50:49,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 19:50:49,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 19:50:49,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 19:50:49,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 19:50:49,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 19:50:49,151 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:50:49,155 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 19:50:49,155 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:50:49,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:50:49 BasicIcfg [2022-12-13 19:50:49,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:50:49,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:50:49,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:50:49,194 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:50:49,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:50:40" (3/4) ... [2022-12-13 19:50:49,196 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 19:50:49,242 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:50:49,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:50:49,243 INFO L158 Benchmark]: Toolchain (without parser) took 10003.85ms. Allocated memory was 111.1MB in the beginning and 234.9MB in the end (delta: 123.7MB). Free memory was 76.4MB in the beginning and 103.4MB in the end (delta: -27.0MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. [2022-12-13 19:50:49,243 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:50:49,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.59ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 76.1MB in the beginning and 105.0MB in the end (delta: -28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-12-13 19:50:49,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.51ms. Allocated memory is still 134.2MB. Free memory was 105.0MB in the beginning and 102.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:50:49,244 INFO L158 Benchmark]: Boogie Preprocessor took 21.03ms. Allocated memory is still 134.2MB. Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:50:49,245 INFO L158 Benchmark]: RCFGBuilder took 521.36ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 64.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-12-13 19:50:49,245 INFO L158 Benchmark]: TraceAbstraction took 9003.44ms. Allocated memory was 134.2MB in the beginning and 234.9MB in the end (delta: 100.7MB). Free memory was 63.8MB in the beginning and 115.0MB in the end (delta: -51.2MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2022-12-13 19:50:49,245 INFO L158 Benchmark]: Witness Printer took 48.76ms. Allocated memory is still 234.9MB. Free memory was 115.0MB in the beginning and 103.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:50:49,247 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.17ms. Allocated memory is still 111.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.59ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 76.1MB in the beginning and 105.0MB in the end (delta: -28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.51ms. Allocated memory is still 134.2MB. Free memory was 105.0MB in the beginning and 102.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.03ms. Allocated memory is still 134.2MB. Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.36ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 64.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9003.44ms. Allocated memory was 134.2MB in the beginning and 234.9MB in the end (delta: 100.7MB). Free memory was 63.8MB in the beginning and 115.0MB in the end (delta: -51.2MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Witness Printer took 48.76ms. Allocated memory is still 234.9MB. Free memory was 115.0MB in the beginning and 103.4MB in the end (delta: 11.5MB). 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: 2.8s, 125 PlacesBefore, 34 PlacesAfterwards, 117 TransitionsBefore, 25 TransitionsAfterwards, 2162 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 5527 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2768, independent: 2596, independent conditional: 0, independent unconditional: 2596, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1219, independent: 1179, independent conditional: 0, independent unconditional: 1179, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2768, independent: 1417, independent conditional: 0, independent unconditional: 1417, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 1219, unknown conditional: 0, unknown unconditional: 1219] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L728] 0 _Bool y$flush_delayed; [L729] 0 int y$mem_tmp; [L730] 0 _Bool y$r_buff0_thd0; [L731] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$r_buff0_thd2; [L733] 0 _Bool y$r_buff0_thd3; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$read_delayed; [L739] 0 int *y$read_delayed_var; [L740] 0 int y$w_buff0; [L741] 0 _Bool y$w_buff0_used; [L742] 0 int y$w_buff1; [L743] 0 _Bool y$w_buff1_used; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t17; [L854] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t17, ((void *)0), P0, ((void *)0))=-3, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] 0 pthread_t t18; [L856] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t18, ((void *)0), P1, ((void *)0))=-2, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L857] 0 pthread_t t19; [L858] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t19, ((void *)0), P2, ((void *)0))=-1, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff1 = y$w_buff0 [L801] 3 y$w_buff0 = 1 [L802] 3 y$w_buff1_used = y$w_buff0_used [L803] 3 y$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] 3 y$mem_tmp = y [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=3, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 858]: 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: 856]: 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: 854]: 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, 148 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: 8.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 501 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1031 IncrementalHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 56 mSDtfsCounter, 1031 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=8, InterpolantAutomatonStates: 59, 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.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 1373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 19:50:49,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e5bb826-d548-4b2d-8914-798edb2ba789/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE