./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89f85a9c071b9d85a8a89a1542b8738a051beeaf8ef3f8b389c5a92dd50b70df --- 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-6b4ec56 [2022-11-20 12:06:27,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:06:27,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:06:27,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:06:27,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:06:27,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:06:27,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:06:27,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:06:27,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:06:27,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:06:27,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:06:27,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:06:27,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:06:27,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:06:27,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:06:27,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:06:27,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:06:27,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:06:27,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:06:27,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:06:27,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:06:27,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:06:27,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:06:27,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:06:27,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:06:27,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:06:27,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:06:27,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:06:27,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:06:27,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:06:27,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:06:27,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:06:27,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:06:27,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:06:27,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:06:27,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:06:27,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:06:27,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:06:27,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:06:27,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:06:27,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:06:27,257 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 12:06:27,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:06:27,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:06:27,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:06:27,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:06:27,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:06:27,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:06:27,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:06:27,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:06:27,305 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:06:27,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:06:27,307 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:06:27,307 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:06:27,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:06:27,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:06:27,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:06:27,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:06:27,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:06:27,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:06:27,309 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 12:06:27,309 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:06:27,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:06:27,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:06:27,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:06:27,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:06:27,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:06:27,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:06:27,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:06:27,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:06:27,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:06:27,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:06:27,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:06:27,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:06:27,313 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:06:27,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:06:27,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:06:27,314 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_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/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_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN 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 ! overflow) ) 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 -> 89f85a9c071b9d85a8a89a1542b8738a051beeaf8ef3f8b389c5a92dd50b70df [2022-11-20 12:06:27,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:06:27,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:06:27,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:06:27,710 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:06:27,714 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:06:27,716 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2022-11-20 12:06:31,723 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:06:32,022 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:06:32,023 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2022-11-20 12:06:32,036 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/data/6e323ab84/c349e3b04a1c4a20b82d2d767f07d4b6/FLAGfb36c7ae5 [2022-11-20 12:06:32,055 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/data/6e323ab84/c349e3b04a1c4a20b82d2d767f07d4b6 [2022-11-20 12:06:32,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:06:32,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:06:32,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:06:32,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:06:32,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:06:32,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f85762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32, skipping insertion in model container [2022-11-20 12:06:32,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:06:32,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:06:32,330 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2022-11-20 12:06:32,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:06:32,350 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:06:32,380 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2022-11-20 12:06:32,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:06:32,400 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:06:32,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32 WrapperNode [2022-11-20 12:06:32,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:06:32,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:06:32,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:06:32,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:06:32,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,457 INFO L138 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 166 [2022-11-20 12:06:32,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:06:32,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:06:32,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:06:32,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:06:32,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,497 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:06:32,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:06:32,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:06:32,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:06:32,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (1/1) ... [2022-11-20 12:06:32,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:06:32,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:32,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:06:32,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:06:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:06:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 12:06:32,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 12:06:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 12:06:32,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 12:06:32,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:06:32,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:06:32,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:06:32,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:06:32,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:06:32,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:06:32,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:06:32,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:06:32,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:06:32,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:06:32,614 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:06:32,780 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:06:32,782 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:06:33,380 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:06:33,680 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:06:33,681 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 12:06:33,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:06:33 BoogieIcfgContainer [2022-11-20 12:06:33,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:06:33,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:06:33,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:06:33,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:06:33,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:06:32" (1/3) ... [2022-11-20 12:06:33,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3637d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:06:33, skipping insertion in model container [2022-11-20 12:06:33,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:32" (2/3) ... [2022-11-20 12:06:33,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3637d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:06:33, skipping insertion in model container [2022-11-20 12:06:33,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:06:33" (3/3) ... [2022-11-20 12:06:33,696 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2022-11-20 12:06:33,708 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:06:33,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:06:33,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-20 12:06:33,723 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:06:33,825 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 12:06:33,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 153 transitions, 322 flow [2022-11-20 12:06:34,004 INFO L130 PetriNetUnfolder]: 11/151 cut-off events. [2022-11-20 12:06:34,010 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 12:06:34,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 151 events. 11/151 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 111. Up to 3 conditions per place. [2022-11-20 12:06:34,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 153 transitions, 322 flow [2022-11-20 12:06:34,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 132 transitions, 273 flow [2022-11-20 12:06:34,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:06:34,048 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;@667d11a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:06:34,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-11-20 12:06:34,071 INFO L130 PetriNetUnfolder]: 3/66 cut-off events. [2022-11-20 12:06:34,072 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:06:34,072 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:06:34,073 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] [2022-11-20 12:06:34,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:06:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 13030154, now seen corresponding path program 1 times [2022-11-20 12:06:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:34,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538889177] [2022-11-20 12:06:34,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:34,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:34,553 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-20 12:06:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:34,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538889177] [2022-11-20 12:06:34,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538889177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:34,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:34,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:06:34,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448742114] [2022-11-20 12:06:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:34,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:06:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:34,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:06:34,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:06:34,611 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2022-11-20 12:06:34,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 132 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:34,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:06:34,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2022-11-20 12:06:34,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:06:34,984 INFO L130 PetriNetUnfolder]: 57/343 cut-off events. [2022-11-20 12:06:34,984 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-20 12:06:34,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 343 events. 57/343 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1241 event pairs, 28 based on Foata normal form. 30/287 useless extension candidates. Maximal degree in co-relation 183. Up to 62 conditions per place. [2022-11-20 12:06:34,992 INFO L137 encePairwiseOnDemand]: 137/153 looper letters, 34 selfloop transitions, 4 changer transitions 3/139 dead transitions. [2022-11-20 12:06:34,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 372 flow [2022-11-20 12:06:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:06:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:06:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2022-11-20 12:06:35,016 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.85359477124183 [2022-11-20 12:06:35,017 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2022-11-20 12:06:35,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2022-11-20 12:06:35,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:06:35,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2022-11-20 12:06:35,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:35,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:35,042 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:35,044 INFO L175 Difference]: Start difference. First operand has 129 places, 132 transitions, 273 flow. Second operand 5 states and 653 transitions. [2022-11-20 12:06:35,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 139 transitions, 372 flow [2022-11-20 12:06:35,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 139 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:06:35,055 INFO L231 Difference]: Finished difference. Result has 130 places, 122 transitions, 272 flow [2022-11-20 12:06:35,058 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=130, PETRI_TRANSITIONS=122} [2022-11-20 12:06:35,063 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 1 predicate places. [2022-11-20 12:06:35,064 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 122 transitions, 272 flow [2022-11-20 12:06:35,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:35,065 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:06:35,065 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:35,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:06:35,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:06:35,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash 490861190, now seen corresponding path program 1 times [2022-11-20 12:06:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:35,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279813972] [2022-11-20 12:06:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:35,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:35,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279813972] [2022-11-20 12:06:35,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279813972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:06:35,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369812773] [2022-11-20 12:06:35,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:35,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:35,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:35,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:06:35,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:06:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:35,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:06:35,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:06:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:35,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:06:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:35,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369812773] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:06:35,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:06:35,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-20 12:06:35,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795179071] [2022-11-20 12:06:35,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:06:35,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:06:35,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:35,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:06:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:06:35,834 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2022-11-20 12:06:35,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 122 transitions, 272 flow. Second operand has 12 states, 12 states have (on average 121.66666666666667) internal successors, (1460), 12 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:35,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:06:35,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2022-11-20 12:06:35,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:06:36,542 INFO L130 PetriNetUnfolder]: 141/770 cut-off events. [2022-11-20 12:06:36,543 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-20 12:06:36,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 770 events. 141/770 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3921 event pairs, 70 based on Foata normal form. 3/573 useless extension candidates. Maximal degree in co-relation 868. Up to 57 conditions per place. [2022-11-20 12:06:36,552 INFO L137 encePairwiseOnDemand]: 146/153 looper letters, 73 selfloop transitions, 18 changer transitions 0/189 dead transitions. [2022-11-20 12:06:36,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 189 transitions, 626 flow [2022-11-20 12:06:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 12:06:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-20 12:06:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2236 transitions. [2022-11-20 12:06:36,560 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8119099491648512 [2022-11-20 12:06:36,560 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2236 transitions. [2022-11-20 12:06:36,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2236 transitions. [2022-11-20 12:06:36,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:06:36,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2236 transitions. [2022-11-20 12:06:36,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 124.22222222222223) internal successors, (2236), 18 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:36,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 153.0) internal successors, (2907), 19 states have internal predecessors, (2907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:36,582 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 153.0) internal successors, (2907), 19 states have internal predecessors, (2907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:36,582 INFO L175 Difference]: Start difference. First operand has 130 places, 122 transitions, 272 flow. Second operand 18 states and 2236 transitions. [2022-11-20 12:06:36,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 189 transitions, 626 flow [2022-11-20 12:06:36,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 189 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:06:36,589 INFO L231 Difference]: Finished difference. Result has 147 places, 134 transitions, 376 flow [2022-11-20 12:06:36,590 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=376, PETRI_PLACES=147, PETRI_TRANSITIONS=134} [2022-11-20 12:06:36,591 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 18 predicate places. [2022-11-20 12:06:36,591 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 134 transitions, 376 flow [2022-11-20 12:06:36,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 121.66666666666667) internal successors, (1460), 12 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:36,593 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:06:36,593 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:36,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:06:36,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:36,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:06:36,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1963171886, now seen corresponding path program 1 times [2022-11-20 12:06:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:36,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251699907] [2022-11-20 12:06:36,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:36,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:37,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251699907] [2022-11-20 12:06:37,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251699907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:06:37,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675446812] [2022-11-20 12:06:37,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:37,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:37,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:37,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:06:37,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:06:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:37,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:06:37,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:06:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:37,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:06:37,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675446812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:37,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:06:37,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-20 12:06:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422319604] [2022-11-20 12:06:37,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:37,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:06:37,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:37,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:06:37,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:06:37,323 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2022-11-20 12:06:37,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 134 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:37,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:06:37,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2022-11-20 12:06:37,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:06:37,684 INFO L130 PetriNetUnfolder]: 141/766 cut-off events. [2022-11-20 12:06:37,685 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-11-20 12:06:37,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 766 events. 141/766 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3924 event pairs, 70 based on Foata normal form. 4/570 useless extension candidates. Maximal degree in co-relation 915. Up to 212 conditions per place. [2022-11-20 12:06:37,698 INFO L137 encePairwiseOnDemand]: 148/153 looper letters, 35 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2022-11-20 12:06:37,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 144 transitions, 475 flow [2022-11-20 12:06:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:06:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:06:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2022-11-20 12:06:37,704 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8132586367880486 [2022-11-20 12:06:37,705 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2022-11-20 12:06:37,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2022-11-20 12:06:37,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:06:37,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2022-11-20 12:06:37,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:37,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:37,718 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:37,718 INFO L175 Difference]: Start difference. First operand has 147 places, 134 transitions, 376 flow. Second operand 7 states and 871 transitions. [2022-11-20 12:06:37,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 144 transitions, 475 flow [2022-11-20 12:06:37,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 144 transitions, 443 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-11-20 12:06:37,734 INFO L231 Difference]: Finished difference. Result has 143 places, 130 transitions, 339 flow [2022-11-20 12:06:37,734 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=143, PETRI_TRANSITIONS=130} [2022-11-20 12:06:37,741 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 14 predicate places. [2022-11-20 12:06:37,743 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 130 transitions, 339 flow [2022-11-20 12:06:37,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:37,744 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:06:37,744 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] [2022-11-20 12:06:37,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:06:37,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:37,952 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:06:37,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash -351439445, now seen corresponding path program 1 times [2022-11-20 12:06:37,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:37,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740103490] [2022-11-20 12:06:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:38,165 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-20 12:06:38,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:38,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740103490] [2022-11-20 12:06:38,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740103490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:38,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:38,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:06:38,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703506419] [2022-11-20 12:06:38,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:38,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:06:38,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:38,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:06:38,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:06:38,171 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2022-11-20 12:06:38,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 130 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:38,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:06:38,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2022-11-20 12:06:38,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:06:38,446 INFO L130 PetriNetUnfolder]: 113/662 cut-off events. [2022-11-20 12:06:38,446 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-20 12:06:38,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 662 events. 113/662 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3153 event pairs, 56 based on Foata normal form. 5/505 useless extension candidates. Maximal degree in co-relation 860. Up to 221 conditions per place. [2022-11-20 12:06:38,453 INFO L137 encePairwiseOnDemand]: 140/153 looper letters, 27 selfloop transitions, 6 changer transitions 3/135 dead transitions. [2022-11-20 12:06:38,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 135 transitions, 424 flow [2022-11-20 12:06:38,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:06:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:06:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2022-11-20 12:06:38,457 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7983193277310925 [2022-11-20 12:06:38,457 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2022-11-20 12:06:38,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2022-11-20 12:06:38,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:06:38,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2022-11-20 12:06:38,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:38,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:38,466 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:38,467 INFO L175 Difference]: Start difference. First operand has 143 places, 130 transitions, 339 flow. Second operand 7 states and 855 transitions. [2022-11-20 12:06:38,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 135 transitions, 424 flow [2022-11-20 12:06:38,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 135 transitions, 410 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 12:06:38,493 INFO L231 Difference]: Finished difference. Result has 146 places, 130 transitions, 353 flow [2022-11-20 12:06:38,494 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=146, PETRI_TRANSITIONS=130} [2022-11-20 12:06:38,496 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 17 predicate places. [2022-11-20 12:06:38,496 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 130 transitions, 353 flow [2022-11-20 12:06:38,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:38,497 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:06:38,497 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] [2022-11-20 12:06:38,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:06:38,498 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:06:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:38,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1900699567, now seen corresponding path program 1 times [2022-11-20 12:06:38,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:38,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795061051] [2022-11-20 12:06:38,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:38,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:38,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:38,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795061051] [2022-11-20 12:06:38,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795061051] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:06:38,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284572294] [2022-11-20 12:06:38,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:38,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:38,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:38,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:06:38,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:06:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:38,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:06:38,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:06:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:06:39,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:06:39,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284572294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:39,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:06:39,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-11-20 12:06:39,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488664389] [2022-11-20 12:06:39,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:39,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:06:39,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:39,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:06:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:06:39,045 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153 [2022-11-20 12:06:39,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 130 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:39,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:06:39,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153 [2022-11-20 12:06:39,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:06:39,177 INFO L130 PetriNetUnfolder]: 45/464 cut-off events. [2022-11-20 12:06:39,177 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-11-20 12:06:39,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 464 events. 45/464 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1884 event pairs, 20 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 601. Up to 84 conditions per place. [2022-11-20 12:06:39,182 INFO L137 encePairwiseOnDemand]: 147/153 looper letters, 9 selfloop transitions, 3 changer transitions 0/127 dead transitions. [2022-11-20 12:06:39,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 127 transitions, 365 flow [2022-11-20 12:06:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:06:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 12:06:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2022-11-20 12:06:39,185 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8415032679738562 [2022-11-20 12:06:39,186 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2022-11-20 12:06:39,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2022-11-20 12:06:39,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:06:39,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2022-11-20 12:06:39,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:39,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:39,191 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:39,191 INFO L175 Difference]: Start difference. First operand has 146 places, 130 transitions, 353 flow. Second operand 4 states and 515 transitions. [2022-11-20 12:06:39,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 127 transitions, 365 flow [2022-11-20 12:06:39,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 127 transitions, 353 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 12:06:39,198 INFO L231 Difference]: Finished difference. Result has 140 places, 127 transitions, 335 flow [2022-11-20 12:06:39,199 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=140, PETRI_TRANSITIONS=127} [2022-11-20 12:06:39,202 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 11 predicate places. [2022-11-20 12:06:39,202 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 127 transitions, 335 flow [2022-11-20 12:06:39,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:39,203 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:06:39,204 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] [2022-11-20 12:06:39,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:06:39,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:39,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:06:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:39,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1211233909, now seen corresponding path program 1 times [2022-11-20 12:06:39,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:39,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258557645] [2022-11-20 12:06:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:39,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:06:39,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:39,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258557645] [2022-11-20 12:06:39,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258557645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:39,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:39,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:06:39,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82001104] [2022-11-20 12:06:39,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:39,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:06:39,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:39,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:06:39,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:06:39,558 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 153 [2022-11-20 12:06:39,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 127 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:39,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:06:39,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 153 [2022-11-20 12:06:39,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:06:39,832 INFO L130 PetriNetUnfolder]: 185/760 cut-off events. [2022-11-20 12:06:39,832 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-11-20 12:06:39,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 760 events. 185/760 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4491 event pairs, 92 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 1533. Up to 257 conditions per place. [2022-11-20 12:06:39,839 INFO L137 encePairwiseOnDemand]: 147/153 looper letters, 28 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2022-11-20 12:06:39,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 143 transitions, 448 flow [2022-11-20 12:06:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:06:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:06:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2022-11-20 12:06:39,845 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8352941176470589 [2022-11-20 12:06:39,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2022-11-20 12:06:39,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2022-11-20 12:06:39,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:06:39,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2022-11-20 12:06:39,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:39,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:39,852 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:39,853 INFO L175 Difference]: Start difference. First operand has 140 places, 127 transitions, 335 flow. Second operand 5 states and 639 transitions. [2022-11-20 12:06:39,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 143 transitions, 448 flow [2022-11-20 12:06:39,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 442 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:06:39,858 INFO L231 Difference]: Finished difference. Result has 144 places, 130 transitions, 359 flow [2022-11-20 12:06:39,858 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=144, PETRI_TRANSITIONS=130} [2022-11-20 12:06:39,862 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 15 predicate places. [2022-11-20 12:06:39,862 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 130 transitions, 359 flow [2022-11-20 12:06:39,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:39,863 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:06:39,863 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] [2022-11-20 12:06:39,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:06:39,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:06:39,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash 45043235, now seen corresponding path program 1 times [2022-11-20 12:06:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:39,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11963107] [2022-11-20 12:06:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:39,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:06:40,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:40,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11963107] [2022-11-20 12:06:40,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11963107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:40,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:40,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:06:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550840069] [2022-11-20 12:06:40,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:40,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:06:40,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:40,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:06:40,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:06:40,145 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 153 [2022-11-20 12:06:40,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 130 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:40,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:06:40,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 153 [2022-11-20 12:06:40,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:06:40,319 INFO L130 PetriNetUnfolder]: 61/712 cut-off events. [2022-11-20 12:06:40,320 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-11-20 12:06:40,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 712 events. 61/712 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3932 event pairs, 24 based on Foata normal form. 4/616 useless extension candidates. Maximal degree in co-relation 956. Up to 108 conditions per place. [2022-11-20 12:06:40,326 INFO L137 encePairwiseOnDemand]: 147/153 looper letters, 11 selfloop transitions, 5 changer transitions 0/133 dead transitions. [2022-11-20 12:06:40,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 133 transitions, 403 flow [2022-11-20 12:06:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:06:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:06:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-11-20 12:06:40,329 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8474945533769063 [2022-11-20 12:06:40,329 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-11-20 12:06:40,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-11-20 12:06:40,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:06:40,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-11-20 12:06:40,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:40,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:40,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:40,336 INFO L175 Difference]: Start difference. First operand has 144 places, 130 transitions, 359 flow. Second operand 3 states and 389 transitions. [2022-11-20 12:06:40,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 133 transitions, 403 flow [2022-11-20 12:06:40,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 133 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:06:40,346 INFO L231 Difference]: Finished difference. Result has 146 places, 132 transitions, 386 flow [2022-11-20 12:06:40,347 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=146, PETRI_TRANSITIONS=132} [2022-11-20 12:06:40,348 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 17 predicate places. [2022-11-20 12:06:40,348 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 132 transitions, 386 flow [2022-11-20 12:06:40,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:40,349 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:06:40,349 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:06:40,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:06:40,350 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:06:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash -425050445, now seen corresponding path program 1 times [2022-11-20 12:06:40,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:40,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076315599] [2022-11-20 12:06:40,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:40,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:06:40,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:40,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076315599] [2022-11-20 12:06:40,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076315599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:06:40,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285867460] [2022-11-20 12:06:40,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:40,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:40,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:40,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:06:40,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:06:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:40,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 12:06:40,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:06:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:41,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:06:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:41,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285867460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:06:41,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:06:41,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-11-20 12:06:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300304114] [2022-11-20 12:06:41,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:06:41,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 12:06:41,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:41,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 12:06:41,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-11-20 12:06:41,476 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 153 [2022-11-20 12:06:41,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 132 transitions, 386 flow. Second operand has 19 states, 19 states have (on average 104.36842105263158) internal successors, (1983), 19 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:41,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:06:41,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 153 [2022-11-20 12:06:41,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:06:42,597 INFO L130 PetriNetUnfolder]: 297/1022 cut-off events. [2022-11-20 12:06:42,598 INFO L131 PetriNetUnfolder]: For 639/639 co-relation queries the response was YES. [2022-11-20 12:06:42,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2612 conditions, 1022 events. 297/1022 cut-off events. For 639/639 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 6170 event pairs, 34 based on Foata normal form. 15/948 useless extension candidates. Maximal degree in co-relation 2505. Up to 245 conditions per place. [2022-11-20 12:06:42,609 INFO L137 encePairwiseOnDemand]: 135/153 looper letters, 86 selfloop transitions, 28 changer transitions 0/193 dead transitions. [2022-11-20 12:06:42,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 193 transitions, 848 flow [2022-11-20 12:06:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 12:06:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-20 12:06:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2310 transitions. [2022-11-20 12:06:42,621 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2022-11-20 12:06:42,621 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2310 transitions. [2022-11-20 12:06:42,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2310 transitions. [2022-11-20 12:06:42,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:06:42,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2310 transitions. [2022-11-20 12:06:42,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:42,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 153.0) internal successors, (3519), 23 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:42,643 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 153.0) internal successors, (3519), 23 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:42,643 INFO L175 Difference]: Start difference. First operand has 146 places, 132 transitions, 386 flow. Second operand 22 states and 2310 transitions. [2022-11-20 12:06:42,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 193 transitions, 848 flow [2022-11-20 12:06:42,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 193 transitions, 803 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-11-20 12:06:42,653 INFO L231 Difference]: Finished difference. Result has 172 places, 144 transitions, 523 flow [2022-11-20 12:06:42,653 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=523, PETRI_PLACES=172, PETRI_TRANSITIONS=144} [2022-11-20 12:06:42,657 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 43 predicate places. [2022-11-20 12:06:42,658 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 144 transitions, 523 flow [2022-11-20 12:06:42,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 104.36842105263158) internal successors, (1983), 19 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:42,660 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:06:42,660 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] [2022-11-20 12:06:42,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:06:42,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:42,874 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:06:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:42,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1427822257, now seen corresponding path program 1 times [2022-11-20 12:06:42,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:42,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668920075] [2022-11-20 12:06:42,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:44,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:44,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668920075] [2022-11-20 12:06:44,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668920075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:06:44,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540972799] [2022-11-20 12:06:44,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:44,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:44,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:44,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:06:44,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:06:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:44,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-20 12:06:44,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:06:44,877 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-20 12:06:45,434 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:06:45,435 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-20 12:06:45,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 12:06:47,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:06:47,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 12:06:47,581 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 18 treesize of output 20 [2022-11-20 12:06:47,768 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-20 12:06:47,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-20 12:06:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:47,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:06:47,929 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_147 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) 2147483648)) is different from false [2022-11-20 12:06:59,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:06:59,638 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 31 treesize of output 32 [2022-11-20 12:06:59,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:06:59,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 162 [2022-11-20 12:06:59,671 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 73 treesize of output 61 [2022-11-20 12:06:59,681 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 134 treesize of output 110 [2022-11-20 12:07:03,663 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 10 treesize of output 8 [2022-11-20 12:07:03,681 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 10 treesize of output 8 [2022-11-20 12:07:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:03,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540972799] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:07:03,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:07:03,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 59 [2022-11-20 12:07:03,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043253050] [2022-11-20 12:07:03,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:07:03,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-20 12:07:03,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:03,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-20 12:07:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=3168, Unknown=3, NotChecked=114, Total=3540 [2022-11-20 12:07:03,813 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 153 [2022-11-20 12:07:03,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 144 transitions, 523 flow. Second operand has 60 states, 60 states have (on average 73.1) internal successors, (4386), 60 states have internal predecessors, (4386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:03,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:07:03,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 153 [2022-11-20 12:07:03,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:07:08,244 INFO L130 PetriNetUnfolder]: 814/2758 cut-off events. [2022-11-20 12:07:08,244 INFO L131 PetriNetUnfolder]: For 1856/2068 co-relation queries the response was YES. [2022-11-20 12:07:08,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6194 conditions, 2758 events. 814/2758 cut-off events. For 1856/2068 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 22142 event pairs, 451 based on Foata normal form. 44/2393 useless extension candidates. Maximal degree in co-relation 6055. Up to 1197 conditions per place. [2022-11-20 12:07:08,268 INFO L137 encePairwiseOnDemand]: 120/153 looper letters, 69 selfloop transitions, 31 changer transitions 15/181 dead transitions. [2022-11-20 12:07:08,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 181 transitions, 857 flow [2022-11-20 12:07:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 12:07:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-11-20 12:07:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2093 transitions. [2022-11-20 12:07:08,276 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48856209150326796 [2022-11-20 12:07:08,277 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2093 transitions. [2022-11-20 12:07:08,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2093 transitions. [2022-11-20 12:07:08,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:07:08,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2093 transitions. [2022-11-20 12:07:08,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 74.75) internal successors, (2093), 28 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-20 12:07:08,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 153.0) internal successors, (4437), 29 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:08,297 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 153.0) internal successors, (4437), 29 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:08,298 INFO L175 Difference]: Start difference. First operand has 172 places, 144 transitions, 523 flow. Second operand 28 states and 2093 transitions. [2022-11-20 12:07:08,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 181 transitions, 857 flow [2022-11-20 12:07:08,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 181 transitions, 826 flow, removed 3 selfloop flow, removed 9 redundant places. [2022-11-20 12:07:08,326 INFO L231 Difference]: Finished difference. Result has 205 places, 159 transitions, 679 flow [2022-11-20 12:07:08,326 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=679, PETRI_PLACES=205, PETRI_TRANSITIONS=159} [2022-11-20 12:07:08,327 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 76 predicate places. [2022-11-20 12:07:08,328 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 159 transitions, 679 flow [2022-11-20 12:07:08,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 73.1) internal successors, (4386), 60 states have internal predecessors, (4386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:08,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:07:08,331 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] [2022-11-20 12:07:08,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:08,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 12:07:08,539 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:07:08,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1579709723, now seen corresponding path program 2 times [2022-11-20 12:07:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:08,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768074542] [2022-11-20 12:07:08,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:08,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:10,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:10,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768074542] [2022-11-20 12:07:10,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768074542] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:10,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411774586] [2022-11-20 12:07:10,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:07:10,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:10,879 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:10,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:07:11,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 12:07:11,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:07:11,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 12:07:11,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:11,446 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 23 treesize of output 7 [2022-11-20 12:07:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:07:11,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:07:11,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411774586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:11,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:07:11,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 26 [2022-11-20 12:07:11,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699709823] [2022-11-20 12:07:11,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:11,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:07:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:11,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:07:11,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2022-11-20 12:07:11,495 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 153 [2022-11-20 12:07:11,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 159 transitions, 679 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:11,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:07:11,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 153 [2022-11-20 12:07:11,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:07:12,888 INFO L130 PetriNetUnfolder]: 1393/4097 cut-off events. [2022-11-20 12:07:12,889 INFO L131 PetriNetUnfolder]: For 4682/4752 co-relation queries the response was YES. [2022-11-20 12:07:12,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11016 conditions, 4097 events. 1393/4097 cut-off events. For 4682/4752 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 36544 event pairs, 460 based on Foata normal form. 86/4089 useless extension candidates. Maximal degree in co-relation 10872. Up to 1310 conditions per place. [2022-11-20 12:07:12,938 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 64 selfloop transitions, 12 changer transitions 1/195 dead transitions. [2022-11-20 12:07:12,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 195 transitions, 994 flow [2022-11-20 12:07:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:07:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 12:07:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions. [2022-11-20 12:07:12,945 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7745098039215687 [2022-11-20 12:07:12,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 711 transitions. [2022-11-20 12:07:12,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 711 transitions. [2022-11-20 12:07:12,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:07:12,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 711 transitions. [2022-11-20 12:07:12,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:12,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:12,954 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:12,954 INFO L175 Difference]: Start difference. First operand has 205 places, 159 transitions, 679 flow. Second operand 6 states and 711 transitions. [2022-11-20 12:07:12,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 195 transitions, 994 flow [2022-11-20 12:07:13,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 195 transitions, 928 flow, removed 20 selfloop flow, removed 15 redundant places. [2022-11-20 12:07:13,007 INFO L231 Difference]: Finished difference. Result has 195 places, 164 transitions, 708 flow [2022-11-20 12:07:13,008 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=708, PETRI_PLACES=195, PETRI_TRANSITIONS=164} [2022-11-20 12:07:13,009 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 66 predicate places. [2022-11-20 12:07:13,009 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 164 transitions, 708 flow [2022-11-20 12:07:13,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:13,021 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:07:13,021 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] [2022-11-20 12:07:13,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:13,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 12:07:13,238 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:07:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash 461018195, now seen corresponding path program 1 times [2022-11-20 12:07:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:13,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136317315] [2022-11-20 12:07:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:16,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136317315] [2022-11-20 12:07:16,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136317315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:16,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605839309] [2022-11-20 12:07:16,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:16,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:16,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:16,013 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:16,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:07:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:16,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-20 12:07:16,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:16,179 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-20 12:07:16,250 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 12:07:16,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 12:07:17,085 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:07:17,085 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 15 treesize of output 15 [2022-11-20 12:07:17,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 12:07:18,231 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-20 12:07:18,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:07:18,542 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 18 treesize of output 20 [2022-11-20 12:07:18,673 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 23 treesize of output 7 [2022-11-20 12:07:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:18,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:07:20,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:07:20,427 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 59 treesize of output 47 [2022-11-20 12:07:20,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:07:20,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 182 [2022-11-20 12:07:20,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:07:20,465 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 170 treesize of output 164 [2022-11-20 12:07:20,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 110 [2022-11-20 12:07:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:23,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605839309] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:07:23,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:07:23,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 58 [2022-11-20 12:07:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322851491] [2022-11-20 12:07:23,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:07:23,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-20 12:07:23,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:23,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-20 12:07:23,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=3084, Unknown=9, NotChecked=0, Total=3422 [2022-11-20 12:07:23,170 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 153 [2022-11-20 12:07:23,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 164 transitions, 708 flow. Second operand has 59 states, 59 states have (on average 75.08474576271186) internal successors, (4430), 59 states have internal predecessors, (4430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:23,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:07:23,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 153 [2022-11-20 12:07:23,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:07:39,320 INFO L130 PetriNetUnfolder]: 2057/6188 cut-off events. [2022-11-20 12:07:39,321 INFO L131 PetriNetUnfolder]: For 8354/8843 co-relation queries the response was YES. [2022-11-20 12:07:39,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17158 conditions, 6188 events. 2057/6188 cut-off events. For 8354/8843 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 60398 event pairs, 452 based on Foata normal form. 229/6101 useless extension candidates. Maximal degree in co-relation 16999. Up to 1112 conditions per place. [2022-11-20 12:07:39,409 INFO L137 encePairwiseOnDemand]: 122/153 looper letters, 167 selfloop transitions, 82 changer transitions 1/320 dead transitions. [2022-11-20 12:07:39,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 320 transitions, 1945 flow [2022-11-20 12:07:39,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-20 12:07:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-11-20 12:07:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 4243 transitions. [2022-11-20 12:07:39,422 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5042186571598336 [2022-11-20 12:07:39,422 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 4243 transitions. [2022-11-20 12:07:39,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 4243 transitions. [2022-11-20 12:07:39,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:07:39,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 4243 transitions. [2022-11-20 12:07:39,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 77.14545454545454) internal successors, (4243), 55 states have internal predecessors, (4243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:39,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 153.0) internal successors, (8568), 56 states have internal predecessors, (8568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:39,463 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 153.0) internal successors, (8568), 56 states have internal predecessors, (8568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:39,463 INFO L175 Difference]: Start difference. First operand has 195 places, 164 transitions, 708 flow. Second operand 55 states and 4243 transitions. [2022-11-20 12:07:39,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 320 transitions, 1945 flow [2022-11-20 12:07:39,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 320 transitions, 1919 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-20 12:07:39,515 INFO L231 Difference]: Finished difference. Result has 258 places, 212 transitions, 1255 flow [2022-11-20 12:07:39,516 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=1255, PETRI_PLACES=258, PETRI_TRANSITIONS=212} [2022-11-20 12:07:39,517 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 129 predicate places. [2022-11-20 12:07:39,517 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 212 transitions, 1255 flow [2022-11-20 12:07:39,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 75.08474576271186) internal successors, (4430), 59 states have internal predecessors, (4430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:39,519 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:07:39,519 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] [2022-11-20 12:07:39,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:39,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 12:07:39,727 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:07:39,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1421510028, now seen corresponding path program 1 times [2022-11-20 12:07:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:39,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086313713] [2022-11-20 12:07:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:40,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:40,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086313713] [2022-11-20 12:07:40,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086313713] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:40,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963115668] [2022-11-20 12:07:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:40,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:40,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:40,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:40,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:07:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:41,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-20 12:07:41,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:42,276 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 19 treesize of output 7 [2022-11-20 12:07:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:42,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:07:42,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:07:42,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-11-20 12:07:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:43,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963115668] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:07:43,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:07:43,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 11] total 41 [2022-11-20 12:07:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021432484] [2022-11-20 12:07:43,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:07:43,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 12:07:43,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:43,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 12:07:43,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1401, Unknown=0, NotChecked=0, Total=1722 [2022-11-20 12:07:43,744 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 153 [2022-11-20 12:07:43,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 212 transitions, 1255 flow. Second operand has 42 states, 42 states have (on average 85.76190476190476) internal successors, (3602), 42 states have internal predecessors, (3602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:43,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:07:43,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 153 [2022-11-20 12:07:43,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:07:49,079 INFO L130 PetriNetUnfolder]: 2214/6907 cut-off events. [2022-11-20 12:07:49,080 INFO L131 PetriNetUnfolder]: For 22523/23707 co-relation queries the response was YES. [2022-11-20 12:07:49,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22486 conditions, 6907 events. 2214/6907 cut-off events. For 22523/23707 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 69396 event pairs, 241 based on Foata normal form. 419/6981 useless extension candidates. Maximal degree in co-relation 22308. Up to 1081 conditions per place. [2022-11-20 12:07:49,186 INFO L137 encePairwiseOnDemand]: 125/153 looper letters, 191 selfloop transitions, 89 changer transitions 15/371 dead transitions. [2022-11-20 12:07:49,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 371 transitions, 2895 flow [2022-11-20 12:07:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 12:07:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-11-20 12:07:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3370 transitions. [2022-11-20 12:07:49,193 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5796353629170966 [2022-11-20 12:07:49,193 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3370 transitions. [2022-11-20 12:07:49,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3370 transitions. [2022-11-20 12:07:49,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:07:49,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3370 transitions. [2022-11-20 12:07:49,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 88.6842105263158) internal successors, (3370), 38 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:49,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 153.0) internal successors, (5967), 39 states have internal predecessors, (5967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:49,215 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 153.0) internal successors, (5967), 39 states have internal predecessors, (5967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:49,215 INFO L175 Difference]: Start difference. First operand has 258 places, 212 transitions, 1255 flow. Second operand 38 states and 3370 transitions. [2022-11-20 12:07:49,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 371 transitions, 2895 flow [2022-11-20 12:07:49,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 371 transitions, 2644 flow, removed 88 selfloop flow, removed 29 redundant places. [2022-11-20 12:07:49,374 INFO L231 Difference]: Finished difference. Result has 275 places, 255 transitions, 1766 flow [2022-11-20 12:07:49,375 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=1766, PETRI_PLACES=275, PETRI_TRANSITIONS=255} [2022-11-20 12:07:49,376 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 146 predicate places. [2022-11-20 12:07:49,376 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 255 transitions, 1766 flow [2022-11-20 12:07:49,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 85.76190476190476) internal successors, (3602), 42 states have internal predecessors, (3602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:49,378 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:07:49,379 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:07:49,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:49,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 12:07:49,593 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:07:49,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1263421962, now seen corresponding path program 2 times [2022-11-20 12:07:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:49,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455256480] [2022-11-20 12:07:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:49,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455256480] [2022-11-20 12:07:49,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455256480] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:49,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493278903] [2022-11-20 12:07:49,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:07:49,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:49,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:49,973 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:50,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:07:50,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 12:07:50,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:07:50,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:07:50,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-20 12:07:50,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:07:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-20 12:07:50,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493278903] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:07:50,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:07:50,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-11-20 12:07:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738206087] [2022-11-20 12:07:50,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:07:50,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:07:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:50,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:07:50,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:07:50,607 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 153 [2022-11-20 12:07:50,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 255 transitions, 1766 flow. Second operand has 18 states, 18 states have (on average 112.61111111111111) internal successors, (2027), 18 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:50,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:07:50,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 153 [2022-11-20 12:07:50,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:07:52,561 INFO L130 PetriNetUnfolder]: 689/4650 cut-off events. [2022-11-20 12:07:52,561 INFO L131 PetriNetUnfolder]: For 28515/29047 co-relation queries the response was YES. [2022-11-20 12:07:52,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16565 conditions, 4650 events. 689/4650 cut-off events. For 28515/29047 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 48645 event pairs, 143 based on Foata normal form. 72/4537 useless extension candidates. Maximal degree in co-relation 16404. Up to 672 conditions per place. [2022-11-20 12:07:52,614 INFO L137 encePairwiseOnDemand]: 142/153 looper letters, 249 selfloop transitions, 25 changer transitions 0/437 dead transitions. [2022-11-20 12:07:52,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 437 transitions, 4388 flow [2022-11-20 12:07:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 12:07:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-20 12:07:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2713 transitions. [2022-11-20 12:07:52,619 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7388344226579521 [2022-11-20 12:07:52,620 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2713 transitions. [2022-11-20 12:07:52,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2713 transitions. [2022-11-20 12:07:52,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:07:52,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2713 transitions. [2022-11-20 12:07:52,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 113.04166666666667) internal successors, (2713), 24 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:52,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:52,635 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:52,635 INFO L175 Difference]: Start difference. First operand has 275 places, 255 transitions, 1766 flow. Second operand 24 states and 2713 transitions. [2022-11-20 12:07:52,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 437 transitions, 4388 flow [2022-11-20 12:07:52,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 437 transitions, 3851 flow, removed 243 selfloop flow, removed 24 redundant places. [2022-11-20 12:07:52,875 INFO L231 Difference]: Finished difference. Result has 270 places, 259 transitions, 1640 flow [2022-11-20 12:07:52,876 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1640, PETRI_PLACES=270, PETRI_TRANSITIONS=259} [2022-11-20 12:07:52,877 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 141 predicate places. [2022-11-20 12:07:52,877 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 259 transitions, 1640 flow [2022-11-20 12:07:52,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 112.61111111111111) internal successors, (2027), 18 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:52,879 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:07:52,879 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:07:52,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:53,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 12:07:53,086 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:07:53,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:53,087 INFO L85 PathProgramCache]: Analyzing trace with hash 790246699, now seen corresponding path program 1 times [2022-11-20 12:07:53,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:53,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947482012] [2022-11-20 12:07:53,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:53,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:07:53,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:53,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947482012] [2022-11-20 12:07:53,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947482012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:53,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:53,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:07:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197601872] [2022-11-20 12:07:53,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:53,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:07:53,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:53,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:07:53,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:07:53,282 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 153 [2022-11-20 12:07:53,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 259 transitions, 1640 flow. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:53,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:07:53,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 153 [2022-11-20 12:07:53,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:07:54,530 INFO L130 PetriNetUnfolder]: 837/5406 cut-off events. [2022-11-20 12:07:54,530 INFO L131 PetriNetUnfolder]: For 36363/36939 co-relation queries the response was YES. [2022-11-20 12:07:54,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19504 conditions, 5406 events. 837/5406 cut-off events. For 36363/36939 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 56778 event pairs, 58 based on Foata normal form. 192/5311 useless extension candidates. Maximal degree in co-relation 19347. Up to 897 conditions per place. [2022-11-20 12:07:54,594 INFO L137 encePairwiseOnDemand]: 149/153 looper letters, 22 selfloop transitions, 38 changer transitions 22/260 dead transitions. [2022-11-20 12:07:54,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 260 transitions, 1844 flow [2022-11-20 12:07:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:07:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 12:07:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2022-11-20 12:07:54,596 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8627450980392157 [2022-11-20 12:07:54,597 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2022-11-20 12:07:54,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2022-11-20 12:07:54,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:07:54,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2022-11-20 12:07:54,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:54,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:54,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:54,600 INFO L175 Difference]: Start difference. First operand has 270 places, 259 transitions, 1640 flow. Second operand 4 states and 528 transitions. [2022-11-20 12:07:54,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 260 transitions, 1844 flow [2022-11-20 12:07:54,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 260 transitions, 1736 flow, removed 24 selfloop flow, removed 19 redundant places. [2022-11-20 12:07:54,842 INFO L231 Difference]: Finished difference. Result has 254 places, 234 transitions, 1595 flow [2022-11-20 12:07:54,842 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1595, PETRI_PLACES=254, PETRI_TRANSITIONS=234} [2022-11-20 12:07:54,843 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 125 predicate places. [2022-11-20 12:07:54,844 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 234 transitions, 1595 flow [2022-11-20 12:07:54,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:54,844 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:07:54,845 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:07:54,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:07:54,845 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:07:54,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash -640088531, now seen corresponding path program 3 times [2022-11-20 12:07:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:54,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408571353] [2022-11-20 12:07:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:54,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:57,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:57,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408571353] [2022-11-20 12:07:57,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408571353] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:57,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721916204] [2022-11-20 12:07:57,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:07:57,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:57,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:57,750 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:57,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 12:07:57,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 12:07:57,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:07:57,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 12:07:57,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:57,909 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-20 12:07:58,173 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:07:58,174 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-20 12:07:58,792 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 18 treesize of output 20 [2022-11-20 12:07:58,860 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 23 treesize of output 7 [2022-11-20 12:07:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:07:58,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:07:58,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721916204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:58,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:07:58,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [24] total 35 [2022-11-20 12:07:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229841999] [2022-11-20 12:07:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:58,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:07:58,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:58,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:07:58,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 12:07:58,904 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2022-11-20 12:07:58,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 234 transitions, 1595 flow. Second operand has 13 states, 13 states have (on average 93.46153846153847) internal successors, (1215), 13 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:07:58,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:07:58,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2022-11-20 12:07:58,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:02,566 INFO L130 PetriNetUnfolder]: 4398/12894 cut-off events. [2022-11-20 12:08:02,566 INFO L131 PetriNetUnfolder]: For 128548/133242 co-relation queries the response was YES. [2022-11-20 12:08:02,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53612 conditions, 12894 events. 4398/12894 cut-off events. For 128548/133242 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 135614 event pairs, 1206 based on Foata normal form. 348/12326 useless extension candidates. Maximal degree in co-relation 53568. Up to 3870 conditions per place. [2022-11-20 12:08:02,827 INFO L137 encePairwiseOnDemand]: 138/153 looper letters, 130 selfloop transitions, 30 changer transitions 4/267 dead transitions. [2022-11-20 12:08:02,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 267 transitions, 2217 flow [2022-11-20 12:08:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:08:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 12:08:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1350 transitions. [2022-11-20 12:08:02,855 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6302521008403361 [2022-11-20 12:08:02,855 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1350 transitions. [2022-11-20 12:08:02,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1350 transitions. [2022-11-20 12:08:02,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:02,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1350 transitions. [2022-11-20 12:08:02,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.42857142857143) internal successors, (1350), 14 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:02,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 153.0) internal successors, (2295), 15 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:02,867 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 153.0) internal successors, (2295), 15 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:02,867 INFO L175 Difference]: Start difference. First operand has 254 places, 234 transitions, 1595 flow. Second operand 14 states and 1350 transitions. [2022-11-20 12:08:02,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 267 transitions, 2217 flow [2022-11-20 12:08:03,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 267 transitions, 2051 flow, removed 69 selfloop flow, removed 5 redundant places. [2022-11-20 12:08:03,899 INFO L231 Difference]: Finished difference. Result has 245 places, 235 transitions, 1559 flow [2022-11-20 12:08:03,900 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1559, PETRI_PLACES=245, PETRI_TRANSITIONS=235} [2022-11-20 12:08:03,901 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 116 predicate places. [2022-11-20 12:08:03,901 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 235 transitions, 1559 flow [2022-11-20 12:08:03,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 93.46153846153847) internal successors, (1215), 13 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:03,902 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:03,903 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:08:03,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 12:08:04,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 12:08:04,109 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:08:04,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash -865827085, now seen corresponding path program 2 times [2022-11-20 12:08:04,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:04,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437797502] [2022-11-20 12:08:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:04,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:08:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:08,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437797502] [2022-11-20 12:08:08,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437797502] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:08:08,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799490855] [2022-11-20 12:08:08,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:08:08,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:08:08,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:08:08,181 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:08:08,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 12:08:08,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 12:08:08,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:08:08,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 12:08:08,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:08:08,736 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 23 treesize of output 7 [2022-11-20 12:08:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:08:08,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:08:08,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799490855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:08,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:08:08,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [26] total 30 [2022-11-20 12:08:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841081238] [2022-11-20 12:08:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:08,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:08:08,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:08,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:08:08,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2022-11-20 12:08:08,778 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 153 [2022-11-20 12:08:08,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 235 transitions, 1559 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:08,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:08,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 153 [2022-11-20 12:08:08,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:12,265 INFO L130 PetriNetUnfolder]: 4498/13022 cut-off events. [2022-11-20 12:08:12,265 INFO L131 PetriNetUnfolder]: For 80650/84768 co-relation queries the response was YES. [2022-11-20 12:08:12,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50034 conditions, 13022 events. 4498/13022 cut-off events. For 80650/84768 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 136830 event pairs, 1356 based on Foata normal form. 716/12721 useless extension candidates. Maximal degree in co-relation 49990. Up to 3849 conditions per place. [2022-11-20 12:08:12,404 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 133 selfloop transitions, 24 changer transitions 0/280 dead transitions. [2022-11-20 12:08:12,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 280 transitions, 2328 flow [2022-11-20 12:08:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:08:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 12:08:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions. [2022-11-20 12:08:12,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7745098039215687 [2022-11-20 12:08:12,407 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 711 transitions. [2022-11-20 12:08:12,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 711 transitions. [2022-11-20 12:08:12,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:12,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 711 transitions. [2022-11-20 12:08:12,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:12,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:12,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:12,414 INFO L175 Difference]: Start difference. First operand has 245 places, 235 transitions, 1559 flow. Second operand 6 states and 711 transitions. [2022-11-20 12:08:12,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 280 transitions, 2328 flow [2022-11-20 12:08:12,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 280 transitions, 2281 flow, removed 2 selfloop flow, removed 9 redundant places. [2022-11-20 12:08:12,762 INFO L231 Difference]: Finished difference. Result has 241 places, 238 transitions, 1613 flow [2022-11-20 12:08:12,763 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1613, PETRI_PLACES=241, PETRI_TRANSITIONS=238} [2022-11-20 12:08:12,763 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 112 predicate places. [2022-11-20 12:08:12,764 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 238 transitions, 1613 flow [2022-11-20 12:08:12,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:12,764 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:12,765 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:08:12,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 12:08:12,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 12:08:12,967 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:08:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1935395143, now seen corresponding path program 1 times [2022-11-20 12:08:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:12,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457244725] [2022-11-20 12:08:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:12,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:08:13,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:13,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457244725] [2022-11-20 12:08:13,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457244725] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:08:13,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922431938] [2022-11-20 12:08:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:13,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:08:13,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:08:13,087 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:08:13,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 12:08:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:13,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:08:13,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:08:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:08:13,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:08:13,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922431938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:13,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:08:13,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-20 12:08:13,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568211987] [2022-11-20 12:08:13,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:13,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:08:13,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:13,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:08:13,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:08:13,273 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 153 [2022-11-20 12:08:13,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 238 transitions, 1613 flow. Second operand has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:13,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:13,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 153 [2022-11-20 12:08:13,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:15,236 INFO L130 PetriNetUnfolder]: 1365/6376 cut-off events. [2022-11-20 12:08:15,236 INFO L131 PetriNetUnfolder]: For 27687/28335 co-relation queries the response was YES. [2022-11-20 12:08:15,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24171 conditions, 6376 events. 1365/6376 cut-off events. For 27687/28335 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 65067 event pairs, 183 based on Foata normal form. 346/6406 useless extension candidates. Maximal degree in co-relation 24127. Up to 1865 conditions per place. [2022-11-20 12:08:15,294 INFO L137 encePairwiseOnDemand]: 148/153 looper letters, 85 selfloop transitions, 8 changer transitions 0/261 dead transitions. [2022-11-20 12:08:15,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 261 transitions, 2001 flow [2022-11-20 12:08:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:08:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:08:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2022-11-20 12:08:15,296 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2022-11-20 12:08:15,297 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2022-11-20 12:08:15,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2022-11-20 12:08:15,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:15,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2022-11-20 12:08:15,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:15,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:15,302 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:15,302 INFO L175 Difference]: Start difference. First operand has 241 places, 238 transitions, 1613 flow. Second operand 7 states and 882 transitions. [2022-11-20 12:08:15,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 261 transitions, 2001 flow [2022-11-20 12:08:15,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 261 transitions, 1957 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-20 12:08:15,458 INFO L231 Difference]: Finished difference. Result has 242 places, 236 transitions, 1577 flow [2022-11-20 12:08:15,459 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1577, PETRI_PLACES=242, PETRI_TRANSITIONS=236} [2022-11-20 12:08:15,459 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 113 predicate places. [2022-11-20 12:08:15,460 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 236 transitions, 1577 flow [2022-11-20 12:08:15,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:15,460 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:15,461 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:08:15,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-20 12:08:15,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 12:08:15,668 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:08:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash -6626644, now seen corresponding path program 2 times [2022-11-20 12:08:15,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:15,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470742162] [2022-11-20 12:08:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:08:18,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:18,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470742162] [2022-11-20 12:08:18,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470742162] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:08:18,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712482235] [2022-11-20 12:08:18,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:08:18,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:08:18,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:08:18,651 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:08:18,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 12:08:18,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 12:08:18,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:08:18,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 12:08:18,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:08:18,815 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-20 12:08:19,079 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:08:19,080 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-20 12:08:19,636 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 18 treesize of output 20 [2022-11-20 12:08:19,709 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 23 treesize of output 7 [2022-11-20 12:08:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:08:19,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:08:19,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712482235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:08:19,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:08:19,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [20] total 31 [2022-11-20 12:08:19,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870952289] [2022-11-20 12:08:19,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:08:19,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:08:19,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:19,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:08:19,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2022-11-20 12:08:19,756 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2022-11-20 12:08:19,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 236 transitions, 1577 flow. Second operand has 13 states, 13 states have (on average 93.53846153846153) internal successors, (1216), 13 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:19,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:19,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2022-11-20 12:08:19,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:23,121 INFO L130 PetriNetUnfolder]: 4431/12457 cut-off events. [2022-11-20 12:08:23,121 INFO L131 PetriNetUnfolder]: For 80203/84107 co-relation queries the response was YES. [2022-11-20 12:08:23,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48258 conditions, 12457 events. 4431/12457 cut-off events. For 80203/84107 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 128413 event pairs, 1230 based on Foata normal form. 384/11926 useless extension candidates. Maximal degree in co-relation 48216. Up to 3911 conditions per place. [2022-11-20 12:08:23,436 INFO L137 encePairwiseOnDemand]: 138/153 looper letters, 117 selfloop transitions, 32 changer transitions 14/264 dead transitions. [2022-11-20 12:08:23,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 264 transitions, 2102 flow [2022-11-20 12:08:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:08:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 12:08:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1346 transitions. [2022-11-20 12:08:23,452 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6283846872082166 [2022-11-20 12:08:23,454 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1346 transitions. [2022-11-20 12:08:23,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1346 transitions. [2022-11-20 12:08:23,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:23,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1346 transitions. [2022-11-20 12:08:23,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.14285714285714) internal successors, (1346), 14 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:23,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 153.0) internal successors, (2295), 15 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:23,472 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 153.0) internal successors, (2295), 15 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:23,472 INFO L175 Difference]: Start difference. First operand has 242 places, 236 transitions, 1577 flow. Second operand 14 states and 1346 transitions. [2022-11-20 12:08:23,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 264 transitions, 2102 flow [2022-11-20 12:08:23,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 264 transitions, 2087 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-11-20 12:08:23,973 INFO L231 Difference]: Finished difference. Result has 250 places, 232 transitions, 1568 flow [2022-11-20 12:08:23,974 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1568, PETRI_PLACES=250, PETRI_TRANSITIONS=232} [2022-11-20 12:08:23,975 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 121 predicate places. [2022-11-20 12:08:23,975 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 232 transitions, 1568 flow [2022-11-20 12:08:23,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 93.53846153846153) internal successors, (1216), 13 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:23,976 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:23,976 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:08:23,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-20 12:08:24,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 12:08:24,183 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:08:24,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1725937726, now seen corresponding path program 1 times [2022-11-20 12:08:24,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:24,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221635259] [2022-11-20 12:08:24,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:08:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:28,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221635259] [2022-11-20 12:08:28,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221635259] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:08:28,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035442981] [2022-11-20 12:08:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:28,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:08:28,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:08:28,517 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:08:28,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 12:08:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:28,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 12:08:28,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:08:28,685 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-20 12:08:29,096 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:08:29,097 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-20 12:08:30,337 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 18 treesize of output 20 [2022-11-20 12:08:30,446 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 23 treesize of output 7 [2022-11-20 12:08:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:08:30,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:08:30,605 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 2147483649))) is different from false [2022-11-20 12:08:30,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:08:30,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2022-11-20 12:08:30,683 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 12 treesize of output 6 [2022-11-20 12:08:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:08:33,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035442981] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:08:33,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:08:33,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 20] total 63 [2022-11-20 12:08:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690875884] [2022-11-20 12:08:33,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:08:33,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-20 12:08:33,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-20 12:08:33,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=3547, Unknown=1, NotChecked=122, Total=4032 [2022-11-20 12:08:33,386 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 153 [2022-11-20 12:08:33,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 232 transitions, 1568 flow. Second operand has 64 states, 64 states have (on average 73.484375) internal successors, (4703), 64 states have internal predecessors, (4703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:33,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:33,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 153 [2022-11-20 12:08:33,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:08:44,197 INFO L130 PetriNetUnfolder]: 5458/14851 cut-off events. [2022-11-20 12:08:44,197 INFO L131 PetriNetUnfolder]: For 99774/103791 co-relation queries the response was YES. [2022-11-20 12:08:44,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58449 conditions, 14851 events. 5458/14851 cut-off events. For 99774/103791 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 155422 event pairs, 796 based on Foata normal form. 884/14881 useless extension candidates. Maximal degree in co-relation 58408. Up to 4050 conditions per place. [2022-11-20 12:08:44,364 INFO L137 encePairwiseOnDemand]: 118/153 looper letters, 239 selfloop transitions, 119 changer transitions 0/418 dead transitions. [2022-11-20 12:08:44,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 418 transitions, 4105 flow [2022-11-20 12:08:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-20 12:08:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-11-20 12:08:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3234 transitions. [2022-11-20 12:08:44,370 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4915640674874601 [2022-11-20 12:08:44,371 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3234 transitions. [2022-11-20 12:08:44,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3234 transitions. [2022-11-20 12:08:44,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:08:44,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3234 transitions. [2022-11-20 12:08:44,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 75.20930232558139) internal successors, (3234), 43 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:44,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 153.0) internal successors, (6732), 44 states have internal predecessors, (6732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:44,390 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 153.0) internal successors, (6732), 44 states have internal predecessors, (6732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:44,390 INFO L175 Difference]: Start difference. First operand has 250 places, 232 transitions, 1568 flow. Second operand 43 states and 3234 transitions. [2022-11-20 12:08:44,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 418 transitions, 4105 flow [2022-11-20 12:08:45,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 418 transitions, 3964 flow, removed 5 selfloop flow, removed 16 redundant places. [2022-11-20 12:08:45,166 INFO L231 Difference]: Finished difference. Result has 280 places, 304 transitions, 2536 flow [2022-11-20 12:08:45,166 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=2536, PETRI_PLACES=280, PETRI_TRANSITIONS=304} [2022-11-20 12:08:45,167 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 151 predicate places. [2022-11-20 12:08:45,167 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 304 transitions, 2536 flow [2022-11-20 12:08:45,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 73.484375) internal successors, (4703), 64 states have internal predecessors, (4703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:45,168 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:08:45,168 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:08:45,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 12:08:45,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:08:45,369 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:08:45,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:08:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash -226525278, now seen corresponding path program 1 times [2022-11-20 12:08:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:08:45,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716083578] [2022-11-20 12:08:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:08:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:08:49,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:08:49,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716083578] [2022-11-20 12:08:49,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716083578] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:08:49,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071166899] [2022-11-20 12:08:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:08:49,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:08:49,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:08:49,085 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:08:49,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 12:08:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:08:49,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 12:08:49,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:08:49,257 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-20 12:08:49,649 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:08:49,649 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-20 12:08:50,792 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 18 treesize of output 20 [2022-11-20 12:08:50,953 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 23 treesize of output 7 [2022-11-20 12:08:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:08:51,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:08:51,114 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 (Array Int Int))) (< 0 (+ c_~s~0 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) is different from false [2022-11-20 12:08:51,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:08:51,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2022-11-20 12:08:51,176 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 12 treesize of output 6 [2022-11-20 12:08:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:08:53,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071166899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:08:53,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:08:53,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 20] total 62 [2022-11-20 12:08:53,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091317289] [2022-11-20 12:08:53,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:08:53,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-20 12:08:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:53,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-20 12:08:53,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=3410, Unknown=1, NotChecked=120, Total=3906 [2022-11-20 12:08:53,732 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 153 [2022-11-20 12:08:53,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 304 transitions, 2536 flow. Second operand has 63 states, 63 states have (on average 73.57142857142857) internal successors, (4635), 63 states have internal predecessors, (4635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:08:53,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:08:53,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 153 [2022-11-20 12:08:53,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:09:04,358 INFO L130 PetriNetUnfolder]: 5639/15397 cut-off events. [2022-11-20 12:09:04,359 INFO L131 PetriNetUnfolder]: For 111706/116551 co-relation queries the response was YES. [2022-11-20 12:09:04,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66406 conditions, 15397 events. 5639/15397 cut-off events. For 111706/116551 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 162637 event pairs, 1267 based on Foata normal form. 1040/15461 useless extension candidates. Maximal degree in co-relation 66360. Up to 3532 conditions per place. [2022-11-20 12:09:04,499 INFO L137 encePairwiseOnDemand]: 121/153 looper letters, 307 selfloop transitions, 122 changer transitions 0/489 dead transitions. [2022-11-20 12:09:04,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 489 transitions, 5404 flow [2022-11-20 12:09:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 12:09:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-11-20 12:09:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2958 transitions. [2022-11-20 12:09:04,504 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2022-11-20 12:09:04,505 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 2958 transitions. [2022-11-20 12:09:04,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 2958 transitions. [2022-11-20 12:09:04,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:09:04,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2958 transitions. [2022-11-20 12:09:04,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 75.84615384615384) internal successors, (2958), 39 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:09:04,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 153.0) internal successors, (6120), 40 states have internal predecessors, (6120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:09:04,519 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 153.0) internal successors, (6120), 40 states have internal predecessors, (6120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:09:04,519 INFO L175 Difference]: Start difference. First operand has 280 places, 304 transitions, 2536 flow. Second operand 39 states and 2958 transitions. [2022-11-20 12:09:04,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 489 transitions, 5404 flow [2022-11-20 12:09:05,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 489 transitions, 5281 flow, removed 30 selfloop flow, removed 24 redundant places. [2022-11-20 12:09:05,286 INFO L231 Difference]: Finished difference. Result has 300 places, 330 transitions, 3193 flow [2022-11-20 12:09:05,287 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2437, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=3193, PETRI_PLACES=300, PETRI_TRANSITIONS=330} [2022-11-20 12:09:05,287 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 171 predicate places. [2022-11-20 12:09:05,287 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 330 transitions, 3193 flow [2022-11-20 12:09:05,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 73.57142857142857) internal successors, (4635), 63 states have internal predecessors, (4635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:09:05,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:09:05,289 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:09:05,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-20 12:09:05,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:05,505 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:09:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:05,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1895659313, now seen corresponding path program 2 times [2022-11-20 12:09:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:05,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132432497] [2022-11-20 12:09:05,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:05,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:05,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132432497] [2022-11-20 12:09:05,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132432497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:09:05,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860971742] [2022-11-20 12:09:05,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:09:05,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:05,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:05,799 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:05,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 12:09:05,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 12:09:05,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:09:05,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:09:05,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-20 12:09:06,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:09:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-20 12:09:06,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860971742] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:09:06,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:09:06,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2022-11-20 12:09:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325080797] [2022-11-20 12:09:06,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:09:06,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 12:09:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 12:09:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:09:06,336 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 153 [2022-11-20 12:09:06,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 330 transitions, 3193 flow. Second operand has 16 states, 16 states have (on average 98.375) internal successors, (1574), 16 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:09:06,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:09:06,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 153 [2022-11-20 12:09:06,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:09:08,427 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([528] L71-1-->L72: Formula: (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_17| v_~s~0_6) v_~s~0_5) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_6} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0][424], [Black: 1660#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1)), Black: 3934#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3924#(and (or (<= ~n~0 1) (<= (+ (* ~q_back~0 4) ~q~0.offset) 0)) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 1976#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2301#(and (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 1)))) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 3948#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 |thread2Thread1of1ForFork1_~j~0#1|) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3950#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 2285#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((|ULTIMATE.start_create_fresh_int_array_~i~1#1| Int)) (and (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 104#L58true, 3954#(and (< 0 (+ 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2281#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 2276#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 1669#true, thread2Thread1of1ForFork1InUse, 6514#(< 0 (+ 2147483650 ~s~0)), 2614#true, 7263#(< 0 (+ 2147483650 ~s~0)), 80#L94-1true, Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 4587#true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), 4567#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 3)), Black: 162#true, Black: 7366#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7372#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7370#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0)), Black: 7363#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (or (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= (+ ~q~0.offset (* ~q_front~0 4)) 3)) (<= ~q_front~0 1)) (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= ~q_front~0 0) (<= 0 ~q_front~0)))), Black: 6653#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7374#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 2937#(forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), Black: 4547#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 3295#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 3282#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (= ~s~0 0)), Black: 3297#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0)), Black: 3257#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (* ~q_front~0 4))) ~s~0) 2147483648) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 4589#(<= ~q_back~0 ~q_front~0), Black: 6590#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 3206#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 6594#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= ~q_front~0 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483648)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (= ~q_front~0 ~q_back~0)), Black: 4590#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 2920#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6633#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6252#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6624#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (= ~q~0.offset 0) (<= 0 ~q_front~0) (<= ~q_front~0 1) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 3276#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 6631#(and (= ~s~0 0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 8029#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 2147483647)), Black: 6266#(< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)), 5269#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), Black: 5917#true, 78#L72true, Black: 6259#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3936#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3952#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0)))), Black: 3942#(and (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0)), Black: 3946#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1656#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3956#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1658#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1))]) [2022-11-20 12:09:08,428 INFO L383 tUnfolder$Statistics]: this new event has 126 ancestors and is cut-off event [2022-11-20 12:09:08,428 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-20 12:09:08,428 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-20 12:09:08,429 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-20 12:09:08,430 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([528] L71-1-->L72: Formula: (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_17| v_~s~0_6) v_~s~0_5) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_6} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0][424], [Black: 1660#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1)), Black: 3934#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3924#(and (or (<= ~n~0 1) (<= (+ (* ~q_back~0 4) ~q~0.offset) 0)) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 1976#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2301#(and (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 1)))) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 3948#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 |thread2Thread1of1ForFork1_~j~0#1|) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3950#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 2285#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((|ULTIMATE.start_create_fresh_int_array_~i~1#1| Int)) (and (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 3954#(and (< 0 (+ 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2281#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 2276#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 1669#true, thread2Thread1of1ForFork1InUse, 8057#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 2147483647) (<= |thread1Thread1of1ForFork0_~i~0#1| 2147483646)), 6514#(< 0 (+ 2147483650 ~s~0)), 2614#true, 7263#(< 0 (+ 2147483650 ~s~0)), 80#L94-1true, Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 4587#true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), 4567#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 3)), Black: 162#true, Black: 7366#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7372#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7370#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0)), Black: 7363#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (or (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= (+ ~q~0.offset (* ~q_front~0 4)) 3)) (<= ~q_front~0 1)) (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= ~q_front~0 0) (<= 0 ~q_front~0)))), Black: 6653#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), 22#L52true, Black: 7374#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 2937#(forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), Black: 4547#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 3295#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 3282#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (= ~s~0 0)), Black: 3297#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0)), Black: 3257#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (* ~q_front~0 4))) ~s~0) 2147483648) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 4589#(<= ~q_back~0 ~q_front~0), Black: 6590#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 3206#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 6594#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= ~q_front~0 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483648)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (= ~q_front~0 ~q_back~0)), Black: 4590#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 2920#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6633#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6252#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6624#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (= ~q~0.offset 0) (<= 0 ~q_front~0) (<= ~q_front~0 1) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 3276#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 6631#(and (= ~s~0 0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6266#(< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)), 5269#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), Black: 5917#true, 78#L72true, Black: 6259#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3936#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3952#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0)))), Black: 3942#(and (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0)), Black: 3946#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1656#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3956#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1658#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1))]) [2022-11-20 12:09:08,432 INFO L383 tUnfolder$Statistics]: this new event has 126 ancestors and is cut-off event [2022-11-20 12:09:08,432 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-20 12:09:08,432 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-20 12:09:08,550 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-20 12:09:09,067 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([528] L71-1-->L72: Formula: (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_17| v_~s~0_6) v_~s~0_5) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_6} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0][424], [Black: 3934#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 1660#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1)), Black: 3924#(and (or (<= ~n~0 1) (<= (+ (* ~q_back~0 4) ~q~0.offset) 0)) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 1976#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2301#(and (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 1)))) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 3948#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 |thread2Thread1of1ForFork1_~j~0#1|) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3950#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 2285#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((|ULTIMATE.start_create_fresh_int_array_~i~1#1| Int)) (and (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 104#L58true, Black: 2281#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 3954#(and (< 0 (+ 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2276#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 1669#true, thread2Thread1of1ForFork1InUse, 6514#(< 0 (+ 2147483650 ~s~0)), 2614#true, 7263#(< 0 (+ 2147483650 ~s~0)), 80#L94-1true, Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 4587#true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 7366#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7372#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7370#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0)), Black: 7363#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (or (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= (+ ~q~0.offset (* ~q_front~0 4)) 3)) (<= ~q_front~0 1)) (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= ~q_front~0 0) (<= 0 ~q_front~0)))), Black: 6653#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7374#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 162#true, Black: 4547#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 2937#(forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), Black: 3295#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 3282#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (= ~s~0 0)), Black: 3297#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0)), Black: 6590#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 3257#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (* ~q_front~0 4))) ~s~0) 2147483648) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 4589#(<= ~q_back~0 ~q_front~0), Black: 6594#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= ~q_front~0 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483648)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (= ~q_front~0 ~q_back~0)), 4573#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (<= ~n~0 2147483647)), Black: 4590#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 3206#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 2920#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6633#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6252#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 3276#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 6624#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (= ~q~0.offset 0) (<= 0 ~q_front~0) (<= ~q_front~0 1) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6631#(and (= ~s~0 0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 8029#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 2147483647)), Black: 6266#(< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)), 78#L72true, Black: 5917#true, 5269#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), Black: 6259#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3936#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3952#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0)))), Black: 3942#(and (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0)), Black: 3946#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1656#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3956#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1658#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1))]) [2022-11-20 12:09:09,068 INFO L383 tUnfolder$Statistics]: this new event has 135 ancestors and is cut-off event [2022-11-20 12:09:09,069 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-20 12:09:09,069 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-20 12:09:09,069 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-20 12:09:09,070 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([528] L71-1-->L72: Formula: (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_17| v_~s~0_6) v_~s~0_5) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_6} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0][424], [Black: 3934#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 1660#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1)), Black: 3924#(and (or (<= ~n~0 1) (<= (+ (* ~q_back~0 4) ~q~0.offset) 0)) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 1976#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2301#(and (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 1)))) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 3948#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 |thread2Thread1of1ForFork1_~j~0#1|) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3950#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 2285#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((|ULTIMATE.start_create_fresh_int_array_~i~1#1| Int)) (and (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 2281#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 3954#(and (< 0 (+ 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2276#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 1669#true, thread2Thread1of1ForFork1InUse, 8057#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 2147483647) (<= |thread1Thread1of1ForFork0_~i~0#1| 2147483646)), 6514#(< 0 (+ 2147483650 ~s~0)), 2614#true, 7263#(< 0 (+ 2147483650 ~s~0)), 80#L94-1true, Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 4587#true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 7366#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7372#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7370#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0)), Black: 7363#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (or (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= (+ ~q~0.offset (* ~q_front~0 4)) 3)) (<= ~q_front~0 1)) (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= ~q_front~0 0) (<= 0 ~q_front~0)))), Black: 6653#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), 22#L52true, Black: 7374#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 162#true, Black: 4547#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 2937#(forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), Black: 3295#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 3282#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (= ~s~0 0)), Black: 3297#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0)), Black: 6590#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 3257#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (* ~q_front~0 4))) ~s~0) 2147483648) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 4589#(<= ~q_back~0 ~q_front~0), Black: 6594#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= ~q_front~0 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483648)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (= ~q_front~0 ~q_back~0)), 4573#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (<= ~n~0 2147483647)), Black: 4590#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 3206#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 2920#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6633#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6252#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 3276#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 6624#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (= ~q~0.offset 0) (<= 0 ~q_front~0) (<= ~q_front~0 1) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6631#(and (= ~s~0 0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6266#(< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)), Black: 5917#true, 78#L72true, 5269#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), Black: 6259#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3936#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3952#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0)))), Black: 3942#(and (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0)), Black: 3946#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1656#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3956#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1658#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1))]) [2022-11-20 12:09:09,071 INFO L383 tUnfolder$Statistics]: this new event has 135 ancestors and is cut-off event [2022-11-20 12:09:09,071 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-20 12:09:09,072 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-20 12:09:09,072 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-20 12:09:09,905 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([528] L71-1-->L72: Formula: (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_17| v_~s~0_6) v_~s~0_5) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_6} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0][424], [Black: 3934#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 1660#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1)), Black: 3924#(and (or (<= ~n~0 1) (<= (+ (* ~q_back~0 4) ~q~0.offset) 0)) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 1976#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2301#(and (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 1)))) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 3948#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 |thread2Thread1of1ForFork1_~j~0#1|) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3950#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 2285#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((|ULTIMATE.start_create_fresh_int_array_~i~1#1| Int)) (and (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 104#L58true, 3954#(and (< 0 (+ 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2281#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 2276#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 1669#true, thread2Thread1of1ForFork1InUse, 6514#(< 0 (+ 2147483650 ~s~0)), 2614#true, 4579#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 7263#(< 0 (+ 2147483650 ~s~0)), 80#L94-1true, Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 4587#true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 7366#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7372#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7370#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0)), Black: 7363#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (or (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= (+ ~q~0.offset (* ~q_front~0 4)) 3)) (<= ~q_front~0 1)) (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= ~q_front~0 0) (<= 0 ~q_front~0)))), Black: 6653#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7374#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 162#true, Black: 2937#(forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), Black: 4547#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 3295#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 3282#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (= ~s~0 0)), Black: 3297#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0)), Black: 6590#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 3257#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (* ~q_front~0 4))) ~s~0) 2147483648) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 4589#(<= ~q_back~0 ~q_front~0), Black: 3206#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 4590#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 6594#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= ~q_front~0 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483648)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (= ~q_front~0 ~q_back~0)), Black: 2920#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6633#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6252#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 3276#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 6624#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (= ~q~0.offset 0) (<= 0 ~q_front~0) (<= ~q_front~0 1) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6631#(and (= ~s~0 0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 8029#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 2147483647)), Black: 6266#(< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)), 78#L72true, Black: 5917#true, 5269#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), Black: 6259#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3936#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3952#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0)))), Black: 3942#(and (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0)), Black: 3946#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1656#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3956#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1658#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1))]) [2022-11-20 12:09:09,906 INFO L383 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-11-20 12:09:09,906 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-20 12:09:09,906 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-20 12:09:09,907 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-20 12:09:09,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([528] L71-1-->L72: Formula: (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_17| v_~s~0_6) v_~s~0_5) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_6} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0][424], [Black: 3934#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 1660#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1)), Black: 3924#(and (or (<= ~n~0 1) (<= (+ (* ~q_back~0 4) ~q~0.offset) 0)) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 1976#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2301#(and (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 1)))) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 3948#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 |thread2Thread1of1ForFork1_~j~0#1|) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3950#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 2285#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((|ULTIMATE.start_create_fresh_int_array_~i~1#1| Int)) (and (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 3954#(and (< 0 (+ 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2281#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 2276#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 1669#true, thread2Thread1of1ForFork1InUse, 8057#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 2147483647) (<= |thread1Thread1of1ForFork0_~i~0#1| 2147483646)), 6514#(< 0 (+ 2147483650 ~s~0)), 2614#true, 4579#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 7263#(< 0 (+ 2147483650 ~s~0)), 80#L94-1true, Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 4587#true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 7366#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7372#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7370#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0)), Black: 7363#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (or (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= (+ ~q~0.offset (* ~q_front~0 4)) 3)) (<= ~q_front~0 1)) (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= ~q_front~0 0) (<= 0 ~q_front~0)))), Black: 6653#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), 22#L52true, Black: 7374#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 162#true, Black: 2937#(forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), Black: 4547#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 3295#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 3282#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (= ~s~0 0)), Black: 3297#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0)), Black: 6590#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 3257#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (* ~q_front~0 4))) ~s~0) 2147483648) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 4589#(<= ~q_back~0 ~q_front~0), Black: 3206#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 4590#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 6594#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= ~q_front~0 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483648)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (= ~q_front~0 ~q_back~0)), Black: 2920#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6633#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6252#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 3276#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 6624#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (= ~q~0.offset 0) (<= 0 ~q_front~0) (<= ~q_front~0 1) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6631#(and (= ~s~0 0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6266#(< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)), 78#L72true, Black: 5917#true, 5269#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), Black: 6259#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3936#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3952#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0)))), Black: 3942#(and (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0)), Black: 3946#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1656#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3956#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1658#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1))]) [2022-11-20 12:09:09,909 INFO L383 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-11-20 12:09:09,909 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-20 12:09:09,909 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-20 12:09:09,910 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-20 12:09:10,473 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([528] L71-1-->L72: Formula: (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_17| v_~s~0_6) v_~s~0_5) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_6} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0][424], [Black: 3934#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 1660#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1)), Black: 3924#(and (or (<= ~n~0 1) (<= (+ (* ~q_back~0 4) ~q~0.offset) 0)) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 1976#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2301#(and (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 1)))) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 3948#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 |thread2Thread1of1ForFork1_~j~0#1|) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3950#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 2285#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((|ULTIMATE.start_create_fresh_int_array_~i~1#1| Int)) (and (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 104#L58true, Black: 2281#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 3954#(and (< 0 (+ 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2276#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 1669#true, thread2Thread1of1ForFork1InUse, 6514#(< 0 (+ 2147483650 ~s~0)), 2614#true, 7263#(< 0 (+ 2147483650 ~s~0)), 80#L94-1true, Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 4587#true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), 4547#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 7366#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7372#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7370#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0)), Black: 7363#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (or (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= (+ ~q~0.offset (* ~q_front~0 4)) 3)) (<= ~q_front~0 1)) (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= ~q_front~0 0) (<= 0 ~q_front~0)))), Black: 6653#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7374#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 162#true, Black: 2937#(forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), Black: 3295#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 3282#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (= ~s~0 0)), Black: 3297#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0)), Black: 6590#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 4589#(<= ~q_back~0 ~q_front~0), Black: 3257#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (* ~q_front~0 4))) ~s~0) 2147483648) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 4590#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 3206#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 6594#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= ~q_front~0 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483648)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (= ~q_front~0 ~q_back~0)), Black: 2920#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6633#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6252#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 3276#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 6624#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (= ~q~0.offset 0) (<= 0 ~q_front~0) (<= ~q_front~0 1) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6631#(and (= ~s~0 0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 8029#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 2147483647)), Black: 6266#(< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)), Black: 5917#true, 5269#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 78#L72true, Black: 6259#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3936#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3952#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0)))), Black: 3942#(and (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0)), Black: 3946#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1656#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3956#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1658#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1))]) [2022-11-20 12:09:10,474 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is cut-off event [2022-11-20 12:09:10,474 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 12:09:10,474 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 12:09:10,474 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 12:09:10,475 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([528] L71-1-->L72: Formula: (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_17| v_~s~0_6) v_~s~0_5) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_6} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_17|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0][424], [Black: 3934#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 1660#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1)), Black: 3924#(and (or (<= ~n~0 1) (<= (+ (* ~q_back~0 4) ~q~0.offset) 0)) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 1976#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2301#(and (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_13| 1)))) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 3948#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 |thread2Thread1of1ForFork1_~j~0#1|) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3950#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 2285#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((|ULTIMATE.start_create_fresh_int_array_~i~1#1| Int)) (and (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 2281#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 3954#(and (< 0 (+ 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2276#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), 1669#true, thread2Thread1of1ForFork1InUse, 8057#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 2147483647) (<= |thread1Thread1of1ForFork0_~i~0#1| 2147483646)), 6514#(< 0 (+ 2147483650 ~s~0)), 2614#true, 7263#(< 0 (+ 2147483650 ~s~0)), 80#L94-1true, Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 4587#true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), 4547#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 7366#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7372#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7370#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0)), Black: 7363#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~q~0.offset 0) (= ~s~0 0) (or (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= (+ ~q~0.offset (* ~q_front~0 4)) 3)) (<= ~q_front~0 1)) (and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= ~q_front~0 0) (<= 0 ~q_front~0)))), 22#L52true, Black: 6653#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0)), Black: 7374#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 162#true, Black: 2937#(forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), Black: 3295#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 3282#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (= ~s~0 0)), Black: 3297#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0)), Black: 6590#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 4589#(<= ~q_back~0 ~q_front~0), Black: 3257#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (* ~q_front~0 4))) ~s~0) 2147483648) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_200) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 4590#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 3206#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~s~0 0)), Black: 6594#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (<= ~q_front~0 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= ~q_front~0 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#t~nondet20#1| 2147483648)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))) (<= ~q_front~0 0)) (= ~q_front~0 ~q_back~0)), Black: 2920#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6633#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6252#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 3276#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (not (<= (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (forall ((v_ArrVal_201 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0)), Black: 6624#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (= ~q~0.offset 0) (<= 0 ~q_front~0) (<= ~q_front~0 1) (= ~s~0 0) (forall ((v_ArrVal_411 (Array Int Int))) (< 0 (+ 2147483649 ~s~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))))), Black: 6631#(and (= ~s~0 0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6266#(< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)), Black: 5917#true, 5269#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 78#L72true, Black: 6259#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3936#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0)), Black: 3952#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0)))), Black: 3942#(and (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0)) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (= ~s~0 0)), Black: 3946#(and (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (= ~s~0 0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1656#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3956#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (< 0 (+ 2147483649 ~s~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0)) (or (and (< 0 (+ 2147483649 ~s~0)) (= (* ~q_back~0 4) (* ~q_front~0 4))) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), Black: 1658#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |thread1Thread1of1ForFork0_#t~post1#1| 1))]) [2022-11-20 12:09:10,475 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is cut-off event [2022-11-20 12:09:10,476 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 12:09:10,476 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 12:09:10,476 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 12:09:10,934 INFO L130 PetriNetUnfolder]: 3064/11368 cut-off events. [2022-11-20 12:09:10,934 INFO L131 PetriNetUnfolder]: For 92002/92974 co-relation queries the response was YES. [2022-11-20 12:09:11,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53331 conditions, 11368 events. 3064/11368 cut-off events. For 92002/92974 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 124794 event pairs, 267 based on Foata normal form. 726/11386 useless extension candidates. Maximal degree in co-relation 53279. Up to 2048 conditions per place. [2022-11-20 12:09:11,056 INFO L137 encePairwiseOnDemand]: 133/153 looper letters, 276 selfloop transitions, 60 changer transitions 2/502 dead transitions. [2022-11-20 12:09:11,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 502 transitions, 6177 flow [2022-11-20 12:09:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 12:09:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-11-20 12:09:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2716 transitions. [2022-11-20 12:09:11,062 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6339869281045751 [2022-11-20 12:09:11,063 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2716 transitions. [2022-11-20 12:09:11,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2716 transitions. [2022-11-20 12:09:11,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:09:11,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2716 transitions. [2022-11-20 12:09:11,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 97.0) internal successors, (2716), 28 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:09:11,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 153.0) internal successors, (4437), 29 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:09:11,074 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 153.0) internal successors, (4437), 29 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:09:11,074 INFO L175 Difference]: Start difference. First operand has 300 places, 330 transitions, 3193 flow. Second operand 28 states and 2716 transitions. [2022-11-20 12:09:11,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 502 transitions, 6177 flow [2022-11-20 12:09:11,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 502 transitions, 5940 flow, removed 49 selfloop flow, removed 30 redundant places. [2022-11-20 12:09:11,707 INFO L231 Difference]: Finished difference. Result has 300 places, 350 transitions, 3430 flow [2022-11-20 12:09:11,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2969, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3430, PETRI_PLACES=300, PETRI_TRANSITIONS=350} [2022-11-20 12:09:11,708 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 171 predicate places. [2022-11-20 12:09:11,708 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 350 transitions, 3430 flow [2022-11-20 12:09:11,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 98.375) internal successors, (1574), 16 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:09:11,709 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:09:11,709 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:09:11,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:11,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:11,916 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:09:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1060548235, now seen corresponding path program 1 times [2022-11-20 12:09:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:11,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325977837] [2022-11-20 12:09:11,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:14,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:14,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325977837] [2022-11-20 12:09:14,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325977837] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:09:14,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520696441] [2022-11-20 12:09:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:14,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:14,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:14,067 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:14,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 12:09:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:14,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-20 12:09:14,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:14,251 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-20 12:09:14,588 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:09:14,588 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-20 12:09:15,688 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 18 treesize of output 20 [2022-11-20 12:09:16,304 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-11-20 12:09:16,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-11-20 12:09:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:16,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:09:16,953 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-20 12:09:16,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 115 [2022-11-20 12:09:16,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:09:16,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 55 [2022-11-20 12:09:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:21,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520696441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:09:21,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:09:21,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 68 [2022-11-20 12:09:21,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444506779] [2022-11-20 12:09:21,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:09:21,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-20 12:09:21,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:21,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-20 12:09:21,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=4266, Unknown=5, NotChecked=0, Total=4692 [2022-11-20 12:09:21,136 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 153 [2022-11-20 12:09:21,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 350 transitions, 3430 flow. Second operand has 69 states, 69 states have (on average 76.34782608695652) internal successors, (5268), 69 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:09:21,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:09:21,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 153 [2022-11-20 12:09:21,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:09:59,062 WARN L233 SmtUtils]: Spent 32.78s on a formula simplification. DAG size of input: 99 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:10:07,986 INFO L130 PetriNetUnfolder]: 4913/13857 cut-off events. [2022-11-20 12:10:07,986 INFO L131 PetriNetUnfolder]: For 128937/133732 co-relation queries the response was YES. [2022-11-20 12:10:08,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63960 conditions, 13857 events. 4913/13857 cut-off events. For 128937/133732 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 145635 event pairs, 1102 based on Foata normal form. 1065/14258 useless extension candidates. Maximal degree in co-relation 63906. Up to 2755 conditions per place. [2022-11-20 12:10:08,118 INFO L137 encePairwiseOnDemand]: 119/153 looper letters, 288 selfloop transitions, 155 changer transitions 9/528 dead transitions. [2022-11-20 12:10:08,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 528 transitions, 5923 flow [2022-11-20 12:10:08,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 12:10:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-11-20 12:10:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3546 transitions. [2022-11-20 12:10:08,124 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.515032679738562 [2022-11-20 12:10:08,124 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3546 transitions. [2022-11-20 12:10:08,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3546 transitions. [2022-11-20 12:10:08,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:10:08,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3546 transitions. [2022-11-20 12:10:08,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 78.8) internal successors, (3546), 45 states have internal predecessors, (3546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:10:08,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 153.0) internal successors, (7038), 46 states have internal predecessors, (7038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:10:08,139 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 153.0) internal successors, (7038), 46 states have internal predecessors, (7038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:10:08,139 INFO L175 Difference]: Start difference. First operand has 300 places, 350 transitions, 3430 flow. Second operand 45 states and 3546 transitions. [2022-11-20 12:10:08,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 528 transitions, 5923 flow [2022-11-20 12:10:08,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 528 transitions, 5885 flow, removed 0 selfloop flow, removed 14 redundant places. [2022-11-20 12:10:08,836 INFO L231 Difference]: Finished difference. Result has 340 places, 393 transitions, 4488 flow [2022-11-20 12:10:08,837 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3392, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=4488, PETRI_PLACES=340, PETRI_TRANSITIONS=393} [2022-11-20 12:10:08,837 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 211 predicate places. [2022-11-20 12:10:08,837 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 393 transitions, 4488 flow [2022-11-20 12:10:08,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 76.34782608695652) internal successors, (5268), 69 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:10:08,838 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:10:08,838 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:10:08,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 12:10:09,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:10:09,039 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:10:09,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:10:09,039 INFO L85 PathProgramCache]: Analyzing trace with hash -917972885, now seen corresponding path program 2 times [2022-11-20 12:10:09,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:10:09,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347547421] [2022-11-20 12:10:09,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:10:09,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:10:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:10:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:10:10,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347547421] [2022-11-20 12:10:10,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347547421] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:10:10,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109067499] [2022-11-20 12:10:10,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:10:10,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:10:10,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:10:10,601 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:10:10,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 12:10:10,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:10:10,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:10:10,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-20 12:10:10,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:10:11,927 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 15 treesize of output 11 [2022-11-20 12:10:12,690 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-20 12:10:12,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:10:12,968 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 18 treesize of output 20 [2022-11-20 12:10:13,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:10:13,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 13 [2022-11-20 12:10:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:10:13,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:10:16,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:10:16,292 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 118 treesize of output 82 [2022-11-20 12:10:16,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:10:16,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 236 [2022-11-20 12:10:16,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:10:16,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 146 [2022-11-20 12:10:16,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:10:16,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 143 [2022-11-20 12:10:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:10:19,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109067499] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:10:19,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:10:19,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25] total 69 [2022-11-20 12:10:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766410479] [2022-11-20 12:10:19,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:10:19,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-20 12:10:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:10:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-20 12:10:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=4401, Unknown=15, NotChecked=0, Total=4830 [2022-11-20 12:10:19,748 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 153 [2022-11-20 12:10:19,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 393 transitions, 4488 flow. Second operand has 70 states, 70 states have (on average 78.27142857142857) internal successors, (5479), 70 states have internal predecessors, (5479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:10:19,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:10:19,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 153 [2022-11-20 12:10:19,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:10:37,238 INFO L130 PetriNetUnfolder]: 5351/15863 cut-off events. [2022-11-20 12:10:37,238 INFO L131 PetriNetUnfolder]: For 159155/164376 co-relation queries the response was YES. [2022-11-20 12:10:37,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75003 conditions, 15863 events. 5351/15863 cut-off events. For 159155/164376 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 172230 event pairs, 698 based on Foata normal form. 1384/16503 useless extension candidates. Maximal degree in co-relation 74940. Up to 2669 conditions per place. [2022-11-20 12:10:37,415 INFO L137 encePairwiseOnDemand]: 121/153 looper letters, 321 selfloop transitions, 231 changer transitions 26/657 dead transitions. [2022-11-20 12:10:37,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 657 transitions, 8105 flow [2022-11-20 12:10:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-20 12:10:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2022-11-20 12:10:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 5472 transitions. [2022-11-20 12:10:37,422 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5259515570934256 [2022-11-20 12:10:37,422 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 5472 transitions. [2022-11-20 12:10:37,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 5472 transitions. [2022-11-20 12:10:37,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:10:37,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 5472 transitions. [2022-11-20 12:10:37,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 80.47058823529412) internal successors, (5472), 68 states have internal predecessors, (5472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:10:37,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 153.0) internal successors, (10557), 69 states have internal predecessors, (10557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:10:37,448 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 153.0) internal successors, (10557), 69 states have internal predecessors, (10557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:10:37,449 INFO L175 Difference]: Start difference. First operand has 340 places, 393 transitions, 4488 flow. Second operand 68 states and 5472 transitions. [2022-11-20 12:10:37,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 657 transitions, 8105 flow [2022-11-20 12:10:39,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 657 transitions, 7888 flow, removed 49 selfloop flow, removed 25 redundant places. [2022-11-20 12:10:39,299 INFO L231 Difference]: Finished difference. Result has 397 places, 456 transitions, 6039 flow [2022-11-20 12:10:39,300 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4297, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=6039, PETRI_PLACES=397, PETRI_TRANSITIONS=456} [2022-11-20 12:10:39,300 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 268 predicate places. [2022-11-20 12:10:39,300 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 456 transitions, 6039 flow [2022-11-20 12:10:39,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 78.27142857142857) internal successors, (5479), 70 states have internal predecessors, (5479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:10:39,301 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:10:39,301 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:10:39,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 12:10:39,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:10:39,502 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:10:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:10:39,503 INFO L85 PathProgramCache]: Analyzing trace with hash -835496331, now seen corresponding path program 1 times [2022-11-20 12:10:39,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:10:39,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436020546] [2022-11-20 12:10:39,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:10:39,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:10:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:10:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:10:41,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436020546] [2022-11-20 12:10:41,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436020546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:10:41,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121061321] [2022-11-20 12:10:41,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:10:41,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:10:41,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:10:41,509 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:10:41,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 12:10:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:41,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-20 12:10:41,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:10:41,679 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-20 12:10:42,062 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:10:42,062 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-20 12:10:43,264 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 18 treesize of output 20 [2022-11-20 12:10:43,988 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-11-20 12:10:43,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-11-20 12:10:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:10:44,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:10:44,694 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-20 12:10:44,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 115 [2022-11-20 12:10:44,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:10:44,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 55 [2022-11-20 12:10:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:10:49,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121061321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:10:49,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:10:49,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 68 [2022-11-20 12:10:49,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108112464] [2022-11-20 12:10:49,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:10:49,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-20 12:10:49,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:10:49,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-20 12:10:49,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=4270, Unknown=7, NotChecked=0, Total=4692 [2022-11-20 12:10:49,366 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 153 [2022-11-20 12:10:49,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 456 transitions, 6039 flow. Second operand has 69 states, 69 states have (on average 76.34782608695652) internal successors, (5268), 69 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:10:49,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:10:49,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 153 [2022-11-20 12:10:49,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:07,255 INFO L130 PetriNetUnfolder]: 6156/17536 cut-off events. [2022-11-20 12:11:07,256 INFO L131 PetriNetUnfolder]: For 259311/265904 co-relation queries the response was YES. [2022-11-20 12:11:07,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93878 conditions, 17536 events. 6156/17536 cut-off events. For 259311/265904 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 190843 event pairs, 1456 based on Foata normal form. 1351/17943 useless extension candidates. Maximal degree in co-relation 93799. Up to 4451 conditions per place. [2022-11-20 12:11:07,471 INFO L137 encePairwiseOnDemand]: 119/153 looper letters, 348 selfloop transitions, 237 changer transitions 7/668 dead transitions. [2022-11-20 12:11:07,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 668 transitions, 9650 flow [2022-11-20 12:11:07,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-20 12:11:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-11-20 12:11:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 4162 transitions. [2022-11-20 12:11:07,476 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5132568750770748 [2022-11-20 12:11:07,477 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 4162 transitions. [2022-11-20 12:11:07,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 4162 transitions. [2022-11-20 12:11:07,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:07,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 4162 transitions. [2022-11-20 12:11:07,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 78.52830188679245) internal successors, (4162), 53 states have internal predecessors, (4162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:11:07,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 153.0) internal successors, (8262), 54 states have internal predecessors, (8262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:11:07,497 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 153.0) internal successors, (8262), 54 states have internal predecessors, (8262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:11:07,497 INFO L175 Difference]: Start difference. First operand has 397 places, 456 transitions, 6039 flow. Second operand 53 states and 4162 transitions. [2022-11-20 12:11:07,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 668 transitions, 9650 flow [2022-11-20 12:11:09,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 668 transitions, 9175 flow, removed 202 selfloop flow, removed 28 redundant places. [2022-11-20 12:11:09,840 INFO L231 Difference]: Finished difference. Result has 429 places, 530 transitions, 7359 flow [2022-11-20 12:11:09,841 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=5694, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=7359, PETRI_PLACES=429, PETRI_TRANSITIONS=530} [2022-11-20 12:11:09,841 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 300 predicate places. [2022-11-20 12:11:09,841 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 530 transitions, 7359 flow [2022-11-20 12:11:09,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 76.34782608695652) internal successors, (5268), 69 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:11:09,842 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:09,842 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:11:09,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 12:11:10,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:11:10,043 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:11:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash -668029346, now seen corresponding path program 1 times [2022-11-20 12:11:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:10,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253463077] [2022-11-20 12:11:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:10,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:11:11,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:11,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253463077] [2022-11-20 12:11:11,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253463077] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:11:11,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37229032] [2022-11-20 12:11:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:11,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:11:11,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:11:11,418 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:11:11,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 12:11:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:11,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-20 12:11:11,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:11:11,638 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-20 12:11:12,142 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:11:12,143 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-20 12:11:12,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 12:11:13,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:11:13,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 12:11:14,644 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 31 treesize of output 31 [2022-11-20 12:11:15,487 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-11-20 12:11:15,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 15 [2022-11-20 12:11:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:11:15,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:11:16,215 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse6 (* c_~q_front~0 4))) (let ((.cse3 (+ .cse6 c_~q~0.offset)) (.cse1 (+ .cse6 c_~q~0.offset 4))) (and (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~q~0.base))) (let ((.cse2 (select .cse0 .cse3))) (or (< 0 (+ c_~s~0 2147483649 (select .cse0 .cse1) .cse2)) (< 0 (+ .cse2 1)))))) (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_590) c_~q~0.base))) (let ((.cse4 (select .cse5 .cse1))) (or (< 0 (+ c_~s~0 2147483650 .cse4)) (< 0 (+ c_~s~0 2147483649 .cse4 (select .cse5 .cse3)))))))))) (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0))) is different from false [2022-11-20 12:11:19,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:11:19,422 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 241 treesize of output 158 [2022-11-20 12:11:19,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:11:19,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 464 treesize of output 453 [2022-11-20 12:11:19,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:11:19,501 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 384 treesize of output 344 [2022-11-20 12:11:19,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:11:19,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 344 treesize of output 345 [2022-11-20 12:11:19,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:11:19,571 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 318 treesize of output 280 [2022-11-20 12:11:19,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:11:19,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 280 treesize of output 282 [2022-11-20 12:11:27,676 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 10 treesize of output 8 [2022-11-20 12:11:27,681 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 10 treesize of output 8 [2022-11-20 12:11:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 12:11:27,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37229032] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:11:27,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:11:27,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28, 28] total 75 [2022-11-20 12:11:27,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41531177] [2022-11-20 12:11:27,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:11:27,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-20 12:11:27,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:27,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-20 12:11:27,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=5141, Unknown=6, NotChecked=146, Total=5700 [2022-11-20 12:11:27,884 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 153 [2022-11-20 12:11:27,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 530 transitions, 7359 flow. Second operand has 76 states, 76 states have (on average 73.32894736842105) internal successors, (5573), 76 states have internal predecessors, (5573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:11:27,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:27,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 153 [2022-11-20 12:11:27,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:42,711 INFO L130 PetriNetUnfolder]: 6551/20015 cut-off events. [2022-11-20 12:11:42,711 INFO L131 PetriNetUnfolder]: For 335328/341993 co-relation queries the response was YES. [2022-11-20 12:11:42,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116922 conditions, 20015 events. 6551/20015 cut-off events. For 335328/341993 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 228538 event pairs, 1423 based on Foata normal form. 973/20401 useless extension candidates. Maximal degree in co-relation 116833. Up to 10712 conditions per place. [2022-11-20 12:11:43,077 INFO L137 encePairwiseOnDemand]: 112/153 looper letters, 388 selfloop transitions, 196 changer transitions 19/673 dead transitions. [2022-11-20 12:11:43,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 673 transitions, 10861 flow [2022-11-20 12:11:43,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-20 12:11:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-11-20 12:11:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3489 transitions. [2022-11-20 12:11:43,084 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4851898206090947 [2022-11-20 12:11:43,084 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3489 transitions. [2022-11-20 12:11:43,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3489 transitions. [2022-11-20 12:11:43,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:43,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3489 transitions. [2022-11-20 12:11:43,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 74.23404255319149) internal successors, (3489), 47 states have internal predecessors, (3489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:11:43,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 153.0) internal successors, (7344), 48 states have internal predecessors, (7344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:11:43,326 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 153.0) internal successors, (7344), 48 states have internal predecessors, (7344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:11:43,335 INFO L175 Difference]: Start difference. First operand has 429 places, 530 transitions, 7359 flow. Second operand 47 states and 3489 transitions. [2022-11-20 12:11:43,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 673 transitions, 10861 flow [2022-11-20 12:11:46,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 673 transitions, 10461 flow, removed 64 selfloop flow, removed 34 redundant places. [2022-11-20 12:11:46,450 INFO L231 Difference]: Finished difference. Result has 452 places, 628 transitions, 9670 flow [2022-11-20 12:11:46,450 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=7020, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=9670, PETRI_PLACES=452, PETRI_TRANSITIONS=628} [2022-11-20 12:11:46,451 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 323 predicate places. [2022-11-20 12:11:46,451 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 628 transitions, 9670 flow [2022-11-20 12:11:46,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 73.32894736842105) internal successors, (5573), 76 states have internal predecessors, (5573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:11:46,452 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:46,452 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:11:46,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 12:11:46,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:11:46,655 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:11:46,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:46,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1812208722, now seen corresponding path program 2 times [2022-11-20 12:11:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:46,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97880634] [2022-11-20 12:11:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:11:49,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:49,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97880634] [2022-11-20 12:11:49,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97880634] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:11:49,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581296934] [2022-11-20 12:11:49,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:11:49,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:11:49,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:11:49,761 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:11:49,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 12:11:49,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:11:49,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:11:49,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-20 12:11:49,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:11:50,980 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 15 treesize of output 11 [2022-11-20 12:11:51,660 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-20 12:11:51,917 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-20 12:11:52,454 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 23 treesize of output 7 [2022-11-20 12:11:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:11:52,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:11:55,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:11:55,091 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 64 treesize of output 52 [2022-11-20 12:11:55,106 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-20 12:11:55,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 303 [2022-11-20 12:11:55,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:11:55,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 193 [2022-11-20 12:11:55,135 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 12:11:55,136 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 268 treesize of output 212 [2022-11-20 12:11:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:11:56,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581296934] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:11:56,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:11:56,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 22] total 73 [2022-11-20 12:11:56,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448268278] [2022-11-20 12:11:56,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:11:56,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-20 12:11:56,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:56,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-20 12:11:56,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=4753, Unknown=16, NotChecked=0, Total=5402 [2022-11-20 12:11:56,331 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 153 [2022-11-20 12:11:56,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 628 transitions, 9670 flow. Second operand has 74 states, 74 states have (on average 76.3108108108108) internal successors, (5647), 74 states have internal predecessors, (5647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:11:56,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:56,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 153 [2022-11-20 12:11:56,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:31,240 INFO L130 PetriNetUnfolder]: 6378/19498 cut-off events. [2022-11-20 12:12:31,240 INFO L131 PetriNetUnfolder]: For 426236/443763 co-relation queries the response was YES. [2022-11-20 12:12:31,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127512 conditions, 19498 events. 6378/19498 cut-off events. For 426236/443763 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 220547 event pairs, 1182 based on Foata normal form. 3560/22453 useless extension candidates. Maximal degree in co-relation 127412. Up to 5411 conditions per place. [2022-11-20 12:12:31,557 INFO L137 encePairwiseOnDemand]: 117/153 looper letters, 498 selfloop transitions, 262 changer transitions 122/955 dead transitions. [2022-11-20 12:12:31,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 955 transitions, 16030 flow [2022-11-20 12:12:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-11-20 12:12:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2022-11-20 12:12:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 6545 transitions. [2022-11-20 12:12:31,568 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2022-11-20 12:12:31,568 INFO L72 ComplementDD]: Start complementDD. Operand 84 states and 6545 transitions. [2022-11-20 12:12:31,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 6545 transitions. [2022-11-20 12:12:31,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:31,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 84 states and 6545 transitions. [2022-11-20 12:12:31,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 85 states, 84 states have (on average 77.91666666666667) internal successors, (6545), 84 states have internal predecessors, (6545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:12:31,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 85 states, 85 states have (on average 153.0) internal successors, (13005), 85 states have internal predecessors, (13005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:12:31,598 INFO L81 ComplementDD]: Finished complementDD. Result has 85 states, 85 states have (on average 153.0) internal successors, (13005), 85 states have internal predecessors, (13005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:12:31,599 INFO L175 Difference]: Start difference. First operand has 452 places, 628 transitions, 9670 flow. Second operand 84 states and 6545 transitions. [2022-11-20 12:12:31,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 955 transitions, 16030 flow [2022-11-20 12:12:36,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 955 transitions, 15647 flow, removed 151 selfloop flow, removed 31 redundant places. [2022-11-20 12:12:36,152 INFO L231 Difference]: Finished difference. Result has 536 places, 675 transitions, 10821 flow [2022-11-20 12:12:36,153 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=9439, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=10821, PETRI_PLACES=536, PETRI_TRANSITIONS=675} [2022-11-20 12:12:36,154 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 407 predicate places. [2022-11-20 12:12:36,154 INFO L495 AbstractCegarLoop]: Abstraction has has 536 places, 675 transitions, 10821 flow [2022-11-20 12:12:36,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 76.3108108108108) internal successors, (5647), 74 states have internal predecessors, (5647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:12:36,155 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:36,156 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:12:36,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:36,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 12:12:36,356 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-11-20 12:12:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash 697972760, now seen corresponding path program 3 times [2022-11-20 12:12:36,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:36,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659769575] [2022-11-20 12:12:36,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:36,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:12:39,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:39,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659769575] [2022-11-20 12:12:39,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659769575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:39,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161590971] [2022-11-20 12:12:39,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:12:39,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:39,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:39,396 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:39,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246b67f7-7974-4a3d-b92f-117801b01f4f/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 12:12:39,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 12:12:39,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:12:39,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 12:12:39,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:40,029 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 23 treesize of output 7 [2022-11-20 12:12:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:12:40,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:12:40,312 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-11-20 12:12:40,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-11-20 12:12:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:12:40,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161590971] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:12:40,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:12:40,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8, 8] total 40 [2022-11-20 12:12:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998121373] [2022-11-20 12:12:40,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:12:40,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-20 12:12:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:40,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-20 12:12:40,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1494, Unknown=0, NotChecked=0, Total=1640 [2022-11-20 12:12:40,475 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 153 [2022-11-20 12:12:40,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 675 transitions, 10821 flow. Second operand has 41 states, 41 states have (on average 76.92682926829268) internal successors, (3154), 41 states have internal predecessors, (3154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:12:40,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:40,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 153 [2022-11-20 12:12:40,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand