./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:31:56,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:31:56,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:31:56,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:31:56,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:31:56,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:31:56,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:31:56,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:31:56,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:31:56,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:31:56,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:31:56,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:31:56,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:31:56,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:31:56,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:31:56,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:31:56,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:31:56,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:31:56,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:31:56,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:31:56,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:31:56,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:31:56,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:31:56,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:31:56,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:31:56,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:31:56,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:31:56,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:31:56,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:31:56,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:31:56,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:31:56,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:31:56,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:31:56,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:31:56,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:31:56,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:31:56,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:31:56,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:31:56,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:31:56,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:31:56,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:31:56,885 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:31:56,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:31:56,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:31:56,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:31:56,907 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:31:56,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:31:56,908 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:31:56,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:31:56,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:31:56,909 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:31:56,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:31:56,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:31:56,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:31:56,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:31:56,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:31:56,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:31:56,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:31:56,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:31:56,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:31:56,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:31:56,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:31:56,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:31:56,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:31:56,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:31:56,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:31:56,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:31:56,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:31:56,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:31:56,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:31:56,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:31:56,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:31:56,915 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:31:56,915 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:31:56,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:31:56,916 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_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f [2022-11-16 12:31:57,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:31:57,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:31:57,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:31:57,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:31:57,281 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:31:57,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-11-16 12:31:57,352 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/data/18fa6258c/8265cbf6e89945f3ab1498ada88f5b69/FLAGc4a457c6a [2022-11-16 12:31:57,872 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:31:57,873 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-11-16 12:31:57,888 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/data/18fa6258c/8265cbf6e89945f3ab1498ada88f5b69/FLAGc4a457c6a [2022-11-16 12:31:58,246 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/data/18fa6258c/8265cbf6e89945f3ab1498ada88f5b69 [2022-11-16 12:31:58,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:31:58,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:31:58,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:31:58,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:31:58,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:31:58,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703fda09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58, skipping insertion in model container [2022-11-16 12:31:58,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:31:58,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:31:58,536 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-11-16 12:31:58,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:31:58,554 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:31:58,577 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-11-16 12:31:58,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:31:58,596 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:31:58,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58 WrapperNode [2022-11-16 12:31:58,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:31:58,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:31:58,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:31:58,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:31:58,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,644 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 271 [2022-11-16 12:31:58,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:31:58,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:31:58,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:31:58,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:31:58,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,680 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:31:58,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:31:58,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:31:58,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:31:58,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (1/1) ... [2022-11-16 12:31:58,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:31:58,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:31:58,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:31:58,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:31:58,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:31:58,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:31:58,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:31:58,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:31:58,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 12:31:58,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 12:31:58,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 12:31:58,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 12:31:58,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 12:31:58,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 12:31:58,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:31:58,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:31:58,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:31:58,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:31:58,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:31:58,765 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:31:58,880 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:31:58,896 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:31:59,502 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:31:59,530 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:31:59,530 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-16 12:31:59,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:59 BoogieIcfgContainer [2022-11-16 12:31:59,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:31:59,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:31:59,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:31:59,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:31:59,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:31:58" (1/3) ... [2022-11-16 12:31:59,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708d65f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:31:59, skipping insertion in model container [2022-11-16 12:31:59,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:58" (2/3) ... [2022-11-16 12:31:59,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708d65f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:31:59, skipping insertion in model container [2022-11-16 12:31:59,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:59" (3/3) ... [2022-11-16 12:31:59,564 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2022-11-16 12:31:59,573 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:31:59,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:31:59,582 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:31:59,582 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:31:59,706 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 12:31:59,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 349 places, 368 transitions, 760 flow [2022-11-16 12:31:59,968 INFO L130 PetriNetUnfolder]: 29/365 cut-off events. [2022-11-16 12:31:59,969 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 12:31:59,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 365 events. 29/365 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 516 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 239. Up to 2 conditions per place. [2022-11-16 12:31:59,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 349 places, 368 transitions, 760 flow [2022-11-16 12:31:59,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 354 transitions, 726 flow [2022-11-16 12:32:00,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:32:00,007 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;@91ad328, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:32:00,007 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 12:32:00,100 INFO L130 PetriNetUnfolder]: 28/347 cut-off events. [2022-11-16 12:32:00,100 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 12:32:00,101 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:00,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:00,102 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-16 12:32:00,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:00,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1395151076, now seen corresponding path program 1 times [2022-11-16 12:32:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:00,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17509471] [2022-11-16 12:32:00,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:00,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:32:00,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:00,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17509471] [2022-11-16 12:32:00,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17509471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:00,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:00,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:32:00,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665875727] [2022-11-16 12:32:00,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:00,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:32:00,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:00,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:32:00,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:32:00,610 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 368 [2022-11-16 12:32:00,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 354 transitions, 726 flow. Second operand has 2 states, 2 states have (on average 344.0) internal successors, (688), 2 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:00,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:00,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 368 [2022-11-16 12:32:00,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:00,730 INFO L130 PetriNetUnfolder]: 6/331 cut-off events. [2022-11-16 12:32:00,730 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-16 12:32:00,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 331 events. 6/331 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 472 event pairs, 0 based on Foata normal form. 29/337 useless extension candidates. Maximal degree in co-relation 226. Up to 7 conditions per place. [2022-11-16 12:32:00,739 INFO L137 encePairwiseOnDemand]: 345/368 looper letters, 6 selfloop transitions, 0 changer transitions 9/331 dead transitions. [2022-11-16 12:32:00,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 331 transitions, 692 flow [2022-11-16 12:32:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:32:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:32:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 705 transitions. [2022-11-16 12:32:00,765 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9578804347826086 [2022-11-16 12:32:00,766 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 705 transitions. [2022-11-16 12:32:00,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 705 transitions. [2022-11-16 12:32:00,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:00,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 705 transitions. [2022-11-16 12:32:00,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 352.5) internal successors, (705), 2 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:00,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:00,792 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:00,795 INFO L175 Difference]: Start difference. First operand has 335 places, 354 transitions, 726 flow. Second operand 2 states and 705 transitions. [2022-11-16 12:32:00,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 331 transitions, 692 flow [2022-11-16 12:32:00,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 331 transitions, 680 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-16 12:32:00,838 INFO L231 Difference]: Finished difference. Result has 330 places, 322 transitions, 650 flow [2022-11-16 12:32:00,841 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=650, PETRI_PLACES=330, PETRI_TRANSITIONS=322} [2022-11-16 12:32:00,848 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, -5 predicate places. [2022-11-16 12:32:00,848 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 322 transitions, 650 flow [2022-11-16 12:32:00,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 344.0) internal successors, (688), 2 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:00,849 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:00,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:00,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:32:00,851 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-16 12:32:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash -651043350, now seen corresponding path program 1 times [2022-11-16 12:32:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:00,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713900664] [2022-11-16 12:32:00,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:00,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:32:02,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:02,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713900664] [2022-11-16 12:32:02,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713900664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:02,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:02,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:32:02,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941708872] [2022-11-16 12:32:02,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:02,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:32:02,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:02,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:32:02,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:32:02,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 368 [2022-11-16 12:32:02,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 322 transitions, 650 flow. Second operand has 12 states, 12 states have (on average 278.5833333333333) internal successors, (3343), 12 states have internal predecessors, (3343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:02,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:02,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 368 [2022-11-16 12:32:02,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:03,273 INFO L130 PetriNetUnfolder]: 186/2285 cut-off events. [2022-11-16 12:32:03,273 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-16 12:32:03,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2696 conditions, 2285 events. 186/2285 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15906 event pairs, 20 based on Foata normal form. 1/2116 useless extension candidates. Maximal degree in co-relation 2693. Up to 131 conditions per place. [2022-11-16 12:32:03,294 INFO L137 encePairwiseOnDemand]: 354/368 looper letters, 123 selfloop transitions, 9 changer transitions 20/413 dead transitions. [2022-11-16 12:32:03,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 413 transitions, 1148 flow [2022-11-16 12:32:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:32:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 12:32:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3441 transitions. [2022-11-16 12:32:03,302 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7792119565217391 [2022-11-16 12:32:03,303 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3441 transitions. [2022-11-16 12:32:03,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3441 transitions. [2022-11-16 12:32:03,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:03,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3441 transitions. [2022-11-16 12:32:03,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 286.75) internal successors, (3441), 12 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:03,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 368.0) internal successors, (4784), 13 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:03,325 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 368.0) internal successors, (4784), 13 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:03,325 INFO L175 Difference]: Start difference. First operand has 330 places, 322 transitions, 650 flow. Second operand 12 states and 3441 transitions. [2022-11-16 12:32:03,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 413 transitions, 1148 flow [2022-11-16 12:32:03,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 413 transitions, 1148 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:32:03,337 INFO L231 Difference]: Finished difference. Result has 341 places, 328 transitions, 713 flow [2022-11-16 12:32:03,337 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=713, PETRI_PLACES=341, PETRI_TRANSITIONS=328} [2022-11-16 12:32:03,338 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 6 predicate places. [2022-11-16 12:32:03,339 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 328 transitions, 713 flow [2022-11-16 12:32:03,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 278.5833333333333) internal successors, (3343), 12 states have internal predecessors, (3343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:03,341 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:03,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:03,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:32:03,342 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-16 12:32:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash 998929400, now seen corresponding path program 1 times [2022-11-16 12:32:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:03,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954805492] [2022-11-16 12:32:03,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:03,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:03,705 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-16 12:32:03,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:03,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954805492] [2022-11-16 12:32:03,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954805492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:03,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:03,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:32:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915141576] [2022-11-16 12:32:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:03,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:32:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:03,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:32:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:32:03,712 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-11-16 12:32:03,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 328 transitions, 713 flow. Second operand has 7 states, 7 states have (on average 295.7142857142857) internal successors, (2070), 7 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:03,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:03,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-11-16 12:32:03,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:05,474 INFO L130 PetriNetUnfolder]: 1004/6337 cut-off events. [2022-11-16 12:32:05,474 INFO L131 PetriNetUnfolder]: For 166/167 co-relation queries the response was YES. [2022-11-16 12:32:05,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8256 conditions, 6337 events. 1004/6337 cut-off events. For 166/167 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 54466 event pairs, 413 based on Foata normal form. 1/5394 useless extension candidates. Maximal degree in co-relation 8243. Up to 875 conditions per place. [2022-11-16 12:32:05,540 INFO L137 encePairwiseOnDemand]: 349/368 looper letters, 113 selfloop transitions, 28 changer transitions 0/415 dead transitions. [2022-11-16 12:32:05,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 415 transitions, 1185 flow [2022-11-16 12:32:05,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:32:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 12:32:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3333 transitions. [2022-11-16 12:32:05,550 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8233695652173914 [2022-11-16 12:32:05,551 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3333 transitions. [2022-11-16 12:32:05,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3333 transitions. [2022-11-16 12:32:05,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:05,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3333 transitions. [2022-11-16 12:32:05,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:05,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:05,573 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:05,573 INFO L175 Difference]: Start difference. First operand has 341 places, 328 transitions, 713 flow. Second operand 11 states and 3333 transitions. [2022-11-16 12:32:05,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 415 transitions, 1185 flow [2022-11-16 12:32:05,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 415 transitions, 1171 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-11-16 12:32:05,583 INFO L231 Difference]: Finished difference. Result has 341 places, 345 transitions, 832 flow [2022-11-16 12:32:05,584 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=832, PETRI_PLACES=341, PETRI_TRANSITIONS=345} [2022-11-16 12:32:05,584 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 6 predicate places. [2022-11-16 12:32:05,585 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 345 transitions, 832 flow [2022-11-16 12:32:05,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 295.7142857142857) internal successors, (2070), 7 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:05,586 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:05,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:32:05,587 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-16 12:32:05,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:05,587 INFO L85 PathProgramCache]: Analyzing trace with hash -880059400, now seen corresponding path program 1 times [2022-11-16 12:32:05,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:05,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103160415] [2022-11-16 12:32:05,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:05,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:05,955 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-16 12:32:05,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:05,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103160415] [2022-11-16 12:32:05,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103160415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:05,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:05,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:32:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35692858] [2022-11-16 12:32:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:05,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:32:05,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:05,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:32:05,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:32:05,961 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-11-16 12:32:05,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 345 transitions, 832 flow. Second operand has 7 states, 7 states have (on average 295.7142857142857) internal successors, (2070), 7 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:05,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:05,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-11-16 12:32:05,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:07,478 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][287], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, 252#L66-6true, 101#L51true, 67#L58-6true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,479 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:07,479 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,479 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:07,480 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][288], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 352#true, 101#L51true, 67#L58-6true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,480 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:07,480 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,481 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:07,481 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,482 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][287], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, 84#L59true, 252#L66-6true, 101#L51true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,482 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:07,482 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,483 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:07,483 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,483 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][288], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 352#true, 84#L59true, 101#L51true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,483 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:07,484 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,484 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:07,484 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,485 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][287], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, 252#L66-6true, 67#L58-6true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#L50-6true]) [2022-11-16 12:32:07,486 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:07,486 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,486 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:07,486 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,487 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][288], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 352#true, 67#L58-6true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#L50-6true]) [2022-11-16 12:32:07,487 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:07,487 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,487 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:07,487 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,489 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][287], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, 84#L59true, 252#L66-6true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#L50-6true]) [2022-11-16 12:32:07,489 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:07,489 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,490 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,490 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:07,490 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][288], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 352#true, 84#L59true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#L50-6true]) [2022-11-16 12:32:07,490 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:07,491 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:07,491 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,491 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:07,494 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][287], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 172#L59-1true, 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, 252#L66-6true, 101#L51true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,494 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-16 12:32:07,495 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 12:32:07,495 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:07,495 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:07,495 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][288], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 172#L59-1true, 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 352#true, 101#L51true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,496 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-16 12:32:07,496 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 12:32:07,496 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:07,496 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:07,497 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][287], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 172#L59-1true, 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, 252#L66-6true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#L50-6true]) [2022-11-16 12:32:07,498 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-16 12:32:07,498 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:07,498 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:07,498 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 12:32:07,499 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][288], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 172#L59-1true, 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 352#true, 230#L85-4true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#L50-6true]) [2022-11-16 12:32:07,499 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-16 12:32:07,499 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:07,499 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:07,499 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 12:32:07,513 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][287], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 170#L86-2true, 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, 252#L66-6true, 67#L58-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,513 INFO L383 tUnfolder$Statistics]: this new event has 273 ancestors and is cut-off event [2022-11-16 12:32:07,513 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 12:32:07,513 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 12:32:07,514 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 12:32:07,514 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][288], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 170#L86-2true, 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 352#true, 67#L58-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,514 INFO L383 tUnfolder$Statistics]: this new event has 273 ancestors and is cut-off event [2022-11-16 12:32:07,514 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 12:32:07,515 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 12:32:07,515 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 12:32:07,516 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][287], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 170#L86-2true, 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, 84#L59true, 252#L66-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,516 INFO L383 tUnfolder$Statistics]: this new event has 273 ancestors and is cut-off event [2022-11-16 12:32:07,516 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 12:32:07,516 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 12:32:07,517 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 12:32:07,517 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][288], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 170#L86-2true, 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 352#true, 84#L59true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,517 INFO L383 tUnfolder$Statistics]: this new event has 273 ancestors and is cut-off event [2022-11-16 12:32:07,517 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 12:32:07,518 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 12:32:07,518 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 12:32:07,521 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][287], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 170#L86-2true, 172#L59-1true, Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, 252#L66-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,522 INFO L383 tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event [2022-11-16 12:32:07,522 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-16 12:32:07,522 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-16 12:32:07,522 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-16 12:32:07,523 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][288], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 170#L86-2true, 172#L59-1true, Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 352#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,523 INFO L383 tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event [2022-11-16 12:32:07,523 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-16 12:32:07,523 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-16 12:32:07,524 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-16 12:32:07,536 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][287], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 6#L87-2true, 352#true, 252#L66-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,536 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-16 12:32:07,537 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-16 12:32:07,537 INFO L386 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-11-16 12:32:07,537 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-16 12:32:07,537 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][288], [Black: 401#(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|)), Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 6#L87-2true, 192#L67true, 352#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 355#true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-11-16 12:32:07,537 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-16 12:32:07,538 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-16 12:32:07,538 INFO L386 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-11-16 12:32:07,538 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-16 12:32:07,579 INFO L130 PetriNetUnfolder]: 886/5883 cut-off events. [2022-11-16 12:32:07,579 INFO L131 PetriNetUnfolder]: For 636/672 co-relation queries the response was YES. [2022-11-16 12:32:07,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7829 conditions, 5883 events. 886/5883 cut-off events. For 636/672 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 49898 event pairs, 549 based on Foata normal form. 36/5200 useless extension candidates. Maximal degree in co-relation 7818. Up to 1052 conditions per place. [2022-11-16 12:32:07,630 INFO L137 encePairwiseOnDemand]: 349/368 looper letters, 109 selfloop transitions, 28 changer transitions 0/413 dead transitions. [2022-11-16 12:32:07,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 413 transitions, 1274 flow [2022-11-16 12:32:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:32:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 12:32:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3329 transitions. [2022-11-16 12:32:07,639 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8223814229249012 [2022-11-16 12:32:07,639 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3329 transitions. [2022-11-16 12:32:07,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3329 transitions. [2022-11-16 12:32:07,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:07,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3329 transitions. [2022-11-16 12:32:07,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 302.6363636363636) internal successors, (3329), 11 states have internal predecessors, (3329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:07,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:07,659 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:07,660 INFO L175 Difference]: Start difference. First operand has 341 places, 345 transitions, 832 flow. Second operand 11 states and 3329 transitions. [2022-11-16 12:32:07,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 413 transitions, 1274 flow [2022-11-16 12:32:07,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 413 transitions, 1269 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:32:07,671 INFO L231 Difference]: Finished difference. Result has 351 places, 347 transitions, 895 flow [2022-11-16 12:32:07,671 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=895, PETRI_PLACES=351, PETRI_TRANSITIONS=347} [2022-11-16 12:32:07,672 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 16 predicate places. [2022-11-16 12:32:07,672 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 347 transitions, 895 flow [2022-11-16 12:32:07,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 295.7142857142857) internal successors, (2070), 7 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:07,673 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:07,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:07,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:32:07,674 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-16 12:32:07,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:07,675 INFO L85 PathProgramCache]: Analyzing trace with hash -819108243, now seen corresponding path program 1 times [2022-11-16 12:32:07,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:07,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406624834] [2022-11-16 12:32:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:07,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:32:08,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:08,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406624834] [2022-11-16 12:32:08,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406624834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:32:08,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152754247] [2022-11-16 12:32:08,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:08,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:32:08,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:32:08,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:32:08,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:32:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:08,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:32:08,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:32:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:32:08,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:32:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:32:08,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152754247] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:32:08,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:32:08,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-16 12:32:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375714153] [2022-11-16 12:32:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:08,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:32:08,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:32:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:32:08,913 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 368 [2022-11-16 12:32:08,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 347 transitions, 895 flow. Second operand has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:08,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:08,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 368 [2022-11-16 12:32:08,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:11,107 INFO L130 PetriNetUnfolder]: 1236/8893 cut-off events. [2022-11-16 12:32:11,107 INFO L131 PetriNetUnfolder]: For 1604/1844 co-relation queries the response was YES. [2022-11-16 12:32:11,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11968 conditions, 8893 events. 1236/8893 cut-off events. For 1604/1844 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 87813 event pairs, 190 based on Foata normal form. 240/8473 useless extension candidates. Maximal degree in co-relation 11955. Up to 1297 conditions per place. [2022-11-16 12:32:11,168 INFO L137 encePairwiseOnDemand]: 352/368 looper letters, 99 selfloop transitions, 17 changer transitions 0/391 dead transitions. [2022-11-16 12:32:11,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 391 transitions, 1251 flow [2022-11-16 12:32:11,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:32:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 12:32:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2402 transitions. [2022-11-16 12:32:11,174 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8158967391304348 [2022-11-16 12:32:11,175 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2402 transitions. [2022-11-16 12:32:11,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2402 transitions. [2022-11-16 12:32:11,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:11,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2402 transitions. [2022-11-16 12:32:11,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 300.25) internal successors, (2402), 8 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:11,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 368.0) internal successors, (3312), 9 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:11,193 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 368.0) internal successors, (3312), 9 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:11,193 INFO L175 Difference]: Start difference. First operand has 351 places, 347 transitions, 895 flow. Second operand 8 states and 2402 transitions. [2022-11-16 12:32:11,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 391 transitions, 1251 flow [2022-11-16 12:32:11,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 391 transitions, 1224 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 12:32:11,203 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 985 flow [2022-11-16 12:32:11,204 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=985, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2022-11-16 12:32:11,205 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 23 predicate places. [2022-11-16 12:32:11,205 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 985 flow [2022-11-16 12:32:11,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:11,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:11,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:11,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 12:32:11,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:32:11,412 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-16 12:32:11,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:11,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1731510744, now seen corresponding path program 1 times [2022-11-16 12:32:11,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:11,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494630109] [2022-11-16 12:32:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:11,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:11,703 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-16 12:32:11,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:11,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494630109] [2022-11-16 12:32:11,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494630109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:11,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:11,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:32:11,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290383318] [2022-11-16 12:32:11,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:11,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:32:11,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:32:11,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:32:11,707 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 368 [2022-11-16 12:32:11,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 985 flow. Second operand has 7 states, 7 states have (on average 293.14285714285717) internal successors, (2052), 7 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:11,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:11,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 368 [2022-11-16 12:32:11,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:13,376 INFO L130 PetriNetUnfolder]: 892/5538 cut-off events. [2022-11-16 12:32:13,376 INFO L131 PetriNetUnfolder]: For 1608/1653 co-relation queries the response was YES. [2022-11-16 12:32:13,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8213 conditions, 5538 events. 892/5538 cut-off events. For 1608/1653 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 46560 event pairs, 568 based on Foata normal form. 66/5176 useless extension candidates. Maximal degree in co-relation 8195. Up to 1223 conditions per place. [2022-11-16 12:32:13,447 INFO L137 encePairwiseOnDemand]: 349/368 looper letters, 56 selfloop transitions, 14 changer transitions 74/415 dead transitions. [2022-11-16 12:32:13,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 415 transitions, 1426 flow [2022-11-16 12:32:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:32:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 12:32:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3293 transitions. [2022-11-16 12:32:13,460 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8134881422924901 [2022-11-16 12:32:13,460 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3293 transitions. [2022-11-16 12:32:13,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3293 transitions. [2022-11-16 12:32:13,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:13,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3293 transitions. [2022-11-16 12:32:13,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 299.3636363636364) internal successors, (3293), 11 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:13,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:13,487 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:13,487 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 985 flow. Second operand 11 states and 3293 transitions. [2022-11-16 12:32:13,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 415 transitions, 1426 flow [2022-11-16 12:32:13,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 415 transitions, 1425 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:32:13,610 INFO L231 Difference]: Finished difference. Result has 370 places, 333 transitions, 849 flow [2022-11-16 12:32:13,611 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=849, PETRI_PLACES=370, PETRI_TRANSITIONS=333} [2022-11-16 12:32:13,611 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 35 predicate places. [2022-11-16 12:32:13,611 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 333 transitions, 849 flow [2022-11-16 12:32:13,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 293.14285714285717) internal successors, (2052), 7 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:13,612 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:13,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:13,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:32:13,613 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-16 12:32:13,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:13,613 INFO L85 PathProgramCache]: Analyzing trace with hash -339515323, now seen corresponding path program 1 times [2022-11-16 12:32:13,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:13,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231935464] [2022-11-16 12:32:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:32:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:13,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231935464] [2022-11-16 12:32:13,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231935464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:32:13,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180778740] [2022-11-16 12:32:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:13,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:32:13,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:32:13,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:32:13,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:32:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:14,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:32:14,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:32:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:32:14,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:32:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:32:14,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180778740] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:32:14,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:32:14,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-16 12:32:14,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885837356] [2022-11-16 12:32:14,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:14,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:32:14,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:14,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:32:14,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:32:14,643 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-11-16 12:32:14,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 333 transitions, 849 flow. Second operand has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:14,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:14,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-11-16 12:32:14,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:15,349 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][303], [Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 84#L59true, 101#L51true, Black: 1808#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1720#(or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)), Black: 447#(<= 1 ~N~0), Black: 1806#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), 1812#(and (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~N~0)), Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(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|)), 1827#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, Black: 1839#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1835#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1837#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1831#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 230#L85-4true, 3382#(and (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)), 355#true]) [2022-11-16 12:32:15,350 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:15,350 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:15,350 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:15,350 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:15,350 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][305], [Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 84#L59true, 101#L51true, Black: 1808#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1720#(or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)), Black: 1806#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1812#(and (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~N~0)), Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(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|)), 1827#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 447#(<= 1 ~N~0), 352#true, 252#L66-6true, Black: 1839#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1835#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1837#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1831#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 230#L85-4true, 3382#(and (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)), 355#true]) [2022-11-16 12:32:15,351 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:15,351 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:15,351 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:15,351 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:15,353 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][303], [Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 101#L51true, Black: 1808#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1720#(or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)), 67#L58-6true, Black: 447#(<= 1 ~N~0), Black: 1806#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), 1812#(and (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~N~0)), Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(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|)), 1827#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, Black: 1839#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1835#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1837#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1831#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 230#L85-4true, 3382#(and (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)), 355#true]) [2022-11-16 12:32:15,353 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:15,353 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:15,354 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:15,354 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:15,354 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][305], [Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 101#L51true, Black: 1808#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1720#(or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)), 67#L58-6true, Black: 1806#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1812#(and (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~N~0)), Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(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|)), 1827#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 447#(<= 1 ~N~0), 352#true, 252#L66-6true, Black: 1839#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1835#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1837#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1831#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 230#L85-4true, 3382#(and (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)), 355#true]) [2022-11-16 12:32:15,354 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:32:15,355 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:15,355 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:32:15,355 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:32:15,361 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][303], [Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, 84#L59true, Black: 1808#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1720#(or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)), Black: 447#(<= 1 ~N~0), Black: 1806#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), 1812#(and (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~N~0)), Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(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|)), 1827#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, Black: 1839#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1835#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1837#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1831#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 301#L51-1true, 230#L85-4true, 3382#(and (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)), 355#true]) [2022-11-16 12:32:15,361 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-16 12:32:15,361 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 12:32:15,361 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:15,362 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:15,362 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][305], [Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 84#L59true, Black: 1808#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1720#(or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)), Black: 1806#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1812#(and (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~N~0)), Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(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|)), 1827#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 447#(<= 1 ~N~0), 352#true, 252#L66-6true, Black: 1839#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1835#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1837#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1831#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 301#L51-1true, 230#L85-4true, 3382#(and (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)), 355#true]) [2022-11-16 12:32:15,362 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-16 12:32:15,362 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:15,362 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 12:32:15,362 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:15,363 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([943] L66-5-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][303], [Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 192#L67true, Black: 1808#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1720#(or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)), 67#L58-6true, Black: 447#(<= 1 ~N~0), Black: 1806#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), 1812#(and (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~N~0)), Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(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|)), 1827#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 352#true, Black: 1839#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1835#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1837#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1831#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 301#L51-1true, 230#L85-4true, 3382#(and (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)), 355#true]) [2022-11-16 12:32:15,363 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-16 12:32:15,364 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 12:32:15,364 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:15,364 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:15,364 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([942] L66-5-->L66-6: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][305], [Black: 359#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 358#(and (= ~asum~0 0) (= ~csum~0 0)), 425#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1808#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1720#(or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1)), 67#L58-6true, Black: 1806#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 1812#(and (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~N~0)), Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(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|)), 1827#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 447#(<= 1 ~N~0), 352#true, 252#L66-6true, Black: 1839#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1835#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1837#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1831#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 435#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 301#L51-1true, 230#L85-4true, 3382#(and (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)), 355#true]) [2022-11-16 12:32:15,364 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-16 12:32:15,365 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 12:32:15,365 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:15,365 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-16 12:32:15,489 INFO L130 PetriNetUnfolder]: 482/3044 cut-off events. [2022-11-16 12:32:15,489 INFO L131 PetriNetUnfolder]: For 1139/1235 co-relation queries the response was YES. [2022-11-16 12:32:15,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4686 conditions, 3044 events. 482/3044 cut-off events. For 1139/1235 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 19742 event pairs, 84 based on Foata normal form. 120/2859 useless extension candidates. Maximal degree in co-relation 4664. Up to 383 conditions per place. [2022-11-16 12:32:15,522 INFO L137 encePairwiseOnDemand]: 360/368 looper letters, 60 selfloop transitions, 7 changer transitions 0/341 dead transitions. [2022-11-16 12:32:15,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 341 transitions, 1021 flow [2022-11-16 12:32:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:32:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 12:32:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2093 transitions. [2022-11-16 12:32:15,527 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8125 [2022-11-16 12:32:15,527 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2093 transitions. [2022-11-16 12:32:15,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2093 transitions. [2022-11-16 12:32:15,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:15,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2093 transitions. [2022-11-16 12:32:15,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:15,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 368.0) internal successors, (2944), 8 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:15,538 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 368.0) internal successors, (2944), 8 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:15,538 INFO L175 Difference]: Start difference. First operand has 370 places, 333 transitions, 849 flow. Second operand 7 states and 2093 transitions. [2022-11-16 12:32:15,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 341 transitions, 1021 flow [2022-11-16 12:32:15,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 341 transitions, 910 flow, removed 21 selfloop flow, removed 22 redundant places. [2022-11-16 12:32:15,547 INFO L231 Difference]: Finished difference. Result has 342 places, 334 transitions, 778 flow [2022-11-16 12:32:15,548 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=778, PETRI_PLACES=342, PETRI_TRANSITIONS=334} [2022-11-16 12:32:15,550 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 7 predicate places. [2022-11-16 12:32:15,550 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 334 transitions, 778 flow [2022-11-16 12:32:15,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:15,551 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:15,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:15,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:32:15,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:32:15,758 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-16 12:32:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:15,758 INFO L85 PathProgramCache]: Analyzing trace with hash -180722287, now seen corresponding path program 1 times [2022-11-16 12:32:15,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:15,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577132040] [2022-11-16 12:32:15,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:15,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:32:16,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:16,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577132040] [2022-11-16 12:32:16,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577132040] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:32:16,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339070369] [2022-11-16 12:32:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:16,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:32:16,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:32:16,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:32:16,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:32:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:16,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:32:16,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:32:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:32:16,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:32:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:32:17,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339070369] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:32:17,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:32:17,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-11-16 12:32:17,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425166545] [2022-11-16 12:32:17,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:32:17,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:32:17,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:17,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:32:17,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:32:17,244 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-11-16 12:32:17,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 334 transitions, 778 flow. Second operand has 14 states, 14 states have (on average 294.85714285714283) internal successors, (4128), 14 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:17,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:17,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-11-16 12:32:17,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:18,461 INFO L130 PetriNetUnfolder]: 507/5594 cut-off events. [2022-11-16 12:32:18,461 INFO L131 PetriNetUnfolder]: For 742/980 co-relation queries the response was YES. [2022-11-16 12:32:18,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7128 conditions, 5594 events. 507/5594 cut-off events. For 742/980 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 49040 event pairs, 150 based on Foata normal form. 238/5394 useless extension candidates. Maximal degree in co-relation 7116. Up to 290 conditions per place. [2022-11-16 12:32:18,505 INFO L137 encePairwiseOnDemand]: 351/368 looper letters, 71 selfloop transitions, 17 changer transitions 0/362 dead transitions. [2022-11-16 12:32:18,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 362 transitions, 1044 flow [2022-11-16 12:32:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:32:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:32:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2983 transitions. [2022-11-16 12:32:18,513 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8105978260869565 [2022-11-16 12:32:18,514 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2983 transitions. [2022-11-16 12:32:18,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2983 transitions. [2022-11-16 12:32:18,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:18,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2983 transitions. [2022-11-16 12:32:18,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 298.3) internal successors, (2983), 10 states have internal predecessors, (2983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:18,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 368.0) internal successors, (4048), 11 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:18,531 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 368.0) internal successors, (4048), 11 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:18,531 INFO L175 Difference]: Start difference. First operand has 342 places, 334 transitions, 778 flow. Second operand 10 states and 2983 transitions. [2022-11-16 12:32:18,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 362 transitions, 1044 flow [2022-11-16 12:32:18,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 362 transitions, 1032 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 12:32:18,540 INFO L231 Difference]: Finished difference. Result has 348 places, 336 transitions, 825 flow [2022-11-16 12:32:18,540 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=825, PETRI_PLACES=348, PETRI_TRANSITIONS=336} [2022-11-16 12:32:18,541 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 13 predicate places. [2022-11-16 12:32:18,541 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 336 transitions, 825 flow [2022-11-16 12:32:18,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 294.85714285714283) internal successors, (4128), 14 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:18,543 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:18,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:18,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:32:18,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:32:18,750 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-16 12:32:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:18,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2140006207, now seen corresponding path program 1 times [2022-11-16 12:32:18,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:18,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904791889] [2022-11-16 12:32:18,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:18,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:32:27,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:27,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904791889] [2022-11-16 12:32:27,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904791889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:32:27,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438094540] [2022-11-16 12:32:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:27,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:32:27,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:32:27,727 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:32:27,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4c749fc-f83a-4c39-b8f2-fc3e741f030a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:32:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:27,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-16 12:32:27,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:32:28,271 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-16 12:32:28,774 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:32:28,774 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 11 treesize of output 11 [2022-11-16 12:32:30,059 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-16 12:32:30,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:32:31,687 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:32:31,687 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 11 treesize of output 11 [2022-11-16 12:32:32,112 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-16 12:32:32,481 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-16 12:32:32,705 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-16 12:32:34,163 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-16 12:32:37,421 INFO L321 Elim1Store]: treesize reduction 180, result has 25.3 percent of original size [2022-11-16 12:32:37,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 80 [2022-11-16 12:32:38,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:38,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 165 [2022-11-16 12:32:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:32:39,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:32:42,174 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int))) (= (+ c_~csum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_304) c_~A~0.base) c_~A~0.offset)) (+ c_~asum~0 c_~bsum~0))) is different from false [2022-11-16 12:32:42,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int))) (= (+ c_~csum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_304) c_~A~0.base) c_~A~0.offset)) (+ |c_thread1Thread1of1ForFork2_#t~ret3#1| c_~bsum~0))) is different from false [2022-11-16 12:32:42,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int))) (= (+ |c_thread1Thread1of1ForFork2_plus_#res#1| c_~bsum~0) (+ c_~csum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_304) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-11-16 12:32:42,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int))) (= (+ |c_thread1Thread1of1ForFork2_plus_#in~a#1| c_~bsum~0 |c_thread1Thread1of1ForFork2_plus_#in~b#1|) (+ c_~csum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_304) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-11-16 12:32:43,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int))) (= (+ c_~csum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_304) c_~A~0.base) c_~A~0.offset)) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~asum~0 c_~bsum~0))) is different from false [2022-11-16 12:32:43,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303))) (= (+ c_~csum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_304) c_~A~0.base) c_~A~0.offset)) (+ c_~asum~0 c_~bsum~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2022-11-16 12:32:43,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_302) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~asum~0 c_~bsum~0) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_304) c_~A~0.base) c_~A~0.offset) c_~csum~0)))) is different from false [2022-11-16 12:32:43,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_302) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303))) (= (+ c_~csum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_304) c_~A~0.base) c_~A~0.offset)) (+ c_~asum~0 c_~bsum~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2022-11-16 12:32:44,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:44,434 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-16 12:32:44,448 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 43286 treesize of output 41878 [2022-11-16 12:32:44,785 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 41878 treesize of output 39830 [2022-11-16 12:32:45,191 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 39830 treesize of output 37782 [2022-11-16 12:32:45,485 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 37782 treesize of output 37078 [2022-11-16 12:32:45,750 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 37078 treesize of output 35798