./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro --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 4018a1168c08743b2a9b9283b6137e1dcc53bdf8ab8362348f4bbe02762305c3 --- 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-8393723 [2022-11-18 20:12:00,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:12:00,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:12:00,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:12:00,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:12:00,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:12:00,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:12:00,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:12:00,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:12:00,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:12:00,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:12:00,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:12:00,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:12:00,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:12:00,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:12:00,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:12:00,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:12:00,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:12:00,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:12:00,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:12:00,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:12:00,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:12:00,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:12:00,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:12:00,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:12:00,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:12:00,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:12:00,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:12:00,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:12:00,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:12:00,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:12:00,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:12:00,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:12:00,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:12:00,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:12:00,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:12:00,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:12:00,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:12:00,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:12:00,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:12:00,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:12:00,885 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:12:00,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:12:00,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:12:00,923 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:12:00,923 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:12:00,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:12:00,924 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:12:00,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:12:00,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:12:00,925 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:12:00,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:12:00,927 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:12:00,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:12:00,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:12:00,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:12:00,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:12:00,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:12:00,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:12:00,928 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:12:00,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:12:00,929 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:12:00,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:12:00,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:12:00,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:12:00,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:12:00,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:12:00,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:12:00,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:12:00,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:12:00,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:12:00,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:12:00,932 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:12:00,933 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:12:00,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:12:00,933 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_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/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_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro 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 -> 4018a1168c08743b2a9b9283b6137e1dcc53bdf8ab8362348f4bbe02762305c3 [2022-11-18 20:12:01,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:12:01,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:12:01,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:12:01,246 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:12:01,246 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:12:01,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2022-11-18 20:12:01,319 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/data/aaa601f86/7789fd005b764593bd90c9a3c72b3647/FLAGf95b88851 [2022-11-18 20:12:01,887 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:12:01,891 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2022-11-18 20:12:01,904 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/data/aaa601f86/7789fd005b764593bd90c9a3c72b3647/FLAGf95b88851 [2022-11-18 20:12:02,234 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/data/aaa601f86/7789fd005b764593bd90c9a3c72b3647 [2022-11-18 20:12:02,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:12:02,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:12:02,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:12:02,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:12:02,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:12:02,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f383deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02, skipping insertion in model container [2022-11-18 20:12:02,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:12:02,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:12:02,517 WARN L234 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_f9ff7158-537c-49f6-966b-f8b4fdec897e/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-11-18 20:12:02,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:12:02,549 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:12:02,591 WARN L234 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_f9ff7158-537c-49f6-966b-f8b4fdec897e/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-11-18 20:12:02,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:12:02,615 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:12:02,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02 WrapperNode [2022-11-18 20:12:02,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:12:02,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:12:02,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:12:02,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:12:02,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,687 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 191 [2022-11-18 20:12:02,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:12:02,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:12:02,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:12:02,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:12:02,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,742 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:12:02,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:12:02,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:12:02,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:12:02,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (1/1) ... [2022-11-18 20:12:02,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:12:02,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:02,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:12:02,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:12:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:12:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:12:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:12:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:12:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 20:12:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 20:12:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 20:12:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 20:12:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-18 20:12:02,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-18 20:12:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:12:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:12:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:12:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:12:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:12:02,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:12:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:12:02,840 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:12:02,991 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:12:02,993 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:12:03,365 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:12:03,539 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:12:03,540 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 20:12:03,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:12:03 BoogieIcfgContainer [2022-11-18 20:12:03,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:12:03,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:12:03,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:12:03,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:12:03,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:12:02" (1/3) ... [2022-11-18 20:12:03,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518900bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:12:03, skipping insertion in model container [2022-11-18 20:12:03,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:02" (2/3) ... [2022-11-18 20:12:03,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518900bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:12:03, skipping insertion in model container [2022-11-18 20:12:03,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:12:03" (3/3) ... [2022-11-18 20:12:03,552 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-11-18 20:12:03,562 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:12:03,573 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:12:03,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:12:03,573 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:12:03,660 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 20:12:03,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-11-18 20:12:03,777 INFO L130 PetriNetUnfolder]: 12/150 cut-off events. [2022-11-18 20:12:03,777 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 20:12:03,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 88 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-11-18 20:12:03,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 153 transitions, 330 flow [2022-11-18 20:12:03,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 139 transitions, 296 flow [2022-11-18 20:12:03,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:12:03,825 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;@793bf8b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:12:03,825 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 20:12:03,896 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-11-18 20:12:03,896 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 20:12:03,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:03,897 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, 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, 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-18 20:12:03,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1885809601, now seen corresponding path program 1 times [2022-11-18 20:12:03,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:03,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806096735] [2022-11-18 20:12:03,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:03,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:04,167 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-18 20:12:04,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:04,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806096735] [2022-11-18 20:12:04,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806096735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:12:04,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:12:04,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:12:04,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982159566] [2022-11-18 20:12:04,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:04,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:12:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:12:04,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:12:04,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 153 [2022-11-18 20:12:04,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 139 transitions, 296 flow. Second operand has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:04,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:04,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 153 [2022-11-18 20:12:04,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:04,399 INFO L130 PetriNetUnfolder]: 41/264 cut-off events. [2022-11-18 20:12:04,400 INFO L131 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-11-18 20:12:04,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 264 events. 41/264 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 697 event pairs, 15 based on Foata normal form. 42/275 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-11-18 20:12:04,409 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 9 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2022-11-18 20:12:04,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 298 flow [2022-11-18 20:12:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:12:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 20:12:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-11-18 20:12:04,432 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2022-11-18 20:12:04,433 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-11-18 20:12:04,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-11-18 20:12:04,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:04,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-11-18 20:12:04,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:04,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:04,455 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:04,457 INFO L175 Difference]: Start difference. First operand has 137 places, 139 transitions, 296 flow. Second operand 2 states and 287 transitions. [2022-11-18 20:12:04,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 298 flow [2022-11-18 20:12:04,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 286 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-18 20:12:04,466 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 260 flow [2022-11-18 20:12:04,468 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2022-11-18 20:12:04,474 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2022-11-18 20:12:04,475 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 260 flow [2022-11-18 20:12:04,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:04,475 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:04,476 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, 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, 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-18 20:12:04,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:12:04,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash 740750995, now seen corresponding path program 1 times [2022-11-18 20:12:04,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:04,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449117541] [2022-11-18 20:12:04,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:04,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:05,147 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-18 20:12:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:05,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449117541] [2022-11-18 20:12:05,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449117541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:12:05,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:12:05,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:12:05,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985622474] [2022-11-18 20:12:05,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:05,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:12:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:12:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:12:05,152 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-11-18 20:12:05,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:05,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:05,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-11-18 20:12:05,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:05,374 INFO L130 PetriNetUnfolder]: 54/344 cut-off events. [2022-11-18 20:12:05,374 INFO L131 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-11-18 20:12:05,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 344 events. 54/344 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1156 event pairs, 6 based on Foata normal form. 2/311 useless extension candidates. Maximal degree in co-relation 459. Up to 52 conditions per place. [2022-11-18 20:12:05,377 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 39 selfloop transitions, 6 changer transitions 4/149 dead transitions. [2022-11-18 20:12:05,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 149 transitions, 411 flow [2022-11-18 20:12:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:12:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:12:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2022-11-18 20:12:05,385 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7930283224400871 [2022-11-18 20:12:05,385 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2022-11-18 20:12:05,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2022-11-18 20:12:05,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:05,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2022-11-18 20:12:05,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:05,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:05,395 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:05,395 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 260 flow. Second operand 6 states and 728 transitions. [2022-11-18 20:12:05,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 149 transitions, 411 flow [2022-11-18 20:12:05,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 149 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:12:05,402 INFO L231 Difference]: Finished difference. Result has 136 places, 131 transitions, 296 flow [2022-11-18 20:12:05,403 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=136, PETRI_TRANSITIONS=131} [2022-11-18 20:12:05,404 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, -1 predicate places. [2022-11-18 20:12:05,405 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 296 flow [2022-11-18 20:12:05,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:05,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:05,406 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, 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, 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-18 20:12:05,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:12:05,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:05,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:05,410 INFO L85 PathProgramCache]: Analyzing trace with hash -565445877, now seen corresponding path program 1 times [2022-11-18 20:12:05,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:05,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948004285] [2022-11-18 20:12:05,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:05,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:05,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:05,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948004285] [2022-11-18 20:12:05,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948004285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:12:05,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:12:05,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:12:05,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405154845] [2022-11-18 20:12:05,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:05,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:12:05,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:05,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:12:05,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:12:05,747 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-11-18 20:12:05,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:05,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:05,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-11-18 20:12:05,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:06,212 INFO L130 PetriNetUnfolder]: 378/1242 cut-off events. [2022-11-18 20:12:06,212 INFO L131 PetriNetUnfolder]: For 239/267 co-relation queries the response was YES. [2022-11-18 20:12:06,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2173 conditions, 1242 events. 378/1242 cut-off events. For 239/267 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7883 event pairs, 144 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 2166. Up to 429 conditions per place. [2022-11-18 20:12:06,222 INFO L137 encePairwiseOnDemand]: 144/153 looper letters, 55 selfloop transitions, 8 changer transitions 0/159 dead transitions. [2022-11-18 20:12:06,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 159 transitions, 506 flow [2022-11-18 20:12:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:12:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 20:12:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2022-11-18 20:12:06,225 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2022-11-18 20:12:06,226 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2022-11-18 20:12:06,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2022-11-18 20:12:06,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:06,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2022-11-18 20:12:06,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:06,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:06,232 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:06,233 INFO L175 Difference]: Start difference. First operand has 136 places, 131 transitions, 296 flow. Second operand 8 states and 960 transitions. [2022-11-18 20:12:06,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 159 transitions, 506 flow [2022-11-18 20:12:06,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 159 transitions, 502 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-18 20:12:06,238 INFO L231 Difference]: Finished difference. Result has 142 places, 134 transitions, 328 flow [2022-11-18 20:12:06,239 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=142, PETRI_TRANSITIONS=134} [2022-11-18 20:12:06,241 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 5 predicate places. [2022-11-18 20:12:06,241 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 134 transitions, 328 flow [2022-11-18 20:12:06,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:06,242 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:06,242 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, 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, 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-18 20:12:06,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:12:06,243 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1447802893, now seen corresponding path program 1 times [2022-11-18 20:12:06,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:06,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351369109] [2022-11-18 20:12:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:06,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:06,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:06,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351369109] [2022-11-18 20:12:06,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351369109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:12:06,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:12:06,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:12:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040973374] [2022-11-18 20:12:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:06,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:12:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:06,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:12:06,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:12:06,839 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2022-11-18 20:12:06,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 134 transitions, 328 flow. Second operand has 10 states, 10 states have (on average 95.1) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:06,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:06,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2022-11-18 20:12:06,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:07,766 INFO L130 PetriNetUnfolder]: 870/1937 cut-off events. [2022-11-18 20:12:07,767 INFO L131 PetriNetUnfolder]: For 377/401 co-relation queries the response was YES. [2022-11-18 20:12:07,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3794 conditions, 1937 events. 870/1937 cut-off events. For 377/401 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13113 event pairs, 583 based on Foata normal form. 24/1735 useless extension candidates. Maximal degree in co-relation 3785. Up to 1139 conditions per place. [2022-11-18 20:12:07,781 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 77 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2022-11-18 20:12:07,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 167 transitions, 590 flow [2022-11-18 20:12:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:12:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:12:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1084 transitions. [2022-11-18 20:12:07,785 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6440879382055853 [2022-11-18 20:12:07,785 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1084 transitions. [2022-11-18 20:12:07,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1084 transitions. [2022-11-18 20:12:07,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:07,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1084 transitions. [2022-11-18 20:12:07,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.54545454545455) internal successors, (1084), 11 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:07,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:07,793 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:07,793 INFO L175 Difference]: Start difference. First operand has 142 places, 134 transitions, 328 flow. Second operand 11 states and 1084 transitions. [2022-11-18 20:12:07,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 167 transitions, 590 flow [2022-11-18 20:12:07,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 167 transitions, 580 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:12:07,798 INFO L231 Difference]: Finished difference. Result has 153 places, 138 transitions, 367 flow [2022-11-18 20:12:07,798 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=367, PETRI_PLACES=153, PETRI_TRANSITIONS=138} [2022-11-18 20:12:07,799 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 16 predicate places. [2022-11-18 20:12:07,799 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 138 transitions, 367 flow [2022-11-18 20:12:07,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.1) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:07,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:07,800 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, 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, 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-18 20:12:07,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:12:07,800 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash 343247993, now seen corresponding path program 1 times [2022-11-18 20:12:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:07,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272042287] [2022-11-18 20:12:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:08,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:08,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272042287] [2022-11-18 20:12:08,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272042287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:12:08,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:12:08,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:12:08,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130298115] [2022-11-18 20:12:08,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:08,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:12:08,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:08,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:12:08,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:12:08,298 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 153 [2022-11-18 20:12:08,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 138 transitions, 367 flow. Second operand has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:08,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:08,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 153 [2022-11-18 20:12:08,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:09,069 INFO L130 PetriNetUnfolder]: 688/1427 cut-off events. [2022-11-18 20:12:09,070 INFO L131 PetriNetUnfolder]: For 443/461 co-relation queries the response was YES. [2022-11-18 20:12:09,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3030 conditions, 1427 events. 688/1427 cut-off events. For 443/461 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8428 event pairs, 433 based on Foata normal form. 18/1316 useless extension candidates. Maximal degree in co-relation 3016. Up to 983 conditions per place. [2022-11-18 20:12:09,081 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 50 selfloop transitions, 6 changer transitions 21/156 dead transitions. [2022-11-18 20:12:09,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 156 transitions, 561 flow [2022-11-18 20:12:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:12:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:12:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1084 transitions. [2022-11-18 20:12:09,085 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6440879382055853 [2022-11-18 20:12:09,085 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1084 transitions. [2022-11-18 20:12:09,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1084 transitions. [2022-11-18 20:12:09,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:09,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1084 transitions. [2022-11-18 20:12:09,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.54545454545455) internal successors, (1084), 11 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:09,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:09,093 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:09,093 INFO L175 Difference]: Start difference. First operand has 153 places, 138 transitions, 367 flow. Second operand 11 states and 1084 transitions. [2022-11-18 20:12:09,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 156 transitions, 561 flow [2022-11-18 20:12:09,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 156 transitions, 548 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:12:09,099 INFO L231 Difference]: Finished difference. Result has 160 places, 132 transitions, 332 flow [2022-11-18 20:12:09,100 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=332, PETRI_PLACES=160, PETRI_TRANSITIONS=132} [2022-11-18 20:12:09,102 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 23 predicate places. [2022-11-18 20:12:09,103 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 132 transitions, 332 flow [2022-11-18 20:12:09,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:09,103 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:09,104 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, 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, 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-18 20:12:09,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:12:09,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash 502341716, now seen corresponding path program 1 times [2022-11-18 20:12:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:09,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912131885] [2022-11-18 20:12:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:09,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:09,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912131885] [2022-11-18 20:12:09,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912131885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:09,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304125032] [2022-11-18 20:12:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:09,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:09,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:09,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:09,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:12:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:09,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:12:09,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:09,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:10,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304125032] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:10,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:12:10,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-11-18 20:12:10,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616479701] [2022-11-18 20:12:10,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:10,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:12:10,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:10,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:12:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:12:10,080 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-11-18 20:12:10,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 132 transitions, 332 flow. Second operand has 18 states, 18 states have (on average 108.94444444444444) internal successors, (1961), 18 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:10,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:10,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-11-18 20:12:10,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:11,018 INFO L130 PetriNetUnfolder]: 1493/2888 cut-off events. [2022-11-18 20:12:11,018 INFO L131 PetriNetUnfolder]: For 1019/1019 co-relation queries the response was YES. [2022-11-18 20:12:11,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6359 conditions, 2888 events. 1493/2888 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20072 event pairs, 417 based on Foata normal form. 10/2838 useless extension candidates. Maximal degree in co-relation 6343. Up to 680 conditions per place. [2022-11-18 20:12:11,045 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 106 selfloop transitions, 19 changer transitions 0/214 dead transitions. [2022-11-18 20:12:11,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 214 transitions, 855 flow [2022-11-18 20:12:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:12:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:12:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1484 transitions. [2022-11-18 20:12:11,049 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7461035696329814 [2022-11-18 20:12:11,049 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1484 transitions. [2022-11-18 20:12:11,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1484 transitions. [2022-11-18 20:12:11,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:11,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1484 transitions. [2022-11-18 20:12:11,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.15384615384616) internal successors, (1484), 13 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:11,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 153.0) internal successors, (2142), 14 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:11,060 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 153.0) internal successors, (2142), 14 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:11,060 INFO L175 Difference]: Start difference. First operand has 160 places, 132 transitions, 332 flow. Second operand 13 states and 1484 transitions. [2022-11-18 20:12:11,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 214 transitions, 855 flow [2022-11-18 20:12:11,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 214 transitions, 795 flow, removed 24 selfloop flow, removed 14 redundant places. [2022-11-18 20:12:11,074 INFO L231 Difference]: Finished difference. Result has 151 places, 145 transitions, 401 flow [2022-11-18 20:12:11,075 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=401, PETRI_PLACES=151, PETRI_TRANSITIONS=145} [2022-11-18 20:12:11,077 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 14 predicate places. [2022-11-18 20:12:11,079 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 145 transitions, 401 flow [2022-11-18 20:12:11,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 108.94444444444444) internal successors, (1961), 18 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:11,082 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:11,082 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, 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, 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-18 20:12:11,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:11,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:11,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:11,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:11,304 INFO L85 PathProgramCache]: Analyzing trace with hash -610844560, now seen corresponding path program 2 times [2022-11-18 20:12:11,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:11,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691219669] [2022-11-18 20:12:11,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:11,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:11,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:11,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691219669] [2022-11-18 20:12:11,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691219669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:11,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638459104] [2022-11-18 20:12:11,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:12:11,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:11,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:11,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:11,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:12:11,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:12:11,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:12:11,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:12:11,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:11,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:11,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638459104] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:11,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:12:11,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-11-18 20:12:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797014341] [2022-11-18 20:12:11,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:11,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:12:11,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:11,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:12:11,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:12:11,969 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2022-11-18 20:12:11,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 145 transitions, 401 flow. Second operand has 17 states, 17 states have (on average 106.52941176470588) internal successors, (1811), 17 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:11,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:11,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2022-11-18 20:12:11,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:14,117 INFO L130 PetriNetUnfolder]: 3567/6361 cut-off events. [2022-11-18 20:12:14,118 INFO L131 PetriNetUnfolder]: For 2781/2784 co-relation queries the response was YES. [2022-11-18 20:12:14,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15816 conditions, 6361 events. 3567/6361 cut-off events. For 2781/2784 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 46113 event pairs, 240 based on Foata normal form. 16/6051 useless extension candidates. Maximal degree in co-relation 15804. Up to 725 conditions per place. [2022-11-18 20:12:14,175 INFO L137 encePairwiseOnDemand]: 137/153 looper letters, 247 selfloop transitions, 90 changer transitions 0/423 dead transitions. [2022-11-18 20:12:14,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 423 transitions, 2040 flow [2022-11-18 20:12:14,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:12:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-18 20:12:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2759 transitions. [2022-11-18 20:12:14,183 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7513616557734205 [2022-11-18 20:12:14,183 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2759 transitions. [2022-11-18 20:12:14,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2759 transitions. [2022-11-18 20:12:14,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:14,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2759 transitions. [2022-11-18 20:12:14,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 114.95833333333333) internal successors, (2759), 24 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:14,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:14,201 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:14,201 INFO L175 Difference]: Start difference. First operand has 151 places, 145 transitions, 401 flow. Second operand 24 states and 2759 transitions. [2022-11-18 20:12:14,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 423 transitions, 2040 flow [2022-11-18 20:12:14,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 423 transitions, 2033 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:12:14,227 INFO L231 Difference]: Finished difference. Result has 188 places, 227 transitions, 1140 flow [2022-11-18 20:12:14,228 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1140, PETRI_PLACES=188, PETRI_TRANSITIONS=227} [2022-11-18 20:12:14,228 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 51 predicate places. [2022-11-18 20:12:14,228 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 227 transitions, 1140 flow [2022-11-18 20:12:14,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 106.52941176470588) internal successors, (1811), 17 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:14,229 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:14,230 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, 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, 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-18 20:12:14,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:14,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 20:12:14,437 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:14,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:14,437 INFO L85 PathProgramCache]: Analyzing trace with hash -109719994, now seen corresponding path program 1 times [2022-11-18 20:12:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:14,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388859171] [2022-11-18 20:12:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:14,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:14,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388859171] [2022-11-18 20:12:14,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388859171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:14,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532346335] [2022-11-18 20:12:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:14,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:14,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:14,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:12:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:14,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:12:14,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:14,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:15,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532346335] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:15,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:15,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-18 20:12:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749581252] [2022-11-18 20:12:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:15,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:12:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:15,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:12:15,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:12:15,182 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-11-18 20:12:15,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 227 transitions, 1140 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:15,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:15,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-11-18 20:12:15,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:16,027 INFO L130 PetriNetUnfolder]: 1317/2979 cut-off events. [2022-11-18 20:12:16,028 INFO L131 PetriNetUnfolder]: For 12177/12695 co-relation queries the response was YES. [2022-11-18 20:12:16,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9611 conditions, 2979 events. 1317/2979 cut-off events. For 12177/12695 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 21999 event pairs, 322 based on Foata normal form. 161/3037 useless extension candidates. Maximal degree in co-relation 9581. Up to 954 conditions per place. [2022-11-18 20:12:16,073 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 73 selfloop transitions, 24 changer transitions 0/248 dead transitions. [2022-11-18 20:12:16,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 248 transitions, 1473 flow [2022-11-18 20:12:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:12:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 20:12:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-11-18 20:12:16,076 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7759103641456583 [2022-11-18 20:12:16,076 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-11-18 20:12:16,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-11-18 20:12:16,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:16,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-11-18 20:12:16,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:16,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:16,083 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:16,085 INFO L175 Difference]: Start difference. First operand has 188 places, 227 transitions, 1140 flow. Second operand 7 states and 831 transitions. [2022-11-18 20:12:16,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 248 transitions, 1473 flow [2022-11-18 20:12:16,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 248 transitions, 1427 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-11-18 20:12:16,154 INFO L231 Difference]: Finished difference. Result has 187 places, 227 transitions, 1150 flow [2022-11-18 20:12:16,154 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1150, PETRI_PLACES=187, PETRI_TRANSITIONS=227} [2022-11-18 20:12:16,157 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 50 predicate places. [2022-11-18 20:12:16,157 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 227 transitions, 1150 flow [2022-11-18 20:12:16,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:16,158 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:16,158 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, 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, 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-18 20:12:16,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:16,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-18 20:12:16,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:16,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:16,365 INFO L85 PathProgramCache]: Analyzing trace with hash -221605580, now seen corresponding path program 3 times [2022-11-18 20:12:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:16,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036027299] [2022-11-18 20:12:16,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:16,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:16,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036027299] [2022-11-18 20:12:16,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036027299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:16,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135734069] [2022-11-18 20:12:16,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:12:16,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:16,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:16,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:16,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:12:16,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 20:12:16,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:12:16,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:12:16,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:16,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:16,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135734069] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:16,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:16,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 18 [2022-11-18 20:12:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836716152] [2022-11-18 20:12:16,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:16,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:12:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:12:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:12:16,994 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 153 [2022-11-18 20:12:16,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 227 transitions, 1150 flow. Second operand has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:16,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:16,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 153 [2022-11-18 20:12:16,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:19,203 INFO L130 PetriNetUnfolder]: 4603/8274 cut-off events. [2022-11-18 20:12:19,204 INFO L131 PetriNetUnfolder]: For 29468/29533 co-relation queries the response was YES. [2022-11-18 20:12:19,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29353 conditions, 8274 events. 4603/8274 cut-off events. For 29468/29533 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 60354 event pairs, 790 based on Foata normal form. 25/8248 useless extension candidates. Maximal degree in co-relation 29325. Up to 1458 conditions per place. [2022-11-18 20:12:19,313 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 269 selfloop transitions, 178 changer transitions 0/546 dead transitions. [2022-11-18 20:12:19,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 546 transitions, 4282 flow [2022-11-18 20:12:19,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:12:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:12:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1988 transitions. [2022-11-18 20:12:19,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8120915032679739 [2022-11-18 20:12:19,320 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1988 transitions. [2022-11-18 20:12:19,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1988 transitions. [2022-11-18 20:12:19,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:19,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1988 transitions. [2022-11-18 20:12:19,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 124.25) internal successors, (1988), 16 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:19,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 153.0) internal successors, (2601), 17 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:19,335 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 153.0) internal successors, (2601), 17 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:19,335 INFO L175 Difference]: Start difference. First operand has 187 places, 227 transitions, 1150 flow. Second operand 16 states and 1988 transitions. [2022-11-18 20:12:19,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 546 transitions, 4282 flow [2022-11-18 20:12:19,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 546 transitions, 4208 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:12:19,583 INFO L231 Difference]: Finished difference. Result has 207 places, 362 transitions, 2798 flow [2022-11-18 20:12:19,584 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2798, PETRI_PLACES=207, PETRI_TRANSITIONS=362} [2022-11-18 20:12:19,585 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 70 predicate places. [2022-11-18 20:12:19,585 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 362 transitions, 2798 flow [2022-11-18 20:12:19,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:19,586 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:19,586 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, 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, 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-18 20:12:19,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:19,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:19,802 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:19,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1693336392, now seen corresponding path program 4 times [2022-11-18 20:12:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:19,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628169160] [2022-11-18 20:12:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:19,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:20,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:20,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628169160] [2022-11-18 20:12:20,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628169160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:20,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187235127] [2022-11-18 20:12:20,086 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:12:20,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:20,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:20,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:20,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:12:20,210 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:12:20,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:12:20,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:12:20,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:20,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:20,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187235127] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:20,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:20,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-18 20:12:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108956382] [2022-11-18 20:12:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:20,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:12:20,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:20,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:12:20,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:12:20,669 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-11-18 20:12:20,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 362 transitions, 2798 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:20,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:20,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-11-18 20:12:20,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:22,623 INFO L130 PetriNetUnfolder]: 3795/7388 cut-off events. [2022-11-18 20:12:22,624 INFO L131 PetriNetUnfolder]: For 30448/30635 co-relation queries the response was YES. [2022-11-18 20:12:22,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28368 conditions, 7388 events. 3795/7388 cut-off events. For 30448/30635 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 57617 event pairs, 556 based on Foata normal form. 138/7474 useless extension candidates. Maximal degree in co-relation 28330. Up to 1805 conditions per place. [2022-11-18 20:12:22,733 INFO L137 encePairwiseOnDemand]: 140/153 looper letters, 213 selfloop transitions, 162 changer transitions 0/487 dead transitions. [2022-11-18 20:12:22,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 487 transitions, 4463 flow [2022-11-18 20:12:22,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:12:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:12:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1271 transitions. [2022-11-18 20:12:22,742 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7551990493166963 [2022-11-18 20:12:22,742 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1271 transitions. [2022-11-18 20:12:22,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1271 transitions. [2022-11-18 20:12:22,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:22,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1271 transitions. [2022-11-18 20:12:22,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.54545454545455) internal successors, (1271), 11 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:22,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:22,752 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:22,752 INFO L175 Difference]: Start difference. First operand has 207 places, 362 transitions, 2798 flow. Second operand 11 states and 1271 transitions. [2022-11-18 20:12:22,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 487 transitions, 4463 flow [2022-11-18 20:12:23,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 487 transitions, 4387 flow, removed 37 selfloop flow, removed 1 redundant places. [2022-11-18 20:12:23,039 INFO L231 Difference]: Finished difference. Result has 221 places, 399 transitions, 3763 flow [2022-11-18 20:12:23,040 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2756, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3763, PETRI_PLACES=221, PETRI_TRANSITIONS=399} [2022-11-18 20:12:23,040 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 84 predicate places. [2022-11-18 20:12:23,041 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 399 transitions, 3763 flow [2022-11-18 20:12:23,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:23,057 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:23,057 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, 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, 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-18 20:12:23,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:23,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:12:23,262 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:23,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1084582762, now seen corresponding path program 5 times [2022-11-18 20:12:23,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:23,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650647198] [2022-11-18 20:12:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:23,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:23,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650647198] [2022-11-18 20:12:23,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650647198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:23,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522883899] [2022-11-18 20:12:23,462 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:12:23,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:23,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:23,464 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:23,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:12:23,606 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:12:23,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:12:23,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:12:23,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:23,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:12:23,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522883899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:12:23,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:12:23,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2022-11-18 20:12:23,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469172918] [2022-11-18 20:12:23,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:23,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:12:23,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:23,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:12:23,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:12:23,681 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 153 [2022-11-18 20:12:23,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 399 transitions, 3763 flow. Second operand has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:23,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:23,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 153 [2022-11-18 20:12:23,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:26,986 INFO L130 PetriNetUnfolder]: 7153/12631 cut-off events. [2022-11-18 20:12:26,987 INFO L131 PetriNetUnfolder]: For 82057/82419 co-relation queries the response was YES. [2022-11-18 20:12:27,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55769 conditions, 12631 events. 7153/12631 cut-off events. For 82057/82419 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 98133 event pairs, 1919 based on Foata normal form. 73/12639 useless extension candidates. Maximal degree in co-relation 55725. Up to 3665 conditions per place. [2022-11-18 20:12:27,120 INFO L137 encePairwiseOnDemand]: 143/153 looper letters, 586 selfloop transitions, 163 changer transitions 0/848 dead transitions. [2022-11-18 20:12:27,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 848 transitions, 10425 flow [2022-11-18 20:12:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:12:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:12:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1404 transitions. [2022-11-18 20:12:27,123 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8342245989304813 [2022-11-18 20:12:27,123 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1404 transitions. [2022-11-18 20:12:27,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1404 transitions. [2022-11-18 20:12:27,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:27,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1404 transitions. [2022-11-18 20:12:27,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 127.63636363636364) internal successors, (1404), 11 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:27,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:27,131 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:27,131 INFO L175 Difference]: Start difference. First operand has 221 places, 399 transitions, 3763 flow. Second operand 11 states and 1404 transitions. [2022-11-18 20:12:27,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 848 transitions, 10425 flow [2022-11-18 20:12:27,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 848 transitions, 10288 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-11-18 20:12:27,809 INFO L231 Difference]: Finished difference. Result has 234 places, 499 transitions, 5720 flow [2022-11-18 20:12:27,810 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3717, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5720, PETRI_PLACES=234, PETRI_TRANSITIONS=499} [2022-11-18 20:12:27,810 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 97 predicate places. [2022-11-18 20:12:27,811 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 499 transitions, 5720 flow [2022-11-18 20:12:27,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:27,811 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:27,812 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, 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, 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-18 20:12:27,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:28,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 20:12:28,017 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:28,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash -796944308, now seen corresponding path program 6 times [2022-11-18 20:12:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:28,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527682474] [2022-11-18 20:12:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:28,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:28,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527682474] [2022-11-18 20:12:28,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527682474] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:28,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477051463] [2022-11-18 20:12:28,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:12:28,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:28,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:28,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:28,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:12:28,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-18 20:12:28,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:12:28,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:12:28,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:28,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:28,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477051463] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:28,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:12:28,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-11-18 20:12:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743300237] [2022-11-18 20:12:28,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:28,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:12:28,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:28,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:12:28,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:12:28,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2022-11-18 20:12:28,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 499 transitions, 5720 flow. Second operand has 16 states, 16 states have (on average 106.5625) internal successors, (1705), 16 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:28,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:28,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2022-11-18 20:12:28,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:33,287 INFO L130 PetriNetUnfolder]: 7401/13500 cut-off events. [2022-11-18 20:12:33,288 INFO L131 PetriNetUnfolder]: For 102198/102507 co-relation queries the response was YES. [2022-11-18 20:12:33,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61619 conditions, 13500 events. 7401/13500 cut-off events. For 102198/102507 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 108958 event pairs, 783 based on Foata normal form. 49/13457 useless extension candidates. Maximal degree in co-relation 61567. Up to 1519 conditions per place. [2022-11-18 20:12:33,406 INFO L137 encePairwiseOnDemand]: 136/153 looper letters, 319 selfloop transitions, 426 changer transitions 0/831 dead transitions. [2022-11-18 20:12:33,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 831 transitions, 10189 flow [2022-11-18 20:12:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:12:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-18 20:12:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2739 transitions. [2022-11-18 20:12:33,417 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7459150326797386 [2022-11-18 20:12:33,417 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2739 transitions. [2022-11-18 20:12:33,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2739 transitions. [2022-11-18 20:12:33,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:33,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2739 transitions. [2022-11-18 20:12:33,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 114.125) internal successors, (2739), 24 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:33,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:33,438 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:33,439 INFO L175 Difference]: Start difference. First operand has 234 places, 499 transitions, 5720 flow. Second operand 24 states and 2739 transitions. [2022-11-18 20:12:33,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 831 transitions, 10189 flow [2022-11-18 20:12:34,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 831 transitions, 9987 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-11-18 20:12:34,063 INFO L231 Difference]: Finished difference. Result has 269 places, 642 transitions, 8976 flow [2022-11-18 20:12:34,064 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=5648, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8976, PETRI_PLACES=269, PETRI_TRANSITIONS=642} [2022-11-18 20:12:34,064 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 132 predicate places. [2022-11-18 20:12:34,065 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 642 transitions, 8976 flow [2022-11-18 20:12:34,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 106.5625) internal successors, (1705), 16 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:34,066 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:34,066 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, 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, 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-18 20:12:34,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:34,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:12:34,271 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:34,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:34,272 INFO L85 PathProgramCache]: Analyzing trace with hash -892807730, now seen corresponding path program 7 times [2022-11-18 20:12:34,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:34,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326653] [2022-11-18 20:12:34,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:34,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:34,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:34,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326653] [2022-11-18 20:12:34,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326653] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:34,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388960176] [2022-11-18 20:12:34,470 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:12:34,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:34,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:34,475 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:34,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:12:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:34,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:12:34,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:34,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:35,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388960176] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:35,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:35,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2022-11-18 20:12:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894077436] [2022-11-18 20:12:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:35,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:12:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:12:35,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:12:35,115 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-11-18 20:12:35,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 642 transitions, 8976 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:35,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:35,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-11-18 20:12:35,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:38,119 INFO L130 PetriNetUnfolder]: 5407/10740 cut-off events. [2022-11-18 20:12:38,119 INFO L131 PetriNetUnfolder]: For 99474/99901 co-relation queries the response was YES. [2022-11-18 20:12:38,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51368 conditions, 10740 events. 5407/10740 cut-off events. For 99474/99901 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 91543 event pairs, 805 based on Foata normal form. 49/10738 useless extension candidates. Maximal degree in co-relation 51303. Up to 3703 conditions per place. [2022-11-18 20:12:38,228 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 211 selfloop transitions, 300 changer transitions 0/700 dead transitions. [2022-11-18 20:12:38,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 700 transitions, 10460 flow [2022-11-18 20:12:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:12:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:12:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1146 transitions. [2022-11-18 20:12:38,231 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7490196078431373 [2022-11-18 20:12:38,231 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1146 transitions. [2022-11-18 20:12:38,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1146 transitions. [2022-11-18 20:12:38,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:38,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1146 transitions. [2022-11-18 20:12:38,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:38,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:38,239 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:38,239 INFO L175 Difference]: Start difference. First operand has 269 places, 642 transitions, 8976 flow. Second operand 10 states and 1146 transitions. [2022-11-18 20:12:38,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 700 transitions, 10460 flow [2022-11-18 20:12:39,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 700 transitions, 10253 flow, removed 99 selfloop flow, removed 5 redundant places. [2022-11-18 20:12:39,156 INFO L231 Difference]: Finished difference. Result has 276 places, 657 transitions, 10040 flow [2022-11-18 20:12:39,157 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=8762, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10040, PETRI_PLACES=276, PETRI_TRANSITIONS=657} [2022-11-18 20:12:39,157 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 139 predicate places. [2022-11-18 20:12:39,157 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 657 transitions, 10040 flow [2022-11-18 20:12:39,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:39,158 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:39,158 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, 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, 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-18 20:12:39,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-18 20:12:39,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:12:39,363 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:39,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:39,364 INFO L85 PathProgramCache]: Analyzing trace with hash -860730632, now seen corresponding path program 8 times [2022-11-18 20:12:39,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:39,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744458107] [2022-11-18 20:12:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:39,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:39,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:39,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744458107] [2022-11-18 20:12:39,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744458107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:39,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810812471] [2022-11-18 20:12:39,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:12:39,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:39,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:39,555 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:39,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:12:39,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:12:39,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:12:39,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:12:39,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:39,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:40,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810812471] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:40,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:40,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-18 20:12:40,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29042546] [2022-11-18 20:12:40,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:40,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:12:40,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:40,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:12:40,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:12:40,094 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-11-18 20:12:40,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 657 transitions, 10040 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:40,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:40,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-11-18 20:12:40,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:43,340 INFO L130 PetriNetUnfolder]: 5421/10632 cut-off events. [2022-11-18 20:12:43,340 INFO L131 PetriNetUnfolder]: For 117083/117529 co-relation queries the response was YES. [2022-11-18 20:12:43,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54297 conditions, 10632 events. 5421/10632 cut-off events. For 117083/117529 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 90018 event pairs, 874 based on Foata normal form. 65/10638 useless extension candidates. Maximal degree in co-relation 54229. Up to 2823 conditions per place. [2022-11-18 20:12:43,455 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 210 selfloop transitions, 306 changer transitions 0/704 dead transitions. [2022-11-18 20:12:43,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 704 transitions, 11323 flow [2022-11-18 20:12:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:12:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:12:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2022-11-18 20:12:43,458 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.744503862150921 [2022-11-18 20:12:43,458 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2022-11-18 20:12:43,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2022-11-18 20:12:43,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:43,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2022-11-18 20:12:43,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.9090909090909) internal successors, (1253), 11 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:43,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:43,464 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:43,464 INFO L175 Difference]: Start difference. First operand has 276 places, 657 transitions, 10040 flow. Second operand 11 states and 1253 transitions. [2022-11-18 20:12:43,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 704 transitions, 11323 flow [2022-11-18 20:12:44,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 704 transitions, 11265 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-11-18 20:12:44,381 INFO L231 Difference]: Finished difference. Result has 283 places, 656 transitions, 10721 flow [2022-11-18 20:12:44,382 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=9932, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10721, PETRI_PLACES=283, PETRI_TRANSITIONS=656} [2022-11-18 20:12:44,382 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 146 predicate places. [2022-11-18 20:12:44,383 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 656 transitions, 10721 flow [2022-11-18 20:12:44,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:44,383 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:44,383 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, 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, 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, 1, 1, 1, 1] [2022-11-18 20:12:44,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-18 20:12:44,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:12:44,584 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:12:44,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash -492088392, now seen corresponding path program 1 times [2022-11-18 20:12:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:44,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105565815] [2022-11-18 20:12:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:46,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105565815] [2022-11-18 20:12:46,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105565815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:46,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482728940] [2022-11-18 20:12:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:46,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:46,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:46,507 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:46,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:12:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:46,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-18 20:12:46,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:47,224 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-18 20:12:47,652 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 6 treesize of output 5 [2022-11-18 20:12:47,770 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 6 treesize of output 5 [2022-11-18 20:12:47,858 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 6 treesize of output 5 [2022-11-18 20:12:48,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:12:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:48,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:12:48,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482728940] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:48,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:12:48,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 9] total 38 [2022-11-18 20:12:48,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858327196] [2022-11-18 20:12:48,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:48,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-18 20:12:48,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:48,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-18 20:12:48,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2022-11-18 20:12:48,737 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 153 [2022-11-18 20:12:48,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 656 transitions, 10721 flow. Second operand has 38 states, 38 states have (on average 71.8157894736842) internal successors, (2729), 38 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:48,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:12:48,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 153 [2022-11-18 20:12:48,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:58,143 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L68-->L70: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~res2~0_57) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0) 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (= v_~res2~0_58 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (= (select (select |v_#memory_int_51| v_~A~0.base_40) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_40)) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|))) InVars {#memory_int=|v_#memory_int_51|, ~A~0.base=v_~A~0.base_40, ~A~0.offset=v_~A~0.offset_40, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, ~res2~0=v_~res2~0_58} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_40, thread3Thread1of1ForFork1_#t~ret9#1=|v_thread3Thread1of1ForFork1_#t~ret9#1_1|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~A~0.offset=v_~A~0.offset_40, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, #memory_int=|v_#memory_int_51|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_1|, ~res2~0=v_~res2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret9#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~mem8#1, ~res2~0][389], [154#true, Black: 3215#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3209#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3202#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0))), Black: 3204#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 2491#(<= 1 ~M~0), Black: 3200#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 6578#true, Black: 3207#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), Black: 3213#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3211#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~M~0)), Black: 2950#(or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)), Black: 164#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 97#L70true, Black: 6570#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1771#(<= 1 ~N~0), Black: 6574#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 4324#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 1745#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 3198#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 183#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 980#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 157#true, 5842#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1725#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1739#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5840#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1719#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5838#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1731#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1715#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1741#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 974#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 978#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 972#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1709#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 966#(and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1721#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1727#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 3955#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 1735#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1711#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1717#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 6572#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~M~0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)), 5099#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 36#L90-2true, Black: 5091#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5079#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5073#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5093#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5085#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 17#L57-2true, Black: 4231#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 4335#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5077#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5087#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4329#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5064#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5083#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3233#(<= 1 ~N~0), Black: 4333#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3968#(<= 1 ~N~0), Black: 5075#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0)), Black: 4327#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5095#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5066#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4331#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5081#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5089#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-18 20:12:58,144 INFO L383 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-11-18 20:12:58,145 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-18 20:12:58,145 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-18 20:12:58,145 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-18 20:12:58,218 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L57-2-->L57-3: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_11| (+ |v_thread2Thread1of1ForFork0_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1][1221], [154#true, Black: 3215#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3209#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3202#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0))), Black: 3204#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 2491#(<= 1 ~M~0), Black: 3200#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 6578#true, Black: 3207#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), Black: 3213#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3211#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~M~0)), 5838#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 2950#(or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)), Black: 164#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 43#L57-3true, Black: 6570#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1771#(<= 1 ~N~0), Black: 6574#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 4324#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 2936#(or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0)), Black: 183#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 157#true, Black: 1733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1725#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5842#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1739#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5840#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1719#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1731#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1715#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 980#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1741#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 974#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 978#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), 22#L68true, Black: 972#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1709#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 6568#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~M~0)) (<= 1 ~N~0)), Black: 966#(and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1721#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1745#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1727#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1735#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1717#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 5099#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 36#L90-2true, Black: 5091#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5079#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5073#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5093#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4231#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5085#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4335#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5077#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5087#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5064#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4329#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5083#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4333#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3233#(<= 1 ~N~0), Black: 3968#(<= 1 ~N~0), Black: 3951#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0)), Black: 5075#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4327#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5095#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3955#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 4331#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5066#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5081#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5089#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 1711#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-18 20:12:58,219 INFO L383 tUnfolder$Statistics]: this new event has 107 ancestors and is not cut-off event [2022-11-18 20:12:58,219 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-11-18 20:12:58,219 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-11-18 20:12:58,219 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-11-18 20:12:58,313 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L68-->L70: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~res2~0_57) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0) 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (= v_~res2~0_58 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (= (select (select |v_#memory_int_51| v_~A~0.base_40) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_40)) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|))) InVars {#memory_int=|v_#memory_int_51|, ~A~0.base=v_~A~0.base_40, ~A~0.offset=v_~A~0.offset_40, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, ~res2~0=v_~res2~0_58} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_40, thread3Thread1of1ForFork1_#t~ret9#1=|v_thread3Thread1of1ForFork1_#t~ret9#1_1|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~A~0.offset=v_~A~0.offset_40, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, #memory_int=|v_#memory_int_51|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_1|, ~res2~0=v_~res2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret9#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~mem8#1, ~res2~0][389], [154#true, Black: 3215#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3209#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3202#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0))), Black: 3204#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 2491#(<= 1 ~M~0), Black: 3200#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 6578#true, Black: 3207#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 39#L91-1true, Black: 3213#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3211#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~M~0)), Black: 2950#(or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)), Black: 164#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 97#L70true, Black: 6570#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1771#(<= 1 ~N~0), Black: 6574#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 4324#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 1745#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 3198#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 183#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 980#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 157#true, 5842#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1725#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1739#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5840#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1719#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5838#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1731#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1715#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1741#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 974#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 978#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 972#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1709#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 966#(and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1721#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1727#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 3955#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 1735#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1711#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1717#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 6572#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~M~0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)), 5099#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5091#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5079#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5073#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5093#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5085#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 17#L57-2true, Black: 4231#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 4335#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5077#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5087#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4329#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5064#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5083#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3233#(<= 1 ~N~0), Black: 4333#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3968#(<= 1 ~N~0), Black: 5075#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0)), Black: 4327#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5095#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5066#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4331#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5081#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5089#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-18 20:12:58,313 INFO L383 tUnfolder$Statistics]: this new event has 109 ancestors and is cut-off event [2022-11-18 20:12:58,313 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-18 20:12:58,313 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-18 20:12:58,313 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-18 20:12:58,385 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L57-2-->L57-3: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_11| (+ |v_thread2Thread1of1ForFork0_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1][1221], [154#true, Black: 3215#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3209#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3202#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0))), Black: 3204#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 2491#(<= 1 ~M~0), Black: 3200#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 6578#true, Black: 3207#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 39#L91-1true, Black: 3213#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3211#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~M~0)), 5838#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 2950#(or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)), Black: 164#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 43#L57-3true, Black: 6570#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1771#(<= 1 ~N~0), Black: 6574#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 4324#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 2936#(or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0)), Black: 183#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 157#true, Black: 1733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1725#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5842#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1739#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5840#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1719#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1731#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1715#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 980#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1741#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 974#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 978#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), 22#L68true, Black: 972#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1709#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 966#(and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 6568#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~M~0)) (<= 1 ~N~0)), Black: 1721#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1745#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1727#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1735#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1717#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 5099#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5091#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5079#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5073#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5093#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4231#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5085#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4335#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5077#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5087#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5064#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4329#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5083#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4333#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3233#(<= 1 ~N~0), Black: 3968#(<= 1 ~N~0), Black: 3951#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0)), Black: 5075#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4327#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5095#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3955#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 4331#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5066#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5081#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5089#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 1711#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-18 20:12:58,386 INFO L383 tUnfolder$Statistics]: this new event has 109 ancestors and is not cut-off event [2022-11-18 20:12:58,386 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is not cut-off event [2022-11-18 20:12:58,386 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is not cut-off event [2022-11-18 20:12:58,386 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is not cut-off event [2022-11-18 20:12:58,644 INFO L130 PetriNetUnfolder]: 14729/27266 cut-off events. [2022-11-18 20:12:58,644 INFO L131 PetriNetUnfolder]: For 342953/344772 co-relation queries the response was YES. [2022-11-18 20:12:59,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138949 conditions, 27266 events. 14729/27266 cut-off events. For 342953/344772 co-relation queries the response was YES. Maximal size of possible extension queue 1603. Compared 257933 event pairs, 1925 based on Foata normal form. 609/27360 useless extension candidates. Maximal degree in co-relation 138880. Up to 13305 conditions per place. [2022-11-18 20:12:59,251 INFO L137 encePairwiseOnDemand]: 127/153 looper letters, 790 selfloop transitions, 226 changer transitions 4/1266 dead transitions. [2022-11-18 20:12:59,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 1266 transitions, 22428 flow [2022-11-18 20:12:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 20:12:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-11-18 20:12:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2115 transitions. [2022-11-18 20:12:59,256 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49369747899159666 [2022-11-18 20:12:59,256 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2115 transitions. [2022-11-18 20:12:59,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2115 transitions. [2022-11-18 20:12:59,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:59,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2115 transitions. [2022-11-18 20:12:59,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 75.53571428571429) internal successors, (2115), 28 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:59,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 153.0) internal successors, (4437), 29 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:59,267 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 153.0) internal successors, (4437), 29 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:59,267 INFO L175 Difference]: Start difference. First operand has 283 places, 656 transitions, 10721 flow. Second operand 28 states and 2115 transitions. [2022-11-18 20:12:59,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 1266 transitions, 22428 flow [2022-11-18 20:13:04,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1266 transitions, 21996 flow, removed 22 selfloop flow, removed 7 redundant places. [2022-11-18 20:13:04,210 INFO L231 Difference]: Finished difference. Result has 315 places, 862 transitions, 15027 flow [2022-11-18 20:13:04,211 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=10464, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=15027, PETRI_PLACES=315, PETRI_TRANSITIONS=862} [2022-11-18 20:13:04,211 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 178 predicate places. [2022-11-18 20:13:04,211 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 862 transitions, 15027 flow [2022-11-18 20:13:04,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 71.8157894736842) internal successors, (2729), 38 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:04,212 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:13:04,212 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, 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, 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, 1, 1, 1, 1] [2022-11-18 20:13:04,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:04,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:13:04,418 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:13:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1828263944, now seen corresponding path program 1 times [2022-11-18 20:13:04,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:04,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682281342] [2022-11-18 20:13:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:04,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:06,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:06,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682281342] [2022-11-18 20:13:06,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682281342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:06,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037998767] [2022-11-18 20:13:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:06,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:06,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:06,781 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:06,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:13:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:06,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-18 20:13:06,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:06,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-18 20:13:07,023 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:13:07,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-18 20:13:07,103 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:13:07,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-18 20:13:07,814 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:13:07,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-11-18 20:13:08,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 20:13:08,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:13:09,149 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 6 treesize of output 5 [2022-11-18 20:13:09,306 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 6 treesize of output 5 [2022-11-18 20:13:09,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:09,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2022-11-18 20:13:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:09,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:11,154 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) c_~A~0.base))) (< (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 .cse1) c_~res1~0 1))))) (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) c_~A~0.base))) (<= (+ (select .cse2 .cse1) c_~res1~0) (+ c_~res2~0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4)))))) (not (< ~M~0 c_~N~0)))))) is different from false [2022-11-18 20:13:11,660 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) c_~A~0.base))) (<= (+ c_~res1~0 (select .cse0 c_~A~0.offset)) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) c_~A~0.base))) (< (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse1 c_~A~0.offset) 1))) (not (< ~M~0 c_~N~0))))) is different from false [2022-11-18 20:13:12,274 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (< (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1))))) (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (<= (+ c_~res1~0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select .cse1 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) is different from false [2022-11-18 20:13:16,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:16,342 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2022-11-18 20:13:16,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:16,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 838 treesize of output 800 [2022-11-18 20:13:16,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:16,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 790 treesize of output 736 [2022-11-18 20:13:16,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:16,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 363 treesize of output 342 [2022-11-18 20:13:16,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:16,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 694 treesize of output 576 [2022-11-18 20:13:17,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:17,070 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-11-18 20:13:17,084 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:13:17,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 186 [2022-11-18 20:13:17,100 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:13:17,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 166 [2022-11-18 20:13:17,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:17,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2022-11-18 20:13:17,124 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:13:17,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 114 [2022-11-18 20:13:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:20,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037998767] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:20,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:20,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 30] total 78 [2022-11-18 20:13:20,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360039869] [2022-11-18 20:13:20,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:20,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-18 20:13:20,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:20,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-18 20:13:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=768, Invalid=4728, Unknown=66, NotChecked=444, Total=6006 [2022-11-18 20:13:20,495 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 153 [2022-11-18 20:13:20,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 862 transitions, 15027 flow. Second operand has 78 states, 78 states have (on average 61.32051282051282) internal successors, (4783), 78 states have internal predecessors, (4783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:20,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:13:20,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 153 [2022-11-18 20:13:20,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:13:45,415 INFO L130 PetriNetUnfolder]: 23844/45588 cut-off events. [2022-11-18 20:13:45,415 INFO L131 PetriNetUnfolder]: For 575961/578026 co-relation queries the response was YES. [2022-11-18 20:13:46,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236962 conditions, 45588 events. 23844/45588 cut-off events. For 575961/578026 co-relation queries the response was YES. Maximal size of possible extension queue 2885. Compared 479463 event pairs, 3258 based on Foata normal form. 752/45899 useless extension candidates. Maximal degree in co-relation 236881. Up to 18713 conditions per place. [2022-11-18 20:13:46,512 INFO L137 encePairwiseOnDemand]: 113/153 looper letters, 1169 selfloop transitions, 627 changer transitions 6/2089 dead transitions. [2022-11-18 20:13:46,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 2089 transitions, 38146 flow [2022-11-18 20:13:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-18 20:13:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-11-18 20:13:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 3487 transitions. [2022-11-18 20:13:46,519 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4300160315698606 [2022-11-18 20:13:46,519 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 3487 transitions. [2022-11-18 20:13:46,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 3487 transitions. [2022-11-18 20:13:46,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:13:46,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 3487 transitions. [2022-11-18 20:13:46,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 65.79245283018868) internal successors, (3487), 53 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:46,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 153.0) internal successors, (8262), 54 states have internal predecessors, (8262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:46,544 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 153.0) internal successors, (8262), 54 states have internal predecessors, (8262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:46,545 INFO L175 Difference]: Start difference. First operand has 315 places, 862 transitions, 15027 flow. Second operand 53 states and 3487 transitions. [2022-11-18 20:13:46,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 2089 transitions, 38146 flow [2022-11-18 20:14:02,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 2089 transitions, 37707 flow, removed 106 selfloop flow, removed 17 redundant places. [2022-11-18 20:14:02,303 INFO L231 Difference]: Finished difference. Result has 375 places, 1482 transitions, 27959 flow [2022-11-18 20:14:02,304 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=14914, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=27959, PETRI_PLACES=375, PETRI_TRANSITIONS=1482} [2022-11-18 20:14:02,305 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 238 predicate places. [2022-11-18 20:14:02,305 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 1482 transitions, 27959 flow [2022-11-18 20:14:02,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 61.32051282051282) internal successors, (4783), 78 states have internal predecessors, (4783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:02,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:14:02,307 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, 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, 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, 1, 1, 1, 1] [2022-11-18 20:14:02,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:02,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:14:02,513 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:14:02,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1831661448, now seen corresponding path program 2 times [2022-11-18 20:14:02,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:02,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225901278] [2022-11-18 20:14:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:14:03,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:03,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225901278] [2022-11-18 20:14:03,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225901278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:03,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125847488] [2022-11-18 20:14:03,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:14:03,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:03,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:03,787 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:03,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ff7158-537c-49f6-966b-f8b4fdec897e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:14:03,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:14:03,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:14:03,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-18 20:14:03,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:04,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:04,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:14:04,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:04,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:14:05,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-18 20:14:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:14:05,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:05,376 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_469 (Array Int Int))) (<= c_~res1~0 (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_469) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_469 (Array Int Int))) (< (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_469) c_~A~0.base) c_~A~0.offset)) (+ c_~res1~0 1)))) is different from false [2022-11-18 20:14:05,418 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 (Array Int Int))) (<= c_~res1~0 (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_469) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 (Array Int Int))) (< (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_469) c_~A~0.base) c_~A~0.offset)) (+ c_~res1~0 1)))) is different from false [2022-11-18 20:14:05,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:05,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 148 [2022-11-18 20:14:05,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2022-11-18 20:14:05,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-11-18 20:14:05,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:14:05,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:14:05,522 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:14:05,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-11-18 20:14:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:14:06,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125847488] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:14:06,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:14:06,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 18] total 40 [2022-11-18 20:14:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981836255] [2022-11-18 20:14:06,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:06,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-18 20:14:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 20:14:06,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1238, Unknown=2, NotChecked=146, Total=1560 [2022-11-18 20:14:06,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 153 [2022-11-18 20:14:06,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 1482 transitions, 27959 flow. Second operand has 40 states, 40 states have (on average 78.075) internal successors, (3123), 40 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:06,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:14:06,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 153 [2022-11-18 20:14:06,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand