./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/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_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-8393723 [2022-11-18 20:27:23,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:27:23,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:27:23,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:27:23,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:27:23,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:27:23,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:27:23,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:27:23,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:27:23,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:27:23,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:27:23,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:27:23,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:27:23,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:27:23,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:27:23,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:27:23,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:27:23,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:27:23,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:27:23,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:27:23,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:27:23,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:27:23,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:27:23,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:27:23,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:27:23,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:27:23,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:27:23,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:27:23,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:27:23,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:27:23,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:27:23,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:27:23,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:27:23,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:27:23,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:27:23,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:27:23,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:27:23,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:27:23,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:27:23,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:27:23,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:27:23,425 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:27:23,449 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:27:23,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:27:23,450 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:27:23,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:27:23,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:27:23,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:27:23,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:27:23,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:27:23,452 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:27:23,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:27:23,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:27:23,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:27:23,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:27:23,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:27:23,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:27:23,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:27:23,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:27:23,455 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:27:23,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:27:23,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:27:23,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:27:23,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:27:23,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:27:23,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:27:23,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:27:23,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:27:23,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:27:23,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:27:23,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:27:23,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:27:23,459 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:27:23,459 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:27:23,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:27:23,460 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_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f [2022-11-18 20:27:23,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:27:23,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:27:23,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:27:23,771 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:27:23,772 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:27:23,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-11-18 20:27:23,858 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/data/75f73178c/d56cea1683fe423489bb1772b6a92554/FLAGa2b9bbd70 [2022-11-18 20:27:24,347 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:27:24,347 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-11-18 20:27:24,355 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/data/75f73178c/d56cea1683fe423489bb1772b6a92554/FLAGa2b9bbd70 [2022-11-18 20:27:24,715 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/data/75f73178c/d56cea1683fe423489bb1772b6a92554 [2022-11-18 20:27:24,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:27:24,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:27:24,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:27:24,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:27:24,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:27:24,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:27:24" (1/1) ... [2022-11-18 20:27:24,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548d3650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:24, skipping insertion in model container [2022-11-18 20:27:24,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:27:24" (1/1) ... [2022-11-18 20:27:24,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:27:24,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:27:25,053 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-11-18 20:27:25,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:27:25,071 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:27:25,091 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-11-18 20:27:25,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:27:25,110 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:27:25,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25 WrapperNode [2022-11-18 20:27:25,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:27:25,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:27:25,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:27:25,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:27:25,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,163 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 271 [2022-11-18 20:27:25,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:27:25,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:27:25,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:27:25,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:27:25,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,197 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:27:25,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:27:25,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:27:25,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:27:25,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (1/1) ... [2022-11-18 20:27:25,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:27:25,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:25,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:27:25,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:27:25,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:27:25,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:27:25,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:27:25,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:27:25,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 20:27:25,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 20:27:25,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 20:27:25,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 20:27:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-18 20:27:25,289 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-18 20:27:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:27:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:27:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:27:25,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:27:25,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:27:25,292 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:27:25,406 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:27:25,408 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:27:25,915 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:27:25,932 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:27:25,932 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-18 20:27:25,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:27:25 BoogieIcfgContainer [2022-11-18 20:27:25,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:27:25,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:27:25,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:27:25,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:27:25,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:27:24" (1/3) ... [2022-11-18 20:27:25,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e8555f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:27:25, skipping insertion in model container [2022-11-18 20:27:25,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:25" (2/3) ... [2022-11-18 20:27:25,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e8555f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:27:25, skipping insertion in model container [2022-11-18 20:27:25,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:27:25" (3/3) ... [2022-11-18 20:27:25,945 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2022-11-18 20:27:25,954 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:27:25,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:27:25,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:27:25,963 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:27:26,165 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 20:27:26,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 349 places, 368 transitions, 760 flow [2022-11-18 20:27:26,392 INFO L130 PetriNetUnfolder]: 29/365 cut-off events. [2022-11-18 20:27:26,393 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 20:27:26,405 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-18 20:27:26,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 349 places, 368 transitions, 760 flow [2022-11-18 20:27:26,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 354 transitions, 726 flow [2022-11-18 20:27:26,425 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:27:26,432 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;@29393bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:27:26,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 20:27:26,570 INFO L130 PetriNetUnfolder]: 28/347 cut-off events. [2022-11-18 20:27:26,571 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 20:27:26,571 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:26,572 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-18 20:27:26,573 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:27:26,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1395151076, now seen corresponding path program 1 times [2022-11-18 20:27:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:26,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501390803] [2022-11-18 20:27:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:27:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:27,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501390803] [2022-11-18 20:27:27,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501390803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:27,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:27,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:27:27,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808432443] [2022-11-18 20:27:27,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:27,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:27:27,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:27,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:27:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:27:27,098 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 368 [2022-11-18 20:27:27,103 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-18 20:27:27,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:27,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 368 [2022-11-18 20:27:27,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:27,217 INFO L130 PetriNetUnfolder]: 6/331 cut-off events. [2022-11-18 20:27:27,217 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-18 20:27:27,223 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-18 20:27:27,226 INFO L137 encePairwiseOnDemand]: 345/368 looper letters, 6 selfloop transitions, 0 changer transitions 9/331 dead transitions. [2022-11-18 20:27:27,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 331 transitions, 692 flow [2022-11-18 20:27:27,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:27:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 20:27:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 705 transitions. [2022-11-18 20:27:27,251 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9578804347826086 [2022-11-18 20:27:27,252 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 705 transitions. [2022-11-18 20:27:27,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 705 transitions. [2022-11-18 20:27:27,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:27,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 705 transitions. [2022-11-18 20:27:27,267 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-18 20:27:27,283 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-18 20:27:27,284 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-18 20:27:27,286 INFO L175 Difference]: Start difference. First operand has 335 places, 354 transitions, 726 flow. Second operand 2 states and 705 transitions. [2022-11-18 20:27:27,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 331 transitions, 692 flow [2022-11-18 20:27:27,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 331 transitions, 680 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-18 20:27:27,303 INFO L231 Difference]: Finished difference. Result has 330 places, 322 transitions, 650 flow [2022-11-18 20:27:27,306 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-18 20:27:27,311 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, -5 predicate places. [2022-11-18 20:27:27,312 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 322 transitions, 650 flow [2022-11-18 20:27:27,313 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-18 20:27:27,313 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:27,314 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-18 20:27:27,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:27:27,315 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:27:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:27,317 INFO L85 PathProgramCache]: Analyzing trace with hash -651043350, now seen corresponding path program 1 times [2022-11-18 20:27:27,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:27,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387719142] [2022-11-18 20:27:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:27:28,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:28,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387719142] [2022-11-18 20:27:28,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387719142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:28,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:28,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:27:28,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431087524] [2022-11-18 20:27:28,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:28,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:27:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:28,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:27:28,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:27:28,595 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 368 [2022-11-18 20:27:28,600 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-18 20:27:28,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:28,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 368 [2022-11-18 20:27:28,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:29,788 INFO L130 PetriNetUnfolder]: 186/2285 cut-off events. [2022-11-18 20:27:29,788 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-18 20:27:29,802 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-18 20:27:29,814 INFO L137 encePairwiseOnDemand]: 354/368 looper letters, 123 selfloop transitions, 9 changer transitions 20/413 dead transitions. [2022-11-18 20:27:29,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 413 transitions, 1148 flow [2022-11-18 20:27:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:27:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 20:27:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3441 transitions. [2022-11-18 20:27:29,823 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7792119565217391 [2022-11-18 20:27:29,823 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3441 transitions. [2022-11-18 20:27:29,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3441 transitions. [2022-11-18 20:27:29,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:29,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3441 transitions. [2022-11-18 20:27:29,833 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-18 20:27:29,844 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-18 20:27:29,847 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-18 20:27:29,848 INFO L175 Difference]: Start difference. First operand has 330 places, 322 transitions, 650 flow. Second operand 12 states and 3441 transitions. [2022-11-18 20:27:29,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 413 transitions, 1148 flow [2022-11-18 20:27:29,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 413 transitions, 1148 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:27:29,857 INFO L231 Difference]: Finished difference. Result has 341 places, 328 transitions, 713 flow [2022-11-18 20:27:29,858 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-18 20:27:29,859 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 6 predicate places. [2022-11-18 20:27:29,859 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 328 transitions, 713 flow [2022-11-18 20:27:29,861 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-18 20:27:29,861 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:29,862 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-18 20:27:29,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:27:29,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:27:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash 998929400, now seen corresponding path program 1 times [2022-11-18 20:27:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:29,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807818623] [2022-11-18 20:27:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:27:30,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:30,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807818623] [2022-11-18 20:27:30,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807818623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:30,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:30,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:27:30,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525238792] [2022-11-18 20:27:30,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:30,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:27:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:27:30,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:27:30,282 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-11-18 20:27:30,284 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-18 20:27:30,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:30,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-11-18 20:27:30,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:32,339 INFO L130 PetriNetUnfolder]: 1004/6337 cut-off events. [2022-11-18 20:27:32,340 INFO L131 PetriNetUnfolder]: For 166/167 co-relation queries the response was YES. [2022-11-18 20:27:32,383 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-18 20:27:32,408 INFO L137 encePairwiseOnDemand]: 349/368 looper letters, 113 selfloop transitions, 28 changer transitions 0/415 dead transitions. [2022-11-18 20:27:32,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 415 transitions, 1185 flow [2022-11-18 20:27:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:27:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:27:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3333 transitions. [2022-11-18 20:27:32,416 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8233695652173914 [2022-11-18 20:27:32,416 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3333 transitions. [2022-11-18 20:27:32,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3333 transitions. [2022-11-18 20:27:32,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:32,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3333 transitions. [2022-11-18 20:27:32,427 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-18 20:27:32,436 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-18 20:27:32,437 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-18 20:27:32,438 INFO L175 Difference]: Start difference. First operand has 341 places, 328 transitions, 713 flow. Second operand 11 states and 3333 transitions. [2022-11-18 20:27:32,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 415 transitions, 1185 flow [2022-11-18 20:27:32,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 415 transitions, 1171 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-11-18 20:27:32,449 INFO L231 Difference]: Finished difference. Result has 341 places, 345 transitions, 832 flow [2022-11-18 20:27:32,449 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-18 20:27:32,452 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 6 predicate places. [2022-11-18 20:27:32,452 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 345 transitions, 832 flow [2022-11-18 20:27:32,453 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-18 20:27:32,453 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:32,453 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-18 20:27:32,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:27:32,454 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:27:32,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash -880059400, now seen corresponding path program 1 times [2022-11-18 20:27:32,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:32,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115676498] [2022-11-18 20:27:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:27:32,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:32,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115676498] [2022-11-18 20:27:32,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115676498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:32,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:32,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:27:32,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993499357] [2022-11-18 20:27:32,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:32,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:27:32,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:32,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:27:32,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:27:32,753 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-11-18 20:27:32,756 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-18 20:27:32,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:32,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-11-18 20:27:32,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:34,412 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-18 20:27:34,413 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:34,413 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,414 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:34,414 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,414 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-18 20:27:34,414 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:34,415 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,415 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:34,415 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,416 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-18 20:27:34,417 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:34,417 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,417 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:34,418 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,418 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-18 20:27:34,418 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:34,418 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,419 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:34,419 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,420 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-18 20:27:34,420 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:34,421 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,421 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:34,421 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,422 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-18 20:27:34,422 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:34,422 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,422 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:34,422 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,424 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-18 20:27:34,424 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:34,424 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,425 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,425 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:34,425 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-18 20:27:34,426 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:34,426 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:34,426 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,426 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:34,430 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-18 20:27:34,430 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-18 20:27:34,431 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-18 20:27:34,431 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:34,431 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:34,432 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-18 20:27:34,432 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-18 20:27:34,432 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-18 20:27:34,432 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:34,432 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:34,434 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-18 20:27:34,434 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-18 20:27:34,434 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:34,435 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:34,435 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-18 20:27:34,435 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-18 20:27:34,435 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-18 20:27:34,436 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:34,436 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:34,436 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-18 20:27:34,451 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-18 20:27:34,451 INFO L383 tUnfolder$Statistics]: this new event has 273 ancestors and is cut-off event [2022-11-18 20:27:34,451 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 20:27:34,451 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 20:27:34,452 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 20:27:34,452 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-18 20:27:34,452 INFO L383 tUnfolder$Statistics]: this new event has 273 ancestors and is cut-off event [2022-11-18 20:27:34,453 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 20:27:34,453 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 20:27:34,453 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 20:27:34,454 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-18 20:27:34,454 INFO L383 tUnfolder$Statistics]: this new event has 273 ancestors and is cut-off event [2022-11-18 20:27:34,455 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 20:27:34,455 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 20:27:34,455 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 20:27:34,455 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-18 20:27:34,456 INFO L383 tUnfolder$Statistics]: this new event has 273 ancestors and is cut-off event [2022-11-18 20:27:34,456 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 20:27:34,456 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 20:27:34,456 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 20:27:34,460 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-18 20:27:34,460 INFO L383 tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event [2022-11-18 20:27:34,461 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-18 20:27:34,461 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 20:27:34,461 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 20:27:34,461 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-18 20:27:34,462 INFO L383 tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event [2022-11-18 20:27:34,462 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-18 20:27:34,462 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 20:27:34,462 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 20:27:34,475 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-18 20:27:34,475 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 20:27:34,475 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-18 20:27:34,476 INFO L386 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-11-18 20:27:34,476 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-18 20:27:34,476 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-18 20:27:34,476 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 20:27:34,477 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-18 20:27:34,477 INFO L386 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-11-18 20:27:34,477 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-18 20:27:34,519 INFO L130 PetriNetUnfolder]: 886/5883 cut-off events. [2022-11-18 20:27:34,520 INFO L131 PetriNetUnfolder]: For 636/672 co-relation queries the response was YES. [2022-11-18 20:27:34,561 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-18 20:27:34,588 INFO L137 encePairwiseOnDemand]: 349/368 looper letters, 109 selfloop transitions, 28 changer transitions 0/413 dead transitions. [2022-11-18 20:27:34,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 413 transitions, 1274 flow [2022-11-18 20:27:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:27:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:27:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3329 transitions. [2022-11-18 20:27:34,598 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8223814229249012 [2022-11-18 20:27:34,598 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3329 transitions. [2022-11-18 20:27:34,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3329 transitions. [2022-11-18 20:27:34,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:34,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3329 transitions. [2022-11-18 20:27:34,611 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-18 20:27:34,619 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-18 20:27:34,622 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-18 20:27:34,622 INFO L175 Difference]: Start difference. First operand has 341 places, 345 transitions, 832 flow. Second operand 11 states and 3329 transitions. [2022-11-18 20:27:34,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 413 transitions, 1274 flow [2022-11-18 20:27:34,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 413 transitions, 1269 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:27:34,635 INFO L231 Difference]: Finished difference. Result has 351 places, 347 transitions, 895 flow [2022-11-18 20:27:34,636 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-18 20:27:34,636 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 16 predicate places. [2022-11-18 20:27:34,637 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 347 transitions, 895 flow [2022-11-18 20:27:34,638 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-18 20:27:34,638 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:34,639 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-18 20:27:34,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:27:34,639 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:27:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash -819108243, now seen corresponding path program 1 times [2022-11-18 20:27:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:34,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930919386] [2022-11-18 20:27:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:35,096 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-18 20:27:35,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:35,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930919386] [2022-11-18 20:27:35,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930919386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:35,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283107327] [2022-11-18 20:27:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:35,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:35,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:35,102 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:27:35,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:27:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:35,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:27:35,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:35,633 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-18 20:27:35,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:27:36,017 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-18 20:27:36,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283107327] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:36,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:27:36,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-18 20:27:36,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001092956] [2022-11-18 20:27:36,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:36,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:27:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:36,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:27:36,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:27:36,023 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 368 [2022-11-18 20:27:36,025 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-18 20:27:36,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:36,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 368 [2022-11-18 20:27:36,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:38,204 INFO L130 PetriNetUnfolder]: 1236/8893 cut-off events. [2022-11-18 20:27:38,204 INFO L131 PetriNetUnfolder]: For 1604/1844 co-relation queries the response was YES. [2022-11-18 20:27:38,266 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-18 20:27:38,295 INFO L137 encePairwiseOnDemand]: 352/368 looper letters, 99 selfloop transitions, 17 changer transitions 0/391 dead transitions. [2022-11-18 20:27:38,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 391 transitions, 1251 flow [2022-11-18 20:27:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:27:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 20:27:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2402 transitions. [2022-11-18 20:27:38,301 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8158967391304348 [2022-11-18 20:27:38,301 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2402 transitions. [2022-11-18 20:27:38,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2402 transitions. [2022-11-18 20:27:38,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:38,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2402 transitions. [2022-11-18 20:27:38,307 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-18 20:27:38,312 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-18 20:27:38,330 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-18 20:27:38,330 INFO L175 Difference]: Start difference. First operand has 351 places, 347 transitions, 895 flow. Second operand 8 states and 2402 transitions. [2022-11-18 20:27:38,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 391 transitions, 1251 flow [2022-11-18 20:27:38,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 391 transitions, 1224 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:27:38,344 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 985 flow [2022-11-18 20:27:38,345 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-18 20:27:38,347 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 23 predicate places. [2022-11-18 20:27:38,347 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 985 flow [2022-11-18 20:27:38,349 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-18 20:27:38,349 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:38,349 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-18 20:27:38,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:27:38,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:38,550 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:27:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1731510744, now seen corresponding path program 1 times [2022-11-18 20:27:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:38,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098767672] [2022-11-18 20:27:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:27:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:38,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098767672] [2022-11-18 20:27:38,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098767672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:38,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:38,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:27:38,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359128025] [2022-11-18 20:27:38,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:38,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:27:38,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:27:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:27:38,888 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 368 [2022-11-18 20:27:38,890 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-18 20:27:38,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:38,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 368 [2022-11-18 20:27:38,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:40,980 INFO L130 PetriNetUnfolder]: 892/5538 cut-off events. [2022-11-18 20:27:40,981 INFO L131 PetriNetUnfolder]: For 1608/1653 co-relation queries the response was YES. [2022-11-18 20:27:41,015 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-18 20:27:41,039 INFO L137 encePairwiseOnDemand]: 349/368 looper letters, 56 selfloop transitions, 14 changer transitions 74/415 dead transitions. [2022-11-18 20:27:41,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 415 transitions, 1426 flow [2022-11-18 20:27:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:27:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:27:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3293 transitions. [2022-11-18 20:27:41,048 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8134881422924901 [2022-11-18 20:27:41,048 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3293 transitions. [2022-11-18 20:27:41,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3293 transitions. [2022-11-18 20:27:41,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:41,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3293 transitions. [2022-11-18 20:27:41,058 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-18 20:27:41,065 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-18 20:27:41,066 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-18 20:27:41,067 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 985 flow. Second operand 11 states and 3293 transitions. [2022-11-18 20:27:41,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 415 transitions, 1426 flow [2022-11-18 20:27:41,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 415 transitions, 1425 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:27:41,078 INFO L231 Difference]: Finished difference. Result has 370 places, 333 transitions, 849 flow [2022-11-18 20:27:41,078 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-18 20:27:41,081 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 35 predicate places. [2022-11-18 20:27:41,081 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 333 transitions, 849 flow [2022-11-18 20:27:41,082 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-18 20:27:41,082 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:41,083 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-18 20:27:41,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:27:41,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:27:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash -339515323, now seen corresponding path program 1 times [2022-11-18 20:27:41,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:41,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759376208] [2022-11-18 20:27:41,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:41,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:41,521 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-18 20:27:41,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:41,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759376208] [2022-11-18 20:27:41,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759376208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:41,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232005223] [2022-11-18 20:27:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:41,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:41,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:41,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:27:41,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:27:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:41,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:27:41,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:41,997 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-18 20:27:41,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:27:42,356 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-18 20:27:42,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232005223] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:42,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:27:42,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-18 20:27:42,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963337778] [2022-11-18 20:27:42,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:42,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:27:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:27:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:27:42,361 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-11-18 20:27:42,364 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-18 20:27:42,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:42,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-11-18 20:27:42,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:43,031 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-18 20:27:43,031 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:43,031 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:43,031 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:43,032 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:43,032 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-18 20:27:43,032 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:43,032 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:43,032 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:43,032 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:43,034 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-18 20:27:43,034 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:43,034 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:43,034 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:43,034 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:43,035 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-18 20:27:43,035 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-18 20:27:43,035 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:43,035 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-18 20:27:43,035 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-18 20:27:43,042 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-18 20:27:43,042 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-18 20:27:43,042 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-18 20:27:43,042 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:43,042 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:43,043 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-18 20:27:43,043 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-18 20:27:43,043 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:43,043 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-18 20:27:43,043 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:43,044 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-18 20:27:43,044 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-18 20:27:43,044 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-18 20:27:43,044 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:43,044 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:43,045 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-18 20:27:43,045 INFO L383 tUnfolder$Statistics]: this new event has 268 ancestors and is cut-off event [2022-11-18 20:27:43,045 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-18 20:27:43,045 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:43,045 INFO L386 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-11-18 20:27:43,175 INFO L130 PetriNetUnfolder]: 482/3044 cut-off events. [2022-11-18 20:27:43,176 INFO L131 PetriNetUnfolder]: For 1139/1235 co-relation queries the response was YES. [2022-11-18 20:27:43,201 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-18 20:27:43,216 INFO L137 encePairwiseOnDemand]: 360/368 looper letters, 60 selfloop transitions, 7 changer transitions 0/341 dead transitions. [2022-11-18 20:27:43,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 341 transitions, 1021 flow [2022-11-18 20:27:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:27:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 20:27:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2093 transitions. [2022-11-18 20:27:43,222 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8125 [2022-11-18 20:27:43,222 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2093 transitions. [2022-11-18 20:27:43,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2093 transitions. [2022-11-18 20:27:43,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:43,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2093 transitions. [2022-11-18 20:27:43,236 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-18 20:27:43,240 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-18 20:27:43,241 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-18 20:27:43,242 INFO L175 Difference]: Start difference. First operand has 370 places, 333 transitions, 849 flow. Second operand 7 states and 2093 transitions. [2022-11-18 20:27:43,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 341 transitions, 1021 flow [2022-11-18 20:27:43,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 341 transitions, 910 flow, removed 21 selfloop flow, removed 22 redundant places. [2022-11-18 20:27:43,258 INFO L231 Difference]: Finished difference. Result has 342 places, 334 transitions, 778 flow [2022-11-18 20:27:43,259 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-18 20:27:43,259 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 7 predicate places. [2022-11-18 20:27:43,260 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 334 transitions, 778 flow [2022-11-18 20:27:43,260 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-18 20:27:43,261 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:43,261 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-18 20:27:43,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:27:43,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 20:27:43,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:27:43,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash -180722287, now seen corresponding path program 1 times [2022-11-18 20:27:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:43,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834182756] [2022-11-18 20:27:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:43,927 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-18 20:27:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:43,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834182756] [2022-11-18 20:27:43,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834182756] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:43,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145168989] [2022-11-18 20:27:43,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:43,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:43,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:43,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:27:43,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:27:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:44,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:27:44,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:44,639 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-18 20:27:44,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:27:45,082 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-18 20:27:45,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145168989] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:27:45,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:27:45,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-11-18 20:27:45,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601845907] [2022-11-18 20:27:45,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:27:45,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:27:45,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:45,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:27:45,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:27:45,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-11-18 20:27:45,095 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-18 20:27:45,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:45,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-11-18 20:27:45,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:46,463 INFO L130 PetriNetUnfolder]: 507/5594 cut-off events. [2022-11-18 20:27:46,464 INFO L131 PetriNetUnfolder]: For 742/980 co-relation queries the response was YES. [2022-11-18 20:27:46,510 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-18 20:27:46,529 INFO L137 encePairwiseOnDemand]: 351/368 looper letters, 71 selfloop transitions, 17 changer transitions 0/362 dead transitions. [2022-11-18 20:27:46,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 362 transitions, 1044 flow [2022-11-18 20:27:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:27:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:27:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2983 transitions. [2022-11-18 20:27:46,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8105978260869565 [2022-11-18 20:27:46,537 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2983 transitions. [2022-11-18 20:27:46,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2983 transitions. [2022-11-18 20:27:46,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:46,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2983 transitions. [2022-11-18 20:27:46,546 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-18 20:27:46,553 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-18 20:27:46,555 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-18 20:27:46,555 INFO L175 Difference]: Start difference. First operand has 342 places, 334 transitions, 778 flow. Second operand 10 states and 2983 transitions. [2022-11-18 20:27:46,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 362 transitions, 1044 flow [2022-11-18 20:27:46,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 362 transitions, 1032 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:27:46,565 INFO L231 Difference]: Finished difference. Result has 348 places, 336 transitions, 825 flow [2022-11-18 20:27:46,565 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-18 20:27:46,566 INFO L288 CegarLoopForPetriNet]: 335 programPoint places, 13 predicate places. [2022-11-18 20:27:46,566 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 336 transitions, 825 flow [2022-11-18 20:27:46,568 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-18 20:27:46,568 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:46,568 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-18 20:27:46,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:27:46,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:46,774 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 20:27:46,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2140006207, now seen corresponding path program 1 times [2022-11-18 20:27:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:46,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453889280] [2022-11-18 20:27:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:55,925 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-18 20:27:55,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:55,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453889280] [2022-11-18 20:27:55,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453889280] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:55,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954506256] [2022-11-18 20:27:55,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:55,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:55,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:55,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:27:55,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a850f25-b7d3-41f1-b248-b87ba5e064e1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:27:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:56,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-18 20:27:56,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:56,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:27:57,147 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:27:57,148 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-18 20:27:58,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:27:59,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:28:00,528 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:28:00,528 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-18 20:28:01,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:28:01,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:28:01,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:28:03,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:28:07,687 INFO L321 Elim1Store]: treesize reduction 180, result has 25.3 percent of original size [2022-11-18 20:28:07,687 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-18 20:28:08,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:28:08,564 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-18 20:28:09,627 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-18 20:28:09,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:28:12,942 WARN L837 $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-18 20:28:12,979 WARN L837 $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-18 20:28:12,997 WARN L837 $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-18 20:28:13,598 WARN L837 $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-18 20:28:14,052 WARN L837 $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-18 20:28:14,069 WARN L837 $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-18 20:28:14,109 WARN L837 $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-18 20:28:14,195 WARN L837 $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-18 20:28:15,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:28:15,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-11-18 20:28:15,529 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-18 20:28:15,869 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-18 20:28:16,124 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-18 20:28:16,333 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-18 20:28:16,584 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