./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS --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 e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- 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-4e7fbc6 [2022-11-23 03:23:16,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:23:16,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:23:16,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:23:16,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:23:16,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:23:16,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:23:16,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:23:16,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:23:16,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:23:16,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:23:16,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:23:16,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:23:16,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:23:16,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:23:16,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:23:16,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:23:16,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:23:16,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:23:16,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:23:16,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:23:16,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:23:16,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:23:16,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:23:16,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:23:16,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:23:16,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:23:16,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:23:16,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:23:16,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:23:16,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:23:16,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:23:16,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:23:16,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:23:16,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:23:16,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:23:16,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:23:16,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:23:16,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:23:16,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:23:16,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:23:16,136 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:23:16,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:23:16,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:23:16,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:23:16,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:23:16,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:23:16,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:23:16,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:23:16,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:23:16,177 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:23:16,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:23:16,179 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:23:16,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:23:16,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:23:16,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:23:16,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:23:16,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:23:16,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:23:16,180 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:23:16,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:23:16,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:23:16,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:23:16,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:23:16,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:23:16,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:23:16,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:23:16,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:23:16,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:23:16,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:23:16,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:23:16,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:23:16,183 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:23:16,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:23:16,183 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:23:16,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:23:16,184 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_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/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_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS 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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2022-11-23 03:23:16,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:23:16,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:23:16,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:23:16,508 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:23:16,509 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:23:16,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-23 03:23:19,533 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:23:19,778 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:23:19,779 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-23 03:23:19,857 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/data/b3cfa7e25/786a786bfa3c4f4fb157c75f6471a1d2/FLAG1ed478af6 [2022-11-23 03:23:19,873 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/data/b3cfa7e25/786a786bfa3c4f4fb157c75f6471a1d2 [2022-11-23 03:23:19,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:23:19,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:23:19,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:23:19,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:23:19,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:23:19,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:23:19" (1/1) ... [2022-11-23 03:23:19,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@554994b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:19, skipping insertion in model container [2022-11-23 03:23:19,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:23:19" (1/1) ... [2022-11-23 03:23:19,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:23:19,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:23:20,115 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_2757deb2-1265-4898-a227-02ad0d4ea8f1/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-23 03:23:20,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:23:20,455 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:23:20,472 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_2757deb2-1265-4898-a227-02ad0d4ea8f1/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-23 03:23:20,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:23:20,603 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:23:20,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20 WrapperNode [2022-11-23 03:23:20,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:23:20,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:23:20,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:23:20,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:23:20,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,696 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-11-23 03:23:20,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:23:20,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:23:20,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:23:20,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:23:20,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,755 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:23:20,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:23:20,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:23:20,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:23:20,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (1/1) ... [2022-11-23 03:23:20,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:23:20,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:23:20,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:23:20,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:23:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:23:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:23:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:23:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:23:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:23:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:23:20,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:23:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:23:20,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:23:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:23:20,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:23:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:23:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:23:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:23:20,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:23:20,881 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 03:23:21,102 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:23:21,105 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:23:21,524 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:23:21,839 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:23:21,839 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:23:21,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:21 BoogieIcfgContainer [2022-11-23 03:23:21,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:23:21,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:23:21,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:23:21,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:23:21,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:23:19" (1/3) ... [2022-11-23 03:23:21,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e27404a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:23:21, skipping insertion in model container [2022-11-23 03:23:21,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20" (2/3) ... [2022-11-23 03:23:21,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e27404a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:23:21, skipping insertion in model container [2022-11-23 03:23:21,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:21" (3/3) ... [2022-11-23 03:23:21,857 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-11-23 03:23:21,866 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 03:23:21,877 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:23:21,878 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 03:23:21,878 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:23:21,965 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:23:22,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-23 03:23:22,073 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-23 03:23:22,073 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:23:22,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-23 03:23:22,080 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-11-23 03:23:22,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow [2022-11-23 03:23:22,089 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:23:22,106 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 251 flow [2022-11-23 03:23:22,109 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 251 flow [2022-11-23 03:23:22,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 251 flow [2022-11-23 03:23:22,143 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-23 03:23:22,143 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:23:22,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-23 03:23:22,146 INFO L119 LiptonReduction]: Number of co-enabled transitions 2556 [2022-11-23 03:23:27,224 INFO L134 LiptonReduction]: Checked pairs total: 7155 [2022-11-23 03:23:27,225 INFO L136 LiptonReduction]: Total number of compositions: 108 [2022-11-23 03:23:27,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:23:27,271 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;@3a03ae08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:23:27,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 03:23:27,277 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-11-23 03:23:27,277 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:23:27,278 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:27,278 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 03:23:27,279 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:27,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash 520896, now seen corresponding path program 1 times [2022-11-23 03:23:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:27,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799610311] [2022-11-23 03:23:27,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:23:27,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:27,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799610311] [2022-11-23 03:23:27,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799610311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:23:27,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:23:27,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:23:27,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315744662] [2022-11-23 03:23:27,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:23:27,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:23:27,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:27,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:23:27,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:23:27,793 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 232 [2022-11-23 03:23:27,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:27,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:23:27,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 232 [2022-11-23 03:23:27,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:23:28,354 INFO L130 PetriNetUnfolder]: 1381/2169 cut-off events. [2022-11-23 03:23:28,354 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-11-23 03:23:28,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 2169 events. 1381/2169 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12258 event pairs, 173 based on Foata normal form. 0/2060 useless extension candidates. Maximal degree in co-relation 4247. Up to 1729 conditions per place. [2022-11-23 03:23:28,371 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-11-23 03:23:28,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 175 flow [2022-11-23 03:23:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:23:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:23:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2022-11-23 03:23:28,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5330459770114943 [2022-11-23 03:23:28,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2022-11-23 03:23:28,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2022-11-23 03:23:28,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:23:28,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2022-11-23 03:23:28,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:28,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:28,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:28,406 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 371 transitions. [2022-11-23 03:23:28,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 175 flow [2022-11-23 03:23:28,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:23:28,412 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 60 flow [2022-11-23 03:23:28,414 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-11-23 03:23:28,418 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2022-11-23 03:23:28,418 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 60 flow [2022-11-23 03:23:28,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:28,419 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:28,419 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:28,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:23:28,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:28,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash -989651447, now seen corresponding path program 1 times [2022-11-23 03:23:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:28,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730618013] [2022-11-23 03:23:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:23:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:28,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730618013] [2022-11-23 03:23:28,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730618013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:23:28,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:23:28,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:23:28,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853598495] [2022-11-23 03:23:28,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:23:28,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:23:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:28,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:23:28,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:23:28,768 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 232 [2022-11-23 03:23:28,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:28,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:23:28,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 232 [2022-11-23 03:23:28,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:23:29,225 INFO L130 PetriNetUnfolder]: 1117/1792 cut-off events. [2022-11-23 03:23:29,226 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-11-23 03:23:29,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3626 conditions, 1792 events. 1117/1792 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9720 event pairs, 309 based on Foata normal form. 100/1879 useless extension candidates. Maximal degree in co-relation 3616. Up to 1044 conditions per place. [2022-11-23 03:23:29,238 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 32 selfloop transitions, 2 changer transitions 19/57 dead transitions. [2022-11-23 03:23:29,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 236 flow [2022-11-23 03:23:29,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:23:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:23:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-11-23 03:23:29,244 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5129310344827587 [2022-11-23 03:23:29,245 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2022-11-23 03:23:29,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2022-11-23 03:23:29,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:23:29,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2022-11-23 03:23:29,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:29,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:29,255 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:29,255 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 60 flow. Second operand 5 states and 595 transitions. [2022-11-23 03:23:29,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 236 flow [2022-11-23 03:23:29,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:23:29,258 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 68 flow [2022-11-23 03:23:29,258 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-11-23 03:23:29,259 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-11-23 03:23:29,259 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 68 flow [2022-11-23 03:23:29,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:29,260 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:29,260 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:29,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:23:29,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:29,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash 397667103, now seen corresponding path program 1 times [2022-11-23 03:23:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:29,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783047031] [2022-11-23 03:23:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:23:29,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:29,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783047031] [2022-11-23 03:23:29,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783047031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:23:29,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:23:29,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:23:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108874765] [2022-11-23 03:23:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:23:29,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:23:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:23:29,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:23:29,565 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232 [2022-11-23 03:23:29,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:29,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:23:29,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232 [2022-11-23 03:23:29,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:23:30,184 INFO L130 PetriNetUnfolder]: 2235/3304 cut-off events. [2022-11-23 03:23:30,184 INFO L131 PetriNetUnfolder]: For 672/672 co-relation queries the response was YES. [2022-11-23 03:23:30,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7281 conditions, 3304 events. 2235/3304 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15043 event pairs, 583 based on Foata normal form. 144/3448 useless extension candidates. Maximal degree in co-relation 7268. Up to 2217 conditions per place. [2022-11-23 03:23:30,205 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 37 selfloop transitions, 2 changer transitions 22/61 dead transitions. [2022-11-23 03:23:30,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 61 transitions, 269 flow [2022-11-23 03:23:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:23:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:23:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2022-11-23 03:23:30,208 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4810344827586207 [2022-11-23 03:23:30,208 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 558 transitions. [2022-11-23 03:23:30,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 558 transitions. [2022-11-23 03:23:30,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:23:30,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 558 transitions. [2022-11-23 03:23:30,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:30,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:30,214 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:30,215 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 68 flow. Second operand 5 states and 558 transitions. [2022-11-23 03:23:30,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 61 transitions, 269 flow [2022-11-23 03:23:30,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 61 transitions, 259 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-23 03:23:30,226 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 72 flow [2022-11-23 03:23:30,226 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2022-11-23 03:23:30,227 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-11-23 03:23:30,227 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 72 flow [2022-11-23 03:23:30,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:30,228 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:30,228 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:30,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:23:30,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:30,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2039649132, now seen corresponding path program 1 times [2022-11-23 03:23:30,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:30,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962323993] [2022-11-23 03:23:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:30,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-11-23 03:23:30,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:30,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962323993] [2022-11-23 03:23:30,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962323993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:23:30,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:23:30,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:23:30,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762323915] [2022-11-23 03:23:30,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:23:30,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:23:30,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:30,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:23:30,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:23:30,497 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 232 [2022-11-23 03:23:30,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:30,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:23:30,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 232 [2022-11-23 03:23:30,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:23:30,848 INFO L130 PetriNetUnfolder]: 1040/1596 cut-off events. [2022-11-23 03:23:30,848 INFO L131 PetriNetUnfolder]: For 300/300 co-relation queries the response was YES. [2022-11-23 03:23:30,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3511 conditions, 1596 events. 1040/1596 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7399 event pairs, 331 based on Foata normal form. 54/1633 useless extension candidates. Maximal degree in co-relation 3497. Up to 995 conditions per place. [2022-11-23 03:23:30,858 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 29 selfloop transitions, 2 changer transitions 14/48 dead transitions. [2022-11-23 03:23:30,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 213 flow [2022-11-23 03:23:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:23:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:23:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-11-23 03:23:30,861 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5060344827586207 [2022-11-23 03:23:30,861 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2022-11-23 03:23:30,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2022-11-23 03:23:30,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:23:30,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2022-11-23 03:23:30,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:30,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:30,868 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:30,868 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 72 flow. Second operand 5 states and 587 transitions. [2022-11-23 03:23:30,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 213 flow [2022-11-23 03:23:30,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 205 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-23 03:23:30,873 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 76 flow [2022-11-23 03:23:30,873 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2022-11-23 03:23:30,874 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-11-23 03:23:30,874 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 76 flow [2022-11-23 03:23:30,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:30,875 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:30,875 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:30,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:23:30,876 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:30,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1748971494, now seen corresponding path program 1 times [2022-11-23 03:23:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:30,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871560059] [2022-11-23 03:23:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:23:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:31,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871560059] [2022-11-23 03:23:31,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871560059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:23:31,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:23:31,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:23:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983139073] [2022-11-23 03:23:31,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:23:31,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:23:31,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:31,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:23:31,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:23:31,070 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 232 [2022-11-23 03:23:31,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:31,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:23:31,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 232 [2022-11-23 03:23:31,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:23:31,271 INFO L130 PetriNetUnfolder]: 466/800 cut-off events. [2022-11-23 03:23:31,271 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-11-23 03:23:31,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1828 conditions, 800 events. 466/800 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3616 event pairs, 142 based on Foata normal form. 48/837 useless extension candidates. Maximal degree in co-relation 1813. Up to 592 conditions per place. [2022-11-23 03:23:31,277 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 32 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2022-11-23 03:23:31,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 183 flow [2022-11-23 03:23:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:23:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:23:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2022-11-23 03:23:31,279 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.514367816091954 [2022-11-23 03:23:31,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2022-11-23 03:23:31,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2022-11-23 03:23:31,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:23:31,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2022-11-23 03:23:31,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:31,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:31,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:31,283 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 76 flow. Second operand 3 states and 358 transitions. [2022-11-23 03:23:31,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 183 flow [2022-11-23 03:23:31,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 175 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-23 03:23:31,287 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 94 flow [2022-11-23 03:23:31,287 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-11-23 03:23:31,290 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-11-23 03:23:31,291 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 94 flow [2022-11-23 03:23:31,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:31,291 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:31,291 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:31,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:23:31,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1218835277, now seen corresponding path program 1 times [2022-11-23 03:23:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:31,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339406638] [2022-11-23 03:23:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:23:31,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:31,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339406638] [2022-11-23 03:23:31,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339406638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:23:31,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:23:31,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:23:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144856050] [2022-11-23 03:23:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:23:31,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:23:31,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:31,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:23:31,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:23:31,751 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 232 [2022-11-23 03:23:31,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:31,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:23:31,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 232 [2022-11-23 03:23:31,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:23:31,922 INFO L130 PetriNetUnfolder]: 242/464 cut-off events. [2022-11-23 03:23:31,922 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-11-23 03:23:31,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 464 events. 242/464 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1974 event pairs, 101 based on Foata normal form. 40/493 useless extension candidates. Maximal degree in co-relation 1184. Up to 178 conditions per place. [2022-11-23 03:23:31,925 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 42 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-11-23 03:23:31,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 256 flow [2022-11-23 03:23:31,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:23:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:23:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2022-11-23 03:23:31,928 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5150862068965517 [2022-11-23 03:23:31,928 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2022-11-23 03:23:31,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2022-11-23 03:23:31,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:23:31,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2022-11-23 03:23:31,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:31,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:31,933 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:31,933 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 94 flow. Second operand 4 states and 478 transitions. [2022-11-23 03:23:31,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 256 flow [2022-11-23 03:23:31,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:23:31,935 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 130 flow [2022-11-23 03:23:31,935 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-11-23 03:23:31,936 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-11-23 03:23:31,936 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 130 flow [2022-11-23 03:23:31,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:31,937 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:31,937 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:31,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:23:31,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:31,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:31,938 INFO L85 PathProgramCache]: Analyzing trace with hash -420404923, now seen corresponding path program 1 times [2022-11-23 03:23:31,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:31,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783496717] [2022-11-23 03:23:31,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:31,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:23:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:32,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783496717] [2022-11-23 03:23:32,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783496717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:23:32,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:23:32,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:23:32,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562947655] [2022-11-23 03:23:32,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:23:32,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:23:32,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:32,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:23:32,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:23:32,340 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 232 [2022-11-23 03:23:32,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:32,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:23:32,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 232 [2022-11-23 03:23:32,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:23:32,521 INFO L130 PetriNetUnfolder]: 206/392 cut-off events. [2022-11-23 03:23:32,521 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2022-11-23 03:23:32,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 392 events. 206/392 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1674 event pairs, 97 based on Foata normal form. 11/392 useless extension candidates. Maximal degree in co-relation 1050. Up to 178 conditions per place. [2022-11-23 03:23:32,524 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 39 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2022-11-23 03:23:32,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 280 flow [2022-11-23 03:23:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:23:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:23:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-11-23 03:23:32,526 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5043103448275862 [2022-11-23 03:23:32,526 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2022-11-23 03:23:32,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2022-11-23 03:23:32,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:23:32,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2022-11-23 03:23:32,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:32,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:32,532 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:32,532 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 130 flow. Second operand 5 states and 585 transitions. [2022-11-23 03:23:32,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 280 flow [2022-11-23 03:23:32,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 252 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-11-23 03:23:32,534 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 132 flow [2022-11-23 03:23:32,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-11-23 03:23:32,535 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-11-23 03:23:32,535 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 132 flow [2022-11-23 03:23:32,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:32,536 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:32,536 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:32,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:23:32,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1141137657, now seen corresponding path program 1 times [2022-11-23 03:23:32,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:32,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120268794] [2022-11-23 03:23:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:32,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:23:33,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:33,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120268794] [2022-11-23 03:23:33,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120268794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:23:33,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:23:33,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:23:33,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715890431] [2022-11-23 03:23:33,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:23:33,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:23:33,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:33,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:23:33,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:23:34,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 232 [2022-11-23 03:23:34,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 132 flow. Second operand has 8 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:34,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:23:34,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 232 [2022-11-23 03:23:34,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:23:34,477 INFO L130 PetriNetUnfolder]: 311/598 cut-off events. [2022-11-23 03:23:34,480 INFO L131 PetriNetUnfolder]: For 610/610 co-relation queries the response was YES. [2022-11-23 03:23:34,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 598 events. 311/598 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2873 event pairs, 67 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 1701. Up to 210 conditions per place. [2022-11-23 03:23:34,484 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 58 selfloop transitions, 6 changer transitions 21/89 dead transitions. [2022-11-23 03:23:34,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 89 transitions, 570 flow [2022-11-23 03:23:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 03:23:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 03:23:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 906 transitions. [2022-11-23 03:23:34,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48814655172413796 [2022-11-23 03:23:34,488 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 906 transitions. [2022-11-23 03:23:34,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 906 transitions. [2022-11-23 03:23:34,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:23:34,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 906 transitions. [2022-11-23 03:23:34,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.25) internal successors, (906), 8 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:34,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:34,495 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:34,495 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 132 flow. Second operand 8 states and 906 transitions. [2022-11-23 03:23:34,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 89 transitions, 570 flow [2022-11-23 03:23:34,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 89 transitions, 490 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-11-23 03:23:34,501 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 154 flow [2022-11-23 03:23:34,501 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2022-11-23 03:23:34,504 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2022-11-23 03:23:34,504 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 154 flow [2022-11-23 03:23:34,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:34,506 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:34,507 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:34,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:23:34,507 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:34,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash -90225285, now seen corresponding path program 2 times [2022-11-23 03:23:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:34,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622983444] [2022-11-23 03:23:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:23:34,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:34,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622983444] [2022-11-23 03:23:34,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622983444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:23:34,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:23:34,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:23:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137002919] [2022-11-23 03:23:34,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:23:34,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:23:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:34,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:23:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:23:34,862 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2022-11-23 03:23:34,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:34,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:23:34,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2022-11-23 03:23:34,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:23:35,203 INFO L130 PetriNetUnfolder]: 740/1296 cut-off events. [2022-11-23 03:23:35,204 INFO L131 PetriNetUnfolder]: For 985/985 co-relation queries the response was YES. [2022-11-23 03:23:35,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3853 conditions, 1296 events. 740/1296 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6161 event pairs, 93 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 3838. Up to 715 conditions per place. [2022-11-23 03:23:35,211 INFO L137 encePairwiseOnDemand]: 222/232 looper letters, 64 selfloop transitions, 11 changer transitions 12/87 dead transitions. [2022-11-23 03:23:35,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 540 flow [2022-11-23 03:23:35,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:23:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:23:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2022-11-23 03:23:35,214 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4619252873563218 [2022-11-23 03:23:35,214 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2022-11-23 03:23:35,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2022-11-23 03:23:35,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:23:35,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2022-11-23 03:23:35,216 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-11-23 03:23:35,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:35,220 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:35,220 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 154 flow. Second operand 6 states and 643 transitions. [2022-11-23 03:23:35,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 540 flow [2022-11-23 03:23:35,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 522 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-23 03:23:35,230 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 224 flow [2022-11-23 03:23:35,230 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-11-23 03:23:35,231 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 16 predicate places. [2022-11-23 03:23:35,231 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 224 flow [2022-11-23 03:23:35,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:35,235 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:35,235 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:35,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:23:35,235 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1786099667, now seen corresponding path program 3 times [2022-11-23 03:23:35,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:35,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453983197] [2022-11-23 03:23:35,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:23:35,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:35,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453983197] [2022-11-23 03:23:35,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453983197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:23:35,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:23:35,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:23:35,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494068005] [2022-11-23 03:23:35,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:23:35,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:23:35,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:35,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:23:35,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:23:35,594 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 232 [2022-11-23 03:23:35,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:35,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:23:35,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 232 [2022-11-23 03:23:35,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:23:35,946 INFO L130 PetriNetUnfolder]: 717/1413 cut-off events. [2022-11-23 03:23:35,946 INFO L131 PetriNetUnfolder]: For 1844/1858 co-relation queries the response was YES. [2022-11-23 03:23:35,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4848 conditions, 1413 events. 717/1413 cut-off events. For 1844/1858 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8318 event pairs, 181 based on Foata normal form. 1/1395 useless extension candidates. Maximal degree in co-relation 4832. Up to 679 conditions per place. [2022-11-23 03:23:35,953 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 34 selfloop transitions, 1 changer transitions 46/86 dead transitions. [2022-11-23 03:23:35,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 589 flow [2022-11-23 03:23:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:23:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:23:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-11-23 03:23:35,956 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4974137931034483 [2022-11-23 03:23:35,956 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 577 transitions. [2022-11-23 03:23:35,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 577 transitions. [2022-11-23 03:23:35,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:23:35,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 577 transitions. [2022-11-23 03:23:35,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:35,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:35,961 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:35,962 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 224 flow. Second operand 5 states and 577 transitions. [2022-11-23 03:23:35,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 589 flow [2022-11-23 03:23:35,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 587 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-23 03:23:35,977 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 194 flow [2022-11-23 03:23:35,978 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2022-11-23 03:23:35,979 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2022-11-23 03:23:35,980 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 194 flow [2022-11-23 03:23:35,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:35,980 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:23:35,981 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:35,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:23:35,981 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:23:35,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:35,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1353080577, now seen corresponding path program 4 times [2022-11-23 03:23:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:35,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481309496] [2022-11-23 03:23:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:23:36,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:23:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:23:36,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:23:36,212 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:23:36,213 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-23 03:23:36,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-23 03:23:36,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-23 03:23:36,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-23 03:23:36,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-23 03:23:36,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-23 03:23:36,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:23:36,217 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:36,223 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 03:23:36,223 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:23:36,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:23:36 BasicIcfg [2022-11-23 03:23:36,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:23:36,316 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:23:36,316 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:23:36,316 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:23:36,317 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:21" (3/4) ... [2022-11-23 03:23:36,319 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 03:23:36,403 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 03:23:36,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:23:36,404 INFO L158 Benchmark]: Toolchain (without parser) took 16523.27ms. Allocated memory was 165.7MB in the beginning and 293.6MB in the end (delta: 127.9MB). Free memory was 137.2MB in the beginning and 90.3MB in the end (delta: 47.0MB). Peak memory consumption was 174.9MB. Max. memory is 16.1GB. [2022-11-23 03:23:36,404 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory was 77.4MB in the beginning and 77.3MB in the end (delta: 80.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:23:36,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 716.50ms. Allocated memory is still 165.7MB. Free memory was 137.2MB in the beginning and 113.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 03:23:36,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.08ms. Allocated memory is still 165.7MB. Free memory was 113.3MB in the beginning and 111.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:23:36,405 INFO L158 Benchmark]: Boogie Preprocessor took 69.50ms. Allocated memory is still 165.7MB. Free memory was 111.1MB in the beginning and 109.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:23:36,405 INFO L158 Benchmark]: RCFGBuilder took 1072.28ms. Allocated memory is still 165.7MB. Free memory was 109.1MB in the beginning and 74.3MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-23 03:23:36,405 INFO L158 Benchmark]: TraceAbstraction took 14470.68ms. Allocated memory was 165.7MB in the beginning and 293.6MB in the end (delta: 127.9MB). Free memory was 73.4MB in the beginning and 102.9MB in the end (delta: -29.4MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2022-11-23 03:23:36,406 INFO L158 Benchmark]: Witness Printer took 87.25ms. Allocated memory is still 293.6MB. Free memory was 102.9MB in the beginning and 90.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 03:23:36,408 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.27ms. Allocated memory is still 109.1MB. Free memory was 77.4MB in the beginning and 77.3MB in the end (delta: 80.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 716.50ms. Allocated memory is still 165.7MB. Free memory was 137.2MB in the beginning and 113.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.08ms. Allocated memory is still 165.7MB. Free memory was 113.3MB in the beginning and 111.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.50ms. Allocated memory is still 165.7MB. Free memory was 111.1MB in the beginning and 109.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1072.28ms. Allocated memory is still 165.7MB. Free memory was 109.1MB in the beginning and 74.3MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14470.68ms. Allocated memory was 165.7MB in the beginning and 293.6MB in the end (delta: 127.9MB). Free memory was 73.4MB in the beginning and 102.9MB in the end (delta: -29.4MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. * Witness Printer took 87.25ms. Allocated memory is still 293.6MB. Free memory was 102.9MB in the beginning and 90.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 129 PlacesBefore, 37 PlacesAfterwards, 121 TransitionsBefore, 28 TransitionsAfterwards, 2556 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 7155 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3888, independent: 3679, independent conditional: 0, independent unconditional: 3679, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1904, independent: 1849, independent conditional: 0, independent unconditional: 1849, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1904, independent: 1827, independent conditional: 0, independent unconditional: 1827, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 334, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3888, independent: 1830, independent conditional: 0, independent unconditional: 1830, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 1904, unknown conditional: 0, unknown unconditional: 1904] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-2, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, __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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=-1, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, __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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __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, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, \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, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0: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, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L873] 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) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0: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, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 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: 14.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 449 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 359 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 215 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1193 IncrementalHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 94 mSDtfsCounter, 1193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=9, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 03:23:36,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2757deb2-1265-4898-a227-02ad0d4ea8f1/bin/uautomizer-QkZJyEgLgS/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