./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8 --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 31f5db4bc5916150a86a586587dbeca1bc7aa37b414274f5dc02856908270171 --- 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-e04fb08 [2022-11-16 11:33:54,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:33:54,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:33:54,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:33:54,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:33:54,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:33:54,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:33:54,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:33:54,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:33:54,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:33:54,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:33:54,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:33:54,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:33:54,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:33:54,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:33:54,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:33:54,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:33:54,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:33:54,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:33:54,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:33:54,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:33:54,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:33:54,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:33:54,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:33:54,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:33:54,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:33:54,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:33:54,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:33:54,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:33:54,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:33:54,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:33:54,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:33:54,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:33:54,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:33:54,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:33:54,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:33:54,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:33:54,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:33:54,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:33:54,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:33:54,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:33:54,791 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:33:54,836 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:33:54,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:33:54,837 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:33:54,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:33:54,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:33:54,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:33:54,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:33:54,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:33:54,840 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:33:54,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:33:54,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:33:54,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:33:54,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:33:54,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:33:54,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:33:54,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:33:54,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:33:54,843 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:33:54,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:33:54,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:33:54,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:33:54,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:33:54,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:33:54,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:33:54,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:33:54,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:33:54,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:33:54,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:33:54,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:33:54,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:33:54,860 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:33:54,860 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:33:54,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:33:54,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/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_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8 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 -> 31f5db4bc5916150a86a586587dbeca1bc7aa37b414274f5dc02856908270171 [2022-11-16 11:33:55,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:33:55,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:33:55,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:33:55,161 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:33:55,162 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:33:55,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i [2022-11-16 11:33:55,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/data/c636a225e/2cedb47e2e6f4f2abe1c2839642f6a81/FLAG3e9e17bf1 [2022-11-16 11:33:55,726 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:33:55,727 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i [2022-11-16 11:33:55,754 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/data/c636a225e/2cedb47e2e6f4f2abe1c2839642f6a81/FLAG3e9e17bf1 [2022-11-16 11:33:56,085 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/data/c636a225e/2cedb47e2e6f4f2abe1c2839642f6a81 [2022-11-16 11:33:56,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:33:56,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:33:56,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:33:56,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:33:56,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:33:56,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dcddd4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56, skipping insertion in model container [2022-11-16 11:33:56,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:33:56,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:33:56,414 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-16 11:33:56,584 WARN L229 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_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i[30893,30906] [2022-11-16 11:33:56,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:33:56,607 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:33:56,626 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-16 11:33:56,645 WARN L229 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_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs.i[30893,30906] [2022-11-16 11:33:56,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:33:56,679 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:33:56,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56 WrapperNode [2022-11-16 11:33:56,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:33:56,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:33:56,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:33:56,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:33:56,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,721 INFO L138 Inliner]: procedures = 173, calls = 24, calls flagged for inlining = 5, calls inlined = 7, statements flattened = 108 [2022-11-16 11:33:56,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:33:56,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:33:56,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:33:56,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:33:56,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,753 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:33:56,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:33:56,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:33:56,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:33:56,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (1/1) ... [2022-11-16 11:33:56,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:33:56,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:33:56,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:33:56,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:33:56,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:33:56,850 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-16 11:33:56,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-16 11:33:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:33:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:33:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:33:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:33:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:33:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:33:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:33:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:33:56,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:33:56,857 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:33:57,050 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:33:57,062 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:33:57,262 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:33:57,367 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:33:57,367 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 11:33:57,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:33:57 BoogieIcfgContainer [2022-11-16 11:33:57,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:33:57,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:33:57,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:33:57,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:33:57,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:33:56" (1/3) ... [2022-11-16 11:33:57,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7431daaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:33:57, skipping insertion in model container [2022-11-16 11:33:57,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:33:56" (2/3) ... [2022-11-16 11:33:57,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7431daaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:33:57, skipping insertion in model container [2022-11-16 11:33:57,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:33:57" (3/3) ... [2022-11-16 11:33:57,387 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs.i [2022-11-16 11:33:57,396 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:33:57,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:33:57,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:33:57,405 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:33:57,491 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:33:57,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 75 transitions, 155 flow [2022-11-16 11:33:57,591 INFO L130 PetriNetUnfolder]: 8/113 cut-off events. [2022-11-16 11:33:57,592 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:33:57,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 113 events. 8/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 208 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2022-11-16 11:33:57,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 75 transitions, 155 flow [2022-11-16 11:33:57,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 75 transitions, 155 flow [2022-11-16 11:33:57,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:33:57,619 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;@64e650ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:33:57,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 11:33:57,635 INFO L130 PetriNetUnfolder]: 4/51 cut-off events. [2022-11-16 11:33:57,636 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:33:57,636 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:57,637 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:57,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 11:33:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1195945374, now seen corresponding path program 1 times [2022-11-16 11:33:57,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:57,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016280053] [2022-11-16 11:33:57,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:57,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:57,840 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-16 11:33:57,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:57,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016280053] [2022-11-16 11:33:57,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016280053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:57,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:57,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467785115] [2022-11-16 11:33:57,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:57,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:33:57,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:57,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:33:57,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:33:57,893 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 75 [2022-11-16 11:33:57,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 155 flow. Second operand has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-16 11:33:57,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:57,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 75 [2022-11-16 11:33:57,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:58,035 INFO L130 PetriNetUnfolder]: 18/173 cut-off events. [2022-11-16 11:33:58,035 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:33:58,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 173 events. 18/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 500 event pairs, 9 based on Foata normal form. 13/164 useless extension candidates. Maximal degree in co-relation 152. Up to 38 conditions per place. [2022-11-16 11:33:58,041 INFO L137 encePairwiseOnDemand]: 72/75 looper letters, 9 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2022-11-16 11:33:58,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 163 flow [2022-11-16 11:33:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:33:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:33:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 134 transitions. [2022-11-16 11:33:58,053 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8933333333333333 [2022-11-16 11:33:58,053 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 134 transitions. [2022-11-16 11:33:58,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 134 transitions. [2022-11-16 11:33:58,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:58,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 134 transitions. [2022-11-16 11:33:58,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 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-16 11:33:58,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-16 11:33:58,064 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-16 11:33:58,066 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 155 flow. Second operand 2 states and 134 transitions. [2022-11-16 11:33:58,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 163 flow [2022-11-16 11:33:58,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 163 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:33:58,072 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 145 flow [2022-11-16 11:33:58,074 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=145, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2022-11-16 11:33:58,078 INFO L288 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2022-11-16 11:33:58,078 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 145 flow [2022-11-16 11:33:58,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-16 11:33:58,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:58,079 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:33:58,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 11:33:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1303235391, now seen corresponding path program 1 times [2022-11-16 11:33:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:58,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040606136] [2022-11-16 11:33:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:58,401 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-16 11:33:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:58,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040606136] [2022-11-16 11:33:58,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040606136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:58,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:58,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:33:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046517529] [2022-11-16 11:33:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:58,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:58,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:58,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:58,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:58,406 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 75 [2022-11-16 11:33:58,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-16 11:33:58,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:58,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 75 [2022-11-16 11:33:58,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:58,528 INFO L130 PetriNetUnfolder]: 57/289 cut-off events. [2022-11-16 11:33:58,528 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:33:58,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 289 events. 57/289 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1143 event pairs, 20 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 417. Up to 80 conditions per place. [2022-11-16 11:33:58,530 INFO L137 encePairwiseOnDemand]: 69/75 looper letters, 22 selfloop transitions, 4 changer transitions 6/84 dead transitions. [2022-11-16 11:33:58,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 237 flow [2022-11-16 11:33:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:33:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-11-16 11:33:58,533 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2022-11-16 11:33:58,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 190 transitions. [2022-11-16 11:33:58,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 190 transitions. [2022-11-16 11:33:58,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:58,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 190 transitions. [2022-11-16 11:33:58,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-16 11:33:58,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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-16 11:33:58,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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-16 11:33:58,538 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 145 flow. Second operand 3 states and 190 transitions. [2022-11-16 11:33:58,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 237 flow [2022-11-16 11:33:58,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 84 transitions, 237 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:33:58,541 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 173 flow [2022-11-16 11:33:58,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2022-11-16 11:33:58,542 INFO L288 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2022-11-16 11:33:58,542 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 173 flow [2022-11-16 11:33:58,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-16 11:33:58,543 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:58,543 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:58,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:33:58,544 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 11:33:58,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:58,544 INFO L85 PathProgramCache]: Analyzing trace with hash 622221814, now seen corresponding path program 1 times [2022-11-16 11:33:58,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:58,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307959268] [2022-11-16 11:33:58,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:58,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:33:58,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:33:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:33:58,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:33:58,614 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:33:58,615 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-16 11:33:58,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-16 11:33:58,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-16 11:33:58,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-16 11:33:58,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:33:58,620 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-16 11:33:58,626 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:33:58,626 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 11:33:58,673 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:33:58,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 93 transitions, 198 flow [2022-11-16 11:33:58,727 INFO L130 PetriNetUnfolder]: 13/171 cut-off events. [2022-11-16 11:33:58,727 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 11:33:58,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 13/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 436 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 114. Up to 6 conditions per place. [2022-11-16 11:33:58,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 93 transitions, 198 flow [2022-11-16 11:33:58,736 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 93 transitions, 198 flow [2022-11-16 11:33:58,740 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:33:58,746 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;@64e650ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:33:58,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-16 11:33:58,757 INFO L130 PetriNetUnfolder]: 4/51 cut-off events. [2022-11-16 11:33:58,757 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:33:58,758 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:58,759 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:58,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:33:58,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1624310494, now seen corresponding path program 1 times [2022-11-16 11:33:58,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:58,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730686491] [2022-11-16 11:33:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:58,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:33:58,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:58,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730686491] [2022-11-16 11:33:58,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730686491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:58,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:58,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256593287] [2022-11-16 11:33:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:58,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:33:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:33:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:33:58,831 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-16 11:33:58,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 198 flow. Second operand has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-16 11:33:58,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:58,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-16 11:33:58,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:59,001 INFO L130 PetriNetUnfolder]: 150/610 cut-off events. [2022-11-16 11:33:59,001 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-16 11:33:59,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 610 events. 150/610 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3423 event pairs, 93 based on Foata normal form. 75/577 useless extension candidates. Maximal degree in co-relation 627. Up to 234 conditions per place. [2022-11-16 11:33:59,007 INFO L137 encePairwiseOnDemand]: 89/93 looper letters, 14 selfloop transitions, 0 changer transitions 0/86 dead transitions. [2022-11-16 11:33:59,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 212 flow [2022-11-16 11:33:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:33:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:33:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 162 transitions. [2022-11-16 11:33:59,010 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2022-11-16 11:33:59,011 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 162 transitions. [2022-11-16 11:33:59,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 162 transitions. [2022-11-16 11:33:59,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:59,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 162 transitions. [2022-11-16 11:33:59,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 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-16 11:33:59,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 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-16 11:33:59,013 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 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-16 11:33:59,014 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 198 flow. Second operand 2 states and 162 transitions. [2022-11-16 11:33:59,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 212 flow [2022-11-16 11:33:59,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 86 transitions, 210 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-16 11:33:59,016 INFO L231 Difference]: Finished difference. Result has 89 places, 86 transitions, 182 flow [2022-11-16 11:33:59,017 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=89, PETRI_TRANSITIONS=86} [2022-11-16 11:33:59,018 INFO L288 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2022-11-16 11:33:59,018 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 182 flow [2022-11-16 11:33:59,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-16 11:33:59,018 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:59,019 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:59,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:33:59,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:33:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1961218463, now seen corresponding path program 1 times [2022-11-16 11:33:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:59,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477338682] [2022-11-16 11:33:59,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:59,123 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-16 11:33:59,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:59,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477338682] [2022-11-16 11:33:59,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477338682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:59,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:59,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:33:59,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122409923] [2022-11-16 11:33:59,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:59,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:33:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:59,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:33:59,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:33:59,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 93 [2022-11-16 11:33:59,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-16 11:33:59,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:59,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 93 [2022-11-16 11:33:59,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:59,572 INFO L130 PetriNetUnfolder]: 1077/2517 cut-off events. [2022-11-16 11:33:59,573 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-16 11:33:59,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4257 conditions, 2517 events. 1077/2517 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 17292 event pairs, 352 based on Foata normal form. 0/2168 useless extension candidates. Maximal degree in co-relation 4252. Up to 1021 conditions per place. [2022-11-16 11:33:59,590 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 43 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2022-11-16 11:33:59,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 108 transitions, 329 flow [2022-11-16 11:33:59,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:33:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:33:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2022-11-16 11:33:59,594 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8207885304659498 [2022-11-16 11:33:59,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2022-11-16 11:33:59,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2022-11-16 11:33:59,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:59,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2022-11-16 11:33:59,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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-16 11:33:59,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 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-16 11:33:59,598 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 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-16 11:33:59,598 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 182 flow. Second operand 3 states and 229 transitions. [2022-11-16 11:33:59,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 108 transitions, 329 flow [2022-11-16 11:33:59,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 108 transitions, 329 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:33:59,603 INFO L231 Difference]: Finished difference. Result has 93 places, 92 transitions, 236 flow [2022-11-16 11:33:59,604 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=93, PETRI_TRANSITIONS=92} [2022-11-16 11:33:59,606 INFO L288 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2022-11-16 11:33:59,606 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 236 flow [2022-11-16 11:33:59,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-16 11:33:59,607 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:59,607 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:59,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:33:59,607 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 11:33:59,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash 939907155, now seen corresponding path program 1 times [2022-11-16 11:33:59,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:59,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696438755] [2022-11-16 11:33:59,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:59,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:33:59,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:33:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:33:59,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:33:59,661 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:33:59,661 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-16 11:33:59,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-16 11:33:59,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-16 11:33:59,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-16 11:33:59,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-16 11:33:59,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:33:59,663 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-16 11:33:59,663 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:33:59,664 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 11:33:59,692 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:33:59,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 111 transitions, 243 flow [2022-11-16 11:33:59,721 INFO L130 PetriNetUnfolder]: 18/229 cut-off events. [2022-11-16 11:33:59,722 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-16 11:33:59,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 229 events. 18/229 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 671 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 175. Up to 8 conditions per place. [2022-11-16 11:33:59,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 111 transitions, 243 flow [2022-11-16 11:33:59,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 111 transitions, 243 flow [2022-11-16 11:33:59,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:33:59,727 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;@64e650ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:33:59,728 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:33:59,733 INFO L130 PetriNetUnfolder]: 4/52 cut-off events. [2022-11-16 11:33:59,733 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:33:59,733 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:59,733 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:59,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:33:59,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash 81172322, now seen corresponding path program 1 times [2022-11-16 11:33:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:59,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187787321] [2022-11-16 11:33:59,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:59,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:33:59,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:59,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187787321] [2022-11-16 11:33:59,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187787321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:59,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:59,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:33:59,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456040623] [2022-11-16 11:33:59,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:59,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:33:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:59,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:33:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:33:59,767 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 111 [2022-11-16 11:33:59,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 243 flow. Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-16 11:33:59,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:59,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 111 [2022-11-16 11:33:59,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:00,182 INFO L130 PetriNetUnfolder]: 934/2503 cut-off events. [2022-11-16 11:34:00,183 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-11-16 11:34:00,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3862 conditions, 2503 events. 934/2503 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 18758 event pairs, 621 based on Foata normal form. 389/2398 useless extension candidates. Maximal degree in co-relation 2905. Up to 1274 conditions per place. [2022-11-16 11:34:00,203 INFO L137 encePairwiseOnDemand]: 106/111 looper letters, 19 selfloop transitions, 0 changer transitions 0/102 dead transitions. [2022-11-16 11:34:00,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 102 transitions, 263 flow [2022-11-16 11:34:00,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:34:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:34:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 190 transitions. [2022-11-16 11:34:00,205 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8558558558558559 [2022-11-16 11:34:00,205 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 190 transitions. [2022-11-16 11:34:00,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 190 transitions. [2022-11-16 11:34:00,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:00,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 190 transitions. [2022-11-16 11:34:00,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-16 11:34:00,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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-16 11:34:00,208 INFO L81 ComplementDD]: Finished complementDD. Result 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-16 11:34:00,208 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 243 flow. Second operand 2 states and 190 transitions. [2022-11-16 11:34:00,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 102 transitions, 263 flow [2022-11-16 11:34:00,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 102 transitions, 257 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-16 11:34:00,215 INFO L231 Difference]: Finished difference. Result has 106 places, 102 transitions, 219 flow [2022-11-16 11:34:00,215 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=219, PETRI_PLACES=106, PETRI_TRANSITIONS=102} [2022-11-16 11:34:00,220 INFO L288 CegarLoopForPetriNet]: 109 programPoint places, -3 predicate places. [2022-11-16 11:34:00,221 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 102 transitions, 219 flow [2022-11-16 11:34:00,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-16 11:34:00,221 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:00,221 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:00,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:34:00,227 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:34:00,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash 252701119, now seen corresponding path program 1 times [2022-11-16 11:34:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:00,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842487663] [2022-11-16 11:34:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:00,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:00,361 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-16 11:34:00,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:00,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842487663] [2022-11-16 11:34:00,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842487663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:00,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:00,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:34:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627834483] [2022-11-16 11:34:00,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:00,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:34:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:00,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:34:00,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:00,370 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 111 [2022-11-16 11:34:00,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 102 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-16 11:34:00,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:00,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 111 [2022-11-16 11:34:00,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:03,793 INFO L130 PetriNetUnfolder]: 15145/26404 cut-off events. [2022-11-16 11:34:03,793 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-11-16 11:34:03,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47580 conditions, 26404 events. 15145/26404 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 223573 event pairs, 5877 based on Foata normal form. 0/22557 useless extension candidates. Maximal degree in co-relation 47574. Up to 12218 conditions per place. [2022-11-16 11:34:03,980 INFO L137 encePairwiseOnDemand]: 99/111 looper letters, 58 selfloop transitions, 8 changer transitions 0/132 dead transitions. [2022-11-16 11:34:03,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 132 transitions, 421 flow [2022-11-16 11:34:03,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:34:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:34:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2022-11-16 11:34:03,982 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8048048048048048 [2022-11-16 11:34:03,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2022-11-16 11:34:03,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2022-11-16 11:34:03,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:03,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2022-11-16 11:34:03,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-16 11:34:03,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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-16 11:34:03,986 INFO L81 ComplementDD]: Finished complementDD. Result 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-16 11:34:03,986 INFO L175 Difference]: Start difference. First operand has 106 places, 102 transitions, 219 flow. Second operand 3 states and 268 transitions. [2022-11-16 11:34:03,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 132 transitions, 421 flow [2022-11-16 11:34:03,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 132 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:34:03,990 INFO L231 Difference]: Finished difference. Result has 110 places, 110 transitions, 291 flow [2022-11-16 11:34:03,990 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=291, PETRI_PLACES=110, PETRI_TRANSITIONS=110} [2022-11-16 11:34:03,991 INFO L288 CegarLoopForPetriNet]: 109 programPoint places, 1 predicate places. [2022-11-16 11:34:03,991 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 110 transitions, 291 flow [2022-11-16 11:34:03,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-16 11:34:03,991 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:03,992 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:03,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:34:03,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:34:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1394779455, now seen corresponding path program 1 times [2022-11-16 11:34:03,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:03,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766865777] [2022-11-16 11:34:03,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:03,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:34:04,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:04,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766865777] [2022-11-16 11:34:04,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766865777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:04,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:04,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:34:04,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292962075] [2022-11-16 11:34:04,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:04,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:34:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:04,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:34:04,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:34:04,470 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 111 [2022-11-16 11:34:04,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 0 states have call successors, (0), 0 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-16 11:34:04,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:04,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 111 [2022-11-16 11:34:04,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:06,187 INFO L130 PetriNetUnfolder]: 4513/11833 cut-off events. [2022-11-16 11:34:06,187 INFO L131 PetriNetUnfolder]: For 1409/1683 co-relation queries the response was YES. [2022-11-16 11:34:06,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21126 conditions, 11833 events. 4513/11833 cut-off events. For 1409/1683 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 124324 event pairs, 970 based on Foata normal form. 0/10498 useless extension candidates. Maximal degree in co-relation 21118. Up to 3938 conditions per place. [2022-11-16 11:34:06,286 INFO L137 encePairwiseOnDemand]: 99/111 looper letters, 64 selfloop transitions, 25 changer transitions 0/172 dead transitions. [2022-11-16 11:34:06,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 172 transitions, 623 flow [2022-11-16 11:34:06,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:34:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:34:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2022-11-16 11:34:06,289 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8108108108108109 [2022-11-16 11:34:06,289 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2022-11-16 11:34:06,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2022-11-16 11:34:06,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:06,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2022-11-16 11:34:06,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-16 11:34:06,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-16 11:34:06,294 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-16 11:34:06,295 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 291 flow. Second operand 6 states and 540 transitions. [2022-11-16 11:34:06,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 172 transitions, 623 flow [2022-11-16 11:34:06,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 172 transitions, 607 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:34:06,308 INFO L231 Difference]: Finished difference. Result has 116 places, 136 transitions, 430 flow [2022-11-16 11:34:06,308 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=116, PETRI_TRANSITIONS=136} [2022-11-16 11:34:06,310 INFO L288 CegarLoopForPetriNet]: 109 programPoint places, 7 predicate places. [2022-11-16 11:34:06,310 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 136 transitions, 430 flow [2022-11-16 11:34:06,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 0 states have call successors, (0), 0 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-16 11:34:06,311 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:06,311 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:06,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:34:06,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:34:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash -616967641, now seen corresponding path program 2 times [2022-11-16 11:34:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:06,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258256860] [2022-11-16 11:34:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:06,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:34:06,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:06,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258256860] [2022-11-16 11:34:06,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258256860] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:06,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447146532] [2022-11-16 11:34:06,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:34:06,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:06,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:06,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:34:06,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:34:06,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:34:06,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:34:06,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:34:06,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:07,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:34:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:34:07,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:34:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:34:07,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447146532] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:34:07,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:34:07,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 14 [2022-11-16 11:34:07,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897468209] [2022-11-16 11:34:07,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:34:07,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:34:07,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:07,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:34:07,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:34:07,319 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 111 [2022-11-16 11:34:07,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 136 transitions, 430 flow. Second operand has 14 states, 14 states have (on average 59.57142857142857) internal successors, (834), 14 states have internal predecessors, (834), 0 states have call successors, (0), 0 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-16 11:34:07,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:07,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 111 [2022-11-16 11:34:07,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:17,906 INFO L130 PetriNetUnfolder]: 43702/76305 cut-off events. [2022-11-16 11:34:17,906 INFO L131 PetriNetUnfolder]: For 24587/24668 co-relation queries the response was YES. [2022-11-16 11:34:18,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178632 conditions, 76305 events. 43702/76305 cut-off events. For 24587/24668 co-relation queries the response was YES. Maximal size of possible extension queue 2851. Compared 739428 event pairs, 3459 based on Foata normal form. 3336/74574 useless extension candidates. Maximal degree in co-relation 178621. Up to 12109 conditions per place. [2022-11-16 11:34:18,676 INFO L137 encePairwiseOnDemand]: 85/111 looper letters, 402 selfloop transitions, 277 changer transitions 0/736 dead transitions. [2022-11-16 11:34:18,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 736 transitions, 3854 flow [2022-11-16 11:34:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:34:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-11-16 11:34:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2651 transitions. [2022-11-16 11:34:18,684 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7024377318494965 [2022-11-16 11:34:18,685 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2651 transitions. [2022-11-16 11:34:18,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2651 transitions. [2022-11-16 11:34:18,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:18,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2651 transitions. [2022-11-16 11:34:18,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 77.97058823529412) internal successors, (2651), 34 states have internal predecessors, (2651), 0 states have call successors, (0), 0 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-16 11:34:18,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 111.0) internal successors, (3885), 35 states have internal predecessors, (3885), 0 states have call successors, (0), 0 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-16 11:34:18,705 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 111.0) internal successors, (3885), 35 states have internal predecessors, (3885), 0 states have call successors, (0), 0 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-16 11:34:18,706 INFO L175 Difference]: Start difference. First operand has 116 places, 136 transitions, 430 flow. Second operand 34 states and 2651 transitions. [2022-11-16 11:34:18,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 736 transitions, 3854 flow [2022-11-16 11:34:18,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 736 transitions, 3854 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:34:18,727 INFO L231 Difference]: Finished difference. Result has 176 places, 397 transitions, 2770 flow [2022-11-16 11:34:18,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2770, PETRI_PLACES=176, PETRI_TRANSITIONS=397} [2022-11-16 11:34:18,729 INFO L288 CegarLoopForPetriNet]: 109 programPoint places, 67 predicate places. [2022-11-16 11:34:18,730 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 397 transitions, 2770 flow [2022-11-16 11:34:18,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 59.57142857142857) internal successors, (834), 14 states have internal predecessors, (834), 0 states have call successors, (0), 0 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-16 11:34:18,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:18,731 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:18,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 11:34:18,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af6d55c3-274c-4a59-82f2-28f1bbe22a3c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:18,937 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:34:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:18,938 INFO L85 PathProgramCache]: Analyzing trace with hash 739198452, now seen corresponding path program 1 times [2022-11-16 11:34:18,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:18,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578866195] [2022-11-16 11:34:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:18,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 11:34:19,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:19,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578866195] [2022-11-16 11:34:19,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578866195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:19,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:19,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:34:19,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887579609] [2022-11-16 11:34:19,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:19,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:34:19,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:19,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:34:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:34:19,229 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 111 [2022-11-16 11:34:19,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 397 transitions, 2770 flow. Second operand has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 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-16 11:34:19,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:19,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 111 [2022-11-16 11:34:19,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:24,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][288], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 32#L719true, 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), 46#L717-8true, 45#L719-3true, Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), 121#true, Black: 290#(not (= (mod ~c~0 4294967296) 1)), Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 501#true, Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread1of3ForFork0InUse, Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 4#L717-8true, Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1)]) [2022-11-16 11:34:24,145 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-16 11:34:24,145 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-16 11:34:24,145 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-16 11:34:24,145 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-16 11:34:25,099 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread2of3ForFork0_#t~post5#1=|v_thr1Thread2of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_#t~post5#1, ~s~0][184], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 47#L719-3true, 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), 121#true, Black: 290#(not (= (mod ~c~0 4294967296) 1)), Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 501#true, Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, 4#L717-8true, Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1), 55#L717-8true]) [2022-11-16 11:34:25,099 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-16 11:34:25,099 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 11:34:25,100 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 11:34:25,100 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 11:34:27,736 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][422], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 32#L719true, 102#L717-7true, 290#(not (= (mod ~c~0 4294967296) 1)), 51#L716-3true, Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 121#true, Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 501#true, Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread1of3ForFork0InUse, Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1)]) [2022-11-16 11:34:27,737 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-16 11:34:27,737 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,737 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-16 11:34:27,737 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-16 11:34:27,913 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 290#(not (= (mod ~c~0 4294967296) 1)), 51#L716-3true, Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), 45#L719-3true, Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), 121#true, Black: 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 501#true, Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread1of3ForFork0InUse, Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, 4#L717-8true, Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1)]) [2022-11-16 11:34:27,913 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,913 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,913 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,913 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,928 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 121#true, Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 501#true, Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread1of3ForFork0InUse, Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 4#L717-8true, 112#true, Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-16 11:34:27,928 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-16 11:34:27,928 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:34:27,928 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:34:27,928 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:34:27,932 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][422], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 32#L719true, 102#L717-7true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), 121#true, Black: 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 501#true, Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-16 11:34:27,932 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,932 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,932 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:34:27,932 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,949 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 102#L717-7true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 121#true, Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 501#true, Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-16 11:34:27,949 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,949 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,949 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-16 11:34:27,949 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-16 11:34:28,084 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), 121#true, Black: 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 501#true, Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 4#L717-8true, Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 112#true, Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-16 11:34:28,084 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-16 11:34:28,084 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:34:28,085 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:34:28,085 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:34:28,085 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:34:28,170 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), 45#L719-3true, Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), 121#true, Black: 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 501#true, Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 73#L718true, Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 112#true, Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-16 11:34:28,170 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-11-16 11:34:28,170 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-16 11:34:28,170 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-16 11:34:28,170 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-16 11:34:28,229 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), 121#true, Black: 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 23#L718-4true, Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 501#true, Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 112#true, Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-16 11:34:28,229 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-11-16 11:34:28,230 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-11-16 11:34:28,230 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-11-16 11:34:28,230 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-11-16 11:34:28,264 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L719-->L719-3: Formula: (= v_~s~0_22 (+ v_~s~0_23 1)) InVars {~s~0=v_~s~0_23} OutVars{thr1Thread3of3ForFork0_#t~post5#1=|v_thr1Thread3of3ForFork0_#t~post5#1_1|, ~s~0=v_~s~0_22} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~post5#1, ~s~0][367], [Black: 124#(and (= ~t~0 0) (= ~s~0 0)), Black: 126#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (<= 1 (select (select |#memory_int| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|))), Black: 125#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0)), 44#L719-3true, 56#L719true, 290#(not (= (mod ~c~0 4294967296) 1)), Black: 452#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 436#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0)), 45#L719-3true, Black: 456#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 470#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 426#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), 121#true, Black: 450#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 420#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 501#true, Black: 444#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (<= (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 1) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= |ULTIMATE.start_thr1_~#l~0#1.offset| 0) (= (mod ~c~0 4294967296) 1)), Black: 472#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 448#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 280#(= (mod ~c~0 4294967296) 1), Black: 468#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 446#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 424#(and (<= ~t~0 1) (<= 1 ~t~0) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 442#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread1of3ForFork0InUse, Black: 428#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 462#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 438#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), thr1Thread2of3ForFork0InUse, Black: 454#(and (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (= (mod ~c~0 4294967296) 1)), Black: 422#(and (<= ~t~0 1) (<= 1 ~t~0) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), thr1Thread3of3ForFork0InUse, Black: 434#(and (not (<= (+ (div ~s~0 4294967296) 1) (div (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|)) (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 460#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 458#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), 112#true, Black: 466#(and (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1))), Black: 432#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (not (= (mod ~c~0 4294967296) 1)) (= ~s~0 0)), Black: 464#(and (not (= (mod ~t~0 4294967296) (mod ~s~0 4294967296))) (not (= (mod (+ ~t~0 1) 4294967296) (mod ~s~0 4294967296))) (not (= (mod ~s~0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 4294967296))) (= ~s~0 0) (= (mod ~c~0 4294967296) 1)), Black: 117#(= ~c~0 1), 93#thr1FINALtrue]) [2022-11-16 11:34:28,264 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-16 11:34:28,264 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-16 11:34:28,264 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-16 11:34:28,264 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-16 11:34:28,313 INFO L130 PetriNetUnfolder]: 24873/52804 cut-off events. [2022-11-16 11:34:28,313 INFO L131 PetriNetUnfolder]: For 339572/350563 co-relation queries the response was YES. [2022-11-16 11:34:28,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213373 conditions, 52804 events. 24873/52804 cut-off events. For 339572/350563 co-relation queries the response was YES. Maximal size of possible extension queue 2503. Compared 592111 event pairs, 3662 based on Foata normal form. 347/49183 useless extension candidates. Maximal degree in co-relation 213334. Up to 20621 conditions per place. [2022-11-16 11:34:29,255 INFO L137 encePairwiseOnDemand]: 99/111 looper letters, 195 selfloop transitions, 76 changer transitions 0/440 dead transitions. [2022-11-16 11:34:29,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 440 transitions, 3644 flow [2022-11-16 11:34:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:34:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:34:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2022-11-16 11:34:29,258 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8108108108108109 [2022-11-16 11:34:29,258 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2022-11-16 11:34:29,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2022-11-16 11:34:29,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:29,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2022-11-16 11:34:29,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-16 11:34:29,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-16 11:34:29,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-16 11:34:29,263 INFO L175 Difference]: Start difference. First operand has 176 places, 397 transitions, 2770 flow. Second operand 6 states and 540 transitions. [2022-11-16 11:34:29,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 440 transitions, 3644 flow [2022-11-16 11:34:36,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 440 transitions, 3236 flow, removed 145 selfloop flow, removed 8 redundant places. [2022-11-16 11:34:36,060 INFO L231 Difference]: Finished difference. Result has 174 places, 404 transitions, 2607 flow [2022-11-16 11:34:36,061 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2345, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2607, PETRI_PLACES=174, PETRI_TRANSITIONS=404} [2022-11-16 11:34:36,061 INFO L288 CegarLoopForPetriNet]: 109 programPoint places, 65 predicate places. [2022-11-16 11:34:36,062 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 404 transitions, 2607 flow [2022-11-16 11:34:36,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 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-16 11:34:36,062 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:36,062 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:36,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:34:36,063 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:34:36,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash -470379019, now seen corresponding path program 1 times [2022-11-16 11:34:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:36,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851818887] [2022-11-16 11:34:36,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:36,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:34:36,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:34:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:34:36,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:34:36,114 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:34:36,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-16 11:34:36,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 11:34:36,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-11-16 11:34:36,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-16 11:34:36,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-16 11:34:36,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 11:34:36,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:34:36,116 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-11-16 11:34:36,116 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:34:36,117 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-16 11:34:36,168 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:34:36,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 290 flow [2022-11-16 11:34:36,209 INFO L130 PetriNetUnfolder]: 23/287 cut-off events. [2022-11-16 11:34:36,210 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-16 11:34:36,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 287 events. 23/287 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 899 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 237. Up to 10 conditions per place. [2022-11-16 11:34:36,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 129 transitions, 290 flow [2022-11-16 11:34:36,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 290 flow [2022-11-16 11:34:36,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:34:36,217 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;@64e650ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:34:36,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 11:34:36,222 INFO L130 PetriNetUnfolder]: 4/52 cut-off events. [2022-11-16 11:34:36,222 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:34:36,223 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:36,223 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:36,223 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash -374464222, now seen corresponding path program 1 times [2022-11-16 11:34:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:36,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066092308] [2022-11-16 11:34:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:36,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:36,242 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-16 11:34:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:36,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066092308] [2022-11-16 11:34:36,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066092308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:36,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:36,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:34:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964443838] [2022-11-16 11:34:36,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:36,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:34:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:36,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:34:36,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:34:36,245 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2022-11-16 11:34:36,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 129 transitions, 290 flow. Second operand has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 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-16 11:34:36,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:36,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2022-11-16 11:34:36,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:37,304 INFO L130 PetriNetUnfolder]: 5094/10988 cut-off events. [2022-11-16 11:34:37,304 INFO L131 PetriNetUnfolder]: For 755/755 co-relation queries the response was YES. [2022-11-16 11:34:37,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17853 conditions, 10988 events. 5094/10988 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 97153 event pairs, 3501 based on Foata normal form. 1903/10664 useless extension candidates. Maximal degree in co-relation 13547. Up to 6458 conditions per place. [2022-11-16 11:34:37,379 INFO L137 encePairwiseOnDemand]: 123/129 looper letters, 24 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2022-11-16 11:34:37,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 118 transitions, 316 flow [2022-11-16 11:34:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:34:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:34:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 218 transitions. [2022-11-16 11:34:37,381 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8449612403100775 [2022-11-16 11:34:37,381 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 218 transitions. [2022-11-16 11:34:37,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 218 transitions. [2022-11-16 11:34:37,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:37,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 218 transitions. [2022-11-16 11:34:37,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 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-16 11:34:37,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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-16 11:34:37,384 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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-16 11:34:37,384 INFO L175 Difference]: Start difference. First operand has 127 places, 129 transitions, 290 flow. Second operand 2 states and 218 transitions. [2022-11-16 11:34:37,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 118 transitions, 316 flow [2022-11-16 11:34:37,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 118 transitions, 304 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-11-16 11:34:37,386 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 256 flow [2022-11-16 11:34:37,387 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=256, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2022-11-16 11:34:37,387 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, -4 predicate places. [2022-11-16 11:34:37,388 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 256 flow [2022-11-16 11:34:37,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 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-16 11:34:37,388 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:37,388 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:37,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:34:37,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash 472650655, now seen corresponding path program 1 times [2022-11-16 11:34:37,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:37,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324819584] [2022-11-16 11:34:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:37,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,449 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-16 11:34:37,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:37,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324819584] [2022-11-16 11:34:37,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324819584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:37,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:37,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:34:37,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199365676] [2022-11-16 11:34:37,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:37,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:34:37,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:37,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:34:37,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:37,453 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2022-11-16 11:34:37,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 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-16 11:34:37,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:37,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2022-11-16 11:34:37,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand