/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 12:00:23,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 12:00:23,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 12:00:23,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 12:00:23,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 12:00:23,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 12:00:23,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 12:00:23,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 12:00:23,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 12:00:23,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 12:00:23,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 12:00:23,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 12:00:23,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 12:00:23,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 12:00:23,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 12:00:23,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 12:00:23,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 12:00:23,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 12:00:23,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 12:00:23,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 12:00:23,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 12:00:23,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 12:00:23,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 12:00:23,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 12:00:23,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 12:00:23,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 12:00:23,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 12:00:23,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 12:00:23,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 12:00:23,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 12:00:23,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 12:00:23,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 12:00:23,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 12:00:23,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 12:00:23,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 12:00:23,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 12:00:23,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 12:00:23,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 12:00:23,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 12:00:23,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 12:00:23,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 12:00:23,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-16 12:00:23,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 12:00:23,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 12:00:23,546 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 12:00:23,546 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 12:00:23,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 12:00:23,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 12:00:23,547 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 12:00:23,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 12:00:23,547 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 12:00:23,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 12:00:23,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 12:00:23,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 12:00:23,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 12:00:23,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 12:00:23,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 12:00:23,548 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 12:00:23,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 12:00:23,548 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 12:00:23,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 12:00:23,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 12:00:23,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 12:00:23,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 12:00:23,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 12:00:23,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 12:00:23,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 12:00:23,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 12:00:23,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 12:00:23,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 12:00:23,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 12:00:23,549 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 12:00:23,550 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-16 12:00:23,550 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-09-16 12:00:23,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 12:00:23,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 12:00:23,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 12:00:23,985 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 12:00:23,985 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 12:00:23,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-09-16 12:00:24,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79333a078/431ccf50c87c40feba8ea0b7d1d5ac44/FLAG42c533220 [2022-09-16 12:00:24,658 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 12:00:24,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-09-16 12:00:24,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79333a078/431ccf50c87c40feba8ea0b7d1d5ac44/FLAG42c533220 [2022-09-16 12:00:24,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79333a078/431ccf50c87c40feba8ea0b7d1d5ac44 [2022-09-16 12:00:24,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 12:00:24,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 12:00:24,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 12:00:24,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 12:00:24,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 12:00:24,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b44919c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24, skipping insertion in model container [2022-09-16 12:00:24,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 12:00:24,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 12:00:24,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2022-09-16 12:00:24,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 12:00:24,881 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 12:00:24,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2022-09-16 12:00:24,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 12:00:24,913 INFO L208 MainTranslator]: Completed translation [2022-09-16 12:00:24,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24 WrapperNode [2022-09-16 12:00:24,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 12:00:24,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 12:00:24,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 12:00:24,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 12:00:24,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,967 INFO L138 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 166 [2022-09-16 12:00:24,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 12:00:24,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 12:00:24,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 12:00:24,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 12:00:24,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:24,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 12:00:24,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 12:00:24,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 12:00:24,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 12:00:24,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (1/1) ... [2022-09-16 12:00:25,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 12:00:25,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:25,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-16 12:00:25,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-16 12:00:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 12:00:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-16 12:00:25,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-16 12:00:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-16 12:00:25,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-16 12:00:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 12:00:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 12:00:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 12:00:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-16 12:00:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-16 12:00:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-16 12:00:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 12:00:25,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 12:00:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 12:00:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 12:00:25,088 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-16 12:00:25,193 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 12:00:25,194 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 12:00:25,531 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 12:00:25,610 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 12:00:25,610 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-09-16 12:00:25,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 12:00:25 BoogieIcfgContainer [2022-09-16 12:00:25,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 12:00:25,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 12:00:25,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 12:00:25,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 12:00:25,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 12:00:24" (1/3) ... [2022-09-16 12:00:25,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d39c418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 12:00:25, skipping insertion in model container [2022-09-16 12:00:25,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:00:24" (2/3) ... [2022-09-16 12:00:25,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d39c418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 12:00:25, skipping insertion in model container [2022-09-16 12:00:25,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 12:00:25" (3/3) ... [2022-09-16 12:00:25,618 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2022-09-16 12:00:25,630 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 12:00:25,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-09-16 12:00:25,631 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 12:00:25,675 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-16 12:00:25,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 153 transitions, 322 flow [2022-09-16 12:00:25,758 INFO L130 PetriNetUnfolder]: 11/151 cut-off events. [2022-09-16 12:00:25,758 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-09-16 12:00:25,761 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 141 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-09-16 12:00:25,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 153 transitions, 322 flow [2022-09-16 12:00:25,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 132 transitions, 273 flow [2022-09-16 12:00:25,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 12:00:25,787 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=false, 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;@6ade0a0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 12:00:25,788 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-09-16 12:00:25,804 INFO L130 PetriNetUnfolder]: 3/68 cut-off events. [2022-09-16 12:00:25,804 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-16 12:00:25,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:25,805 INFO L208 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-09-16 12:00:25,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash 13030154, now seen corresponding path program 1 times [2022-09-16 12:00:25,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:25,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085270724] [2022-09-16 12:00:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:25,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:26,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:26,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085270724] [2022-09-16 12:00:26,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085270724] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:00:26,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:00:26,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 12:00:26,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960232463] [2022-09-16 12:00:26,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:00:26,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 12:00:26,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:26,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 12:00:26,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 12:00:26,068 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2022-09-16 12:00:26,071 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-09-16 12:00:26,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:26,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2022-09-16 12:00:26,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:26,273 INFO L130 PetriNetUnfolder]: 57/343 cut-off events. [2022-09-16 12:00:26,273 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-09-16 12:00:26,275 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 1265 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-09-16 12:00:26,278 INFO L137 encePairwiseOnDemand]: 137/153 looper letters, 34 selfloop transitions, 4 changer transitions 3/139 dead transitions. [2022-09-16 12:00:26,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 372 flow [2022-09-16 12:00:26,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:00:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-16 12:00:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2022-09-16 12:00:26,295 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.85359477124183 [2022-09-16 12:00:26,296 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2022-09-16 12:00:26,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2022-09-16 12:00:26,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:26,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2022-09-16 12:00:26,304 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-09-16 12:00:26,312 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-09-16 12:00:26,313 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-09-16 12:00:26,314 INFO L175 Difference]: Start difference. First operand has 129 places, 132 transitions, 273 flow. Second operand 5 states and 653 transitions. [2022-09-16 12:00:26,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 139 transitions, 372 flow [2022-09-16 12:00:26,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 139 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-16 12:00:26,322 INFO L231 Difference]: Finished difference. Result has 130 places, 122 transitions, 272 flow [2022-09-16 12:00:26,324 INFO L270 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-09-16 12:00:26,328 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 1 predicate places. [2022-09-16 12:00:26,328 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 122 transitions, 272 flow [2022-09-16 12:00:26,329 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-09-16 12:00:26,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:26,329 INFO L208 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-09-16 12:00:26,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 12:00:26,329 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash 490861190, now seen corresponding path program 1 times [2022-09-16 12:00:26,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:26,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832855507] [2022-09-16 12:00:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:26,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:26,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832855507] [2022-09-16 12:00:26,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832855507] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:00:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370252318] [2022-09-16 12:00:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:26,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:26,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:26,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:00:26,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-09-16 12:00:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:26,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 12:00:26,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:00:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:26,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:00:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:26,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370252318] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:00:26,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:00:26,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-09-16 12:00:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353856773] [2022-09-16 12:00:26,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:00:26,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 12:00:26,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:26,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 12:00:26,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-09-16 12:00:26,663 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2022-09-16 12:00:26,664 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-09-16 12:00:26,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:26,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2022-09-16 12:00:26,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:26,950 INFO L130 PetriNetUnfolder]: 141/770 cut-off events. [2022-09-16 12:00:26,950 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-09-16 12:00:26,951 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 25. Compared 3945 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-09-16 12:00:26,954 INFO L137 encePairwiseOnDemand]: 146/153 looper letters, 73 selfloop transitions, 18 changer transitions 0/189 dead transitions. [2022-09-16 12:00:26,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 189 transitions, 626 flow [2022-09-16 12:00:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 12:00:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-16 12:00:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2236 transitions. [2022-09-16 12:00:26,958 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8119099491648512 [2022-09-16 12:00:26,958 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2236 transitions. [2022-09-16 12:00:26,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2236 transitions. [2022-09-16 12:00:26,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:26,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2236 transitions. [2022-09-16 12:00:26,963 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-09-16 12:00:26,967 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-09-16 12:00:26,968 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-09-16 12:00:26,968 INFO L175 Difference]: Start difference. First operand has 130 places, 122 transitions, 272 flow. Second operand 18 states and 2236 transitions. [2022-09-16 12:00:26,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 189 transitions, 626 flow [2022-09-16 12:00:26,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 189 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-16 12:00:26,973 INFO L231 Difference]: Finished difference. Result has 147 places, 134 transitions, 376 flow [2022-09-16 12:00:26,973 INFO L270 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-09-16 12:00:26,974 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 18 predicate places. [2022-09-16 12:00:26,974 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 134 transitions, 376 flow [2022-09-16 12:00:26,975 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-09-16 12:00:26,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:26,975 INFO L208 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-09-16 12:00:27,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-09-16 12:00:27,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:27,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1963171886, now seen corresponding path program 1 times [2022-09-16 12:00:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:27,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718151502] [2022-09-16 12:00:27,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:27,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:27,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718151502] [2022-09-16 12:00:27,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718151502] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:00:27,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505747710] [2022-09-16 12:00:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:27,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:27,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:27,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:00:27,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-16 12:00:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:27,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 12:00:27,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:00:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:27,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 12:00:27,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505747710] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:00:27,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 12:00:27,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 12:00:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026989942] [2022-09-16 12:00:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:00:27,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 12:00:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 12:00:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 12:00:27,389 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2022-09-16 12:00:27,390 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-09-16 12:00:27,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:27,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2022-09-16 12:00:27,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:27,565 INFO L130 PetriNetUnfolder]: 141/766 cut-off events. [2022-09-16 12:00:27,565 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-09-16 12:00:27,568 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 24. Compared 3915 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-09-16 12:00:27,572 INFO L137 encePairwiseOnDemand]: 148/153 looper letters, 35 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2022-09-16 12:00:27,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 144 transitions, 475 flow [2022-09-16 12:00:27,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 12:00:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-16 12:00:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2022-09-16 12:00:27,574 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8132586367880486 [2022-09-16 12:00:27,574 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2022-09-16 12:00:27,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2022-09-16 12:00:27,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:27,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2022-09-16 12:00:27,576 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-09-16 12:00:27,579 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-09-16 12:00:27,580 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-09-16 12:00:27,580 INFO L175 Difference]: Start difference. First operand has 147 places, 134 transitions, 376 flow. Second operand 7 states and 871 transitions. [2022-09-16 12:00:27,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 144 transitions, 475 flow [2022-09-16 12:00:27,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 144 transitions, 443 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-09-16 12:00:27,587 INFO L231 Difference]: Finished difference. Result has 143 places, 130 transitions, 339 flow [2022-09-16 12:00:27,587 INFO L270 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-09-16 12:00:27,589 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 14 predicate places. [2022-09-16 12:00:27,589 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 130 transitions, 339 flow [2022-09-16 12:00:27,590 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-09-16 12:00:27,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:27,590 INFO L208 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-09-16 12:00:27,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-16 12:00:27,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-09-16 12:00:27,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:27,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:27,807 INFO L85 PathProgramCache]: Analyzing trace with hash -351439445, now seen corresponding path program 1 times [2022-09-16 12:00:27,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:27,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622440945] [2022-09-16 12:00:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:27,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:27,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:27,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622440945] [2022-09-16 12:00:27,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622440945] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:00:27,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:00:27,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-16 12:00:27,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760983215] [2022-09-16 12:00:27,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:00:27,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 12:00:27,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:27,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 12:00:27,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-09-16 12:00:27,882 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2022-09-16 12:00:27,883 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-09-16 12:00:27,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:27,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2022-09-16 12:00:27,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:28,031 INFO L130 PetriNetUnfolder]: 113/662 cut-off events. [2022-09-16 12:00:28,032 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-09-16 12:00:28,033 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 22. Compared 3161 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-09-16 12:00:28,035 INFO L137 encePairwiseOnDemand]: 140/153 looper letters, 27 selfloop transitions, 6 changer transitions 3/135 dead transitions. [2022-09-16 12:00:28,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 135 transitions, 424 flow [2022-09-16 12:00:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 12:00:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-16 12:00:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2022-09-16 12:00:28,038 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7983193277310925 [2022-09-16 12:00:28,038 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2022-09-16 12:00:28,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2022-09-16 12:00:28,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:28,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2022-09-16 12:00:28,040 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-09-16 12:00:28,041 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-09-16 12:00:28,041 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-09-16 12:00:28,042 INFO L175 Difference]: Start difference. First operand has 143 places, 130 transitions, 339 flow. Second operand 7 states and 855 transitions. [2022-09-16 12:00:28,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 135 transitions, 424 flow [2022-09-16 12:00:28,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 135 transitions, 410 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-09-16 12:00:28,046 INFO L231 Difference]: Finished difference. Result has 146 places, 130 transitions, 353 flow [2022-09-16 12:00:28,046 INFO L270 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-09-16 12:00:28,047 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 17 predicate places. [2022-09-16 12:00:28,048 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 130 transitions, 353 flow [2022-09-16 12:00:28,048 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-09-16 12:00:28,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:28,048 INFO L208 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-09-16 12:00:28,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 12:00:28,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:28,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1900699567, now seen corresponding path program 1 times [2022-09-16 12:00:28,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:28,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112510581] [2022-09-16 12:00:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:28,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:28,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:28,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112510581] [2022-09-16 12:00:28,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112510581] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:00:28,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571583541] [2022-09-16 12:00:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:28,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:28,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:28,154 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:00:28,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-16 12:00:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:28,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 12:00:28,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:00:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 12:00:28,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 12:00:28,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571583541] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:00:28,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 12:00:28,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-09-16 12:00:28,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89857041] [2022-09-16 12:00:28,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:00:28,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 12:00:28,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:28,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 12:00:28,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-09-16 12:00:28,296 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153 [2022-09-16 12:00:28,297 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-09-16 12:00:28,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:28,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153 [2022-09-16 12:00:28,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:28,363 INFO L130 PetriNetUnfolder]: 45/464 cut-off events. [2022-09-16 12:00:28,363 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-09-16 12:00:28,364 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 1886 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-09-16 12:00:28,366 INFO L137 encePairwiseOnDemand]: 147/153 looper letters, 9 selfloop transitions, 3 changer transitions 0/127 dead transitions. [2022-09-16 12:00:28,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 127 transitions, 365 flow [2022-09-16 12:00:28,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:00:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-09-16 12:00:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2022-09-16 12:00:28,368 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8415032679738562 [2022-09-16 12:00:28,368 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2022-09-16 12:00:28,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2022-09-16 12:00:28,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:28,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2022-09-16 12:00:28,369 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-09-16 12:00:28,370 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-09-16 12:00:28,370 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-09-16 12:00:28,370 INFO L175 Difference]: Start difference. First operand has 146 places, 130 transitions, 353 flow. Second operand 4 states and 515 transitions. [2022-09-16 12:00:28,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 127 transitions, 365 flow [2022-09-16 12:00:28,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 127 transitions, 353 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-09-16 12:00:28,374 INFO L231 Difference]: Finished difference. Result has 140 places, 127 transitions, 335 flow [2022-09-16 12:00:28,374 INFO L270 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-09-16 12:00:28,375 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 11 predicate places. [2022-09-16 12:00:28,375 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 127 transitions, 335 flow [2022-09-16 12:00:28,375 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-09-16 12:00:28,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:28,376 INFO L208 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-09-16 12:00:28,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-16 12:00:28,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:28,593 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:28,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1211233909, now seen corresponding path program 1 times [2022-09-16 12:00:28,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:28,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896823617] [2022-09-16 12:00:28,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 12:00:28,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:28,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896823617] [2022-09-16 12:00:28,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896823617] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:00:28,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:00:28,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 12:00:28,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301973430] [2022-09-16 12:00:28,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:00:28,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 12:00:28,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 12:00:28,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 12:00:28,667 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 153 [2022-09-16 12:00:28,668 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-09-16 12:00:28,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:28,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 153 [2022-09-16 12:00:28,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:28,772 INFO L130 PetriNetUnfolder]: 185/760 cut-off events. [2022-09-16 12:00:28,773 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-09-16 12:00:28,775 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 4443 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-09-16 12:00:28,777 INFO L137 encePairwiseOnDemand]: 147/153 looper letters, 28 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2022-09-16 12:00:28,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 143 transitions, 448 flow [2022-09-16 12:00:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:00:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-16 12:00:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2022-09-16 12:00:28,782 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8352941176470589 [2022-09-16 12:00:28,782 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2022-09-16 12:00:28,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2022-09-16 12:00:28,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:28,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2022-09-16 12:00:28,784 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-09-16 12:00:28,785 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-09-16 12:00:28,785 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-09-16 12:00:28,785 INFO L175 Difference]: Start difference. First operand has 140 places, 127 transitions, 335 flow. Second operand 5 states and 639 transitions. [2022-09-16 12:00:28,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 143 transitions, 448 flow [2022-09-16 12:00:28,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 442 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-16 12:00:28,789 INFO L231 Difference]: Finished difference. Result has 144 places, 130 transitions, 359 flow [2022-09-16 12:00:28,789 INFO L270 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-09-16 12:00:28,791 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 15 predicate places. [2022-09-16 12:00:28,791 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 130 transitions, 359 flow [2022-09-16 12:00:28,791 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-09-16 12:00:28,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:28,792 INFO L208 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-09-16 12:00:28,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-16 12:00:28,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash 45043235, now seen corresponding path program 1 times [2022-09-16 12:00:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:28,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687884492] [2022-09-16 12:00:28,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 12:00:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:28,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687884492] [2022-09-16 12:00:28,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687884492] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:00:28,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:00:28,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 12:00:28,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071996873] [2022-09-16 12:00:28,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:00:28,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 12:00:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:28,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 12:00:28,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 12:00:28,912 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 153 [2022-09-16 12:00:28,912 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-09-16 12:00:28,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:28,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 153 [2022-09-16 12:00:28,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:28,980 INFO L130 PetriNetUnfolder]: 61/712 cut-off events. [2022-09-16 12:00:28,980 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-09-16 12:00:28,982 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 3944 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-09-16 12:00:28,984 INFO L137 encePairwiseOnDemand]: 147/153 looper letters, 11 selfloop transitions, 5 changer transitions 0/133 dead transitions. [2022-09-16 12:00:28,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 133 transitions, 403 flow [2022-09-16 12:00:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:00:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-16 12:00:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-09-16 12:00:28,986 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8474945533769063 [2022-09-16 12:00:28,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-09-16 12:00:28,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-09-16 12:00:28,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:28,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-09-16 12:00:28,987 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-09-16 12:00:28,988 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-09-16 12:00:28,989 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-09-16 12:00:28,989 INFO L175 Difference]: Start difference. First operand has 144 places, 130 transitions, 359 flow. Second operand 3 states and 389 transitions. [2022-09-16 12:00:28,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 133 transitions, 403 flow [2022-09-16 12:00:28,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 133 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-16 12:00:28,992 INFO L231 Difference]: Finished difference. Result has 146 places, 132 transitions, 386 flow [2022-09-16 12:00:28,992 INFO L270 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-09-16 12:00:28,992 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 17 predicate places. [2022-09-16 12:00:28,993 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 132 transitions, 386 flow [2022-09-16 12:00:28,993 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-09-16 12:00:28,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:28,993 INFO L208 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-09-16 12:00:28,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-16 12:00:28,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash -425050445, now seen corresponding path program 1 times [2022-09-16 12:00:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:28,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715535363] [2022-09-16 12:00:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 12:00:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:29,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715535363] [2022-09-16 12:00:29,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715535363] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:00:29,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972416153] [2022-09-16 12:00:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:29,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:29,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:29,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:00:29,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-16 12:00:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:29,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjunts are in the unsatisfiable core [2022-09-16 12:00:29,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:00:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:29,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:00:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:29,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972416153] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:00:29,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:00:29,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-09-16 12:00:29,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502593211] [2022-09-16 12:00:29,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:00:29,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 12:00:29,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:29,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 12:00:29,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-09-16 12:00:29,452 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 153 [2022-09-16 12:00:29,454 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-09-16 12:00:29,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:29,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 153 [2022-09-16 12:00:29,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:29,906 INFO L130 PetriNetUnfolder]: 304/1039 cut-off events. [2022-09-16 12:00:29,906 INFO L131 PetriNetUnfolder]: For 660/660 co-relation queries the response was YES. [2022-09-16 12:00:29,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2650 conditions, 1039 events. 304/1039 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 6292 event pairs, 36 based on Foata normal form. 15/958 useless extension candidates. Maximal degree in co-relation 2543. Up to 252 conditions per place. [2022-09-16 12:00:29,913 INFO L137 encePairwiseOnDemand]: 135/153 looper letters, 86 selfloop transitions, 28 changer transitions 0/193 dead transitions. [2022-09-16 12:00:29,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 193 transitions, 848 flow [2022-09-16 12:00:29,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 12:00:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-09-16 12:00:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2310 transitions. [2022-09-16 12:00:29,917 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2022-09-16 12:00:29,917 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2310 transitions. [2022-09-16 12:00:29,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2310 transitions. [2022-09-16 12:00:29,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:29,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2310 transitions. [2022-09-16 12:00:29,922 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-09-16 12:00:29,926 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-09-16 12:00:29,926 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-09-16 12:00:29,926 INFO L175 Difference]: Start difference. First operand has 146 places, 132 transitions, 386 flow. Second operand 22 states and 2310 transitions. [2022-09-16 12:00:29,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 193 transitions, 848 flow [2022-09-16 12:00:29,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 193 transitions, 803 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-09-16 12:00:29,931 INFO L231 Difference]: Finished difference. Result has 172 places, 144 transitions, 523 flow [2022-09-16 12:00:29,931 INFO L270 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-09-16 12:00:29,931 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 43 predicate places. [2022-09-16 12:00:29,932 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 144 transitions, 523 flow [2022-09-16 12:00:29,932 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-09-16 12:00:29,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:29,933 INFO L208 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-09-16 12:00:29,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-16 12:00:30,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:30,150 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:30,150 INFO L85 PathProgramCache]: Analyzing trace with hash 461018195, now seen corresponding path program 1 times [2022-09-16 12:00:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:30,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408993012] [2022-09-16 12:00:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:30,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:30,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408993012] [2022-09-16 12:00:30,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408993012] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:00:30,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033013122] [2022-09-16 12:00:30,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:30,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:30,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:00:30,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-16 12:00:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:30,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 42 conjunts are in the unsatisfiable core [2022-09-16 12:00:30,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:00:30,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:30,934 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:00:30,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:31,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:31,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:31,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:31,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:31,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:00:31,549 WARN L833 $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-09-16 12:00:32,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:00:32,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:32,173 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:00:32,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:32,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:00:32,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 92 [2022-09-16 12:00:32,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:33,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:33,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033013122] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:00:33,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:00:33,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 56 [2022-09-16 12:00:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306067777] [2022-09-16 12:00:33,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:00:33,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-09-16 12:00:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:33,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-09-16 12:00:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2762, Unknown=9, NotChecked=108, Total=3192 [2022-09-16 12:00:33,223 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 153 [2022-09-16 12:00:33,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 144 transitions, 523 flow. Second operand has 57 states, 57 states have (on average 75.15789473684211) internal successors, (4284), 57 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:33,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:33,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 153 [2022-09-16 12:00:33,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:35,804 INFO L130 PetriNetUnfolder]: 856/2559 cut-off events. [2022-09-16 12:00:35,804 INFO L131 PetriNetUnfolder]: For 1830/2014 co-relation queries the response was YES. [2022-09-16 12:00:35,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5845 conditions, 2559 events. 856/2559 cut-off events. For 1830/2014 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 19788 event pairs, 309 based on Foata normal form. 76/2252 useless extension candidates. Maximal degree in co-relation 5708. Up to 927 conditions per place. [2022-09-16 12:00:35,822 INFO L137 encePairwiseOnDemand]: 121/153 looper letters, 85 selfloop transitions, 54 changer transitions 2/209 dead transitions. [2022-09-16 12:00:35,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 209 transitions, 1000 flow [2022-09-16 12:00:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-09-16 12:00:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-09-16 12:00:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2690 transitions. [2022-09-16 12:00:35,827 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5023342670401494 [2022-09-16 12:00:35,828 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2690 transitions. [2022-09-16 12:00:35,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2690 transitions. [2022-09-16 12:00:35,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:35,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2690 transitions. [2022-09-16 12:00:35,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 76.85714285714286) internal successors, (2690), 35 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:35,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 153.0) internal successors, (5508), 36 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:35,841 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 153.0) internal successors, (5508), 36 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:35,841 INFO L175 Difference]: Start difference. First operand has 172 places, 144 transitions, 523 flow. Second operand 35 states and 2690 transitions. [2022-09-16 12:00:35,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 209 transitions, 1000 flow [2022-09-16 12:00:35,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 209 transitions, 969 flow, removed 3 selfloop flow, removed 9 redundant places. [2022-09-16 12:00:35,851 INFO L231 Difference]: Finished difference. Result has 204 places, 178 transitions, 777 flow [2022-09-16 12:00:35,851 INFO L270 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=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=777, PETRI_PLACES=204, PETRI_TRANSITIONS=178} [2022-09-16 12:00:35,852 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 75 predicate places. [2022-09-16 12:00:35,852 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 178 transitions, 777 flow [2022-09-16 12:00:35,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 75.15789473684211) internal successors, (4284), 57 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:35,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:35,854 INFO L208 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-09-16 12:00:35,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-16 12:00:36,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:36,067 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash -426154971, now seen corresponding path program 1 times [2022-09-16 12:00:36,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:36,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028650880] [2022-09-16 12:00:36,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:36,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:36,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:36,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028650880] [2022-09-16 12:00:36,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028650880] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:00:36,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255958524] [2022-09-16 12:00:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:36,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:36,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:36,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:00:36,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-16 12:00:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:36,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjunts are in the unsatisfiable core [2022-09-16 12:00:36,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:00:37,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:37,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:00:37,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:37,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:00:37,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:37,780 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-09-16 12:00:37,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:37,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:00:37,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_175 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) 2147483648)) is different from false [2022-09-16 12:00:38,259 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:00:38,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:38,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:00:38,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 84 [2022-09-16 12:00:38,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 30 [2022-09-16 12:00:38,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 50 [2022-09-16 12:00:39,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:39,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255958524] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:00:39,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:00:39,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 59 [2022-09-16 12:00:39,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84269557] [2022-09-16 12:00:39,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:00:39,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-09-16 12:00:39,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:39,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-09-16 12:00:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=3166, Unknown=5, NotChecked=114, Total=3540 [2022-09-16 12:00:39,209 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 153 [2022-09-16 12:00:39,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 178 transitions, 777 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-09-16 12:00:39,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:39,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 153 [2022-09-16 12:00:39,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:41,461 INFO L130 PetriNetUnfolder]: 1172/3681 cut-off events. [2022-09-16 12:00:41,461 INFO L131 PetriNetUnfolder]: For 5048/5214 co-relation queries the response was YES. [2022-09-16 12:00:41,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10147 conditions, 3681 events. 1172/3681 cut-off events. For 5048/5214 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 31900 event pairs, 232 based on Foata normal form. 90/3557 useless extension candidates. Maximal degree in co-relation 9993. Up to 1361 conditions per place. [2022-09-16 12:00:41,486 INFO L137 encePairwiseOnDemand]: 120/153 looper letters, 97 selfloop transitions, 48 changer transitions 16/227 dead transitions. [2022-09-16 12:00:41,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 1314 flow [2022-09-16 12:00:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 12:00:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-09-16 12:00:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2250 transitions. [2022-09-16 12:00:41,490 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2022-09-16 12:00:41,490 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2250 transitions. [2022-09-16 12:00:41,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2250 transitions. [2022-09-16 12:00:41,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:41,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2250 transitions. [2022-09-16 12:00:41,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 75.0) internal successors, (2250), 30 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:41,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:41,501 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:41,501 INFO L175 Difference]: Start difference. First operand has 204 places, 178 transitions, 777 flow. Second operand 30 states and 2250 transitions. [2022-09-16 12:00:41,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 1314 flow [2022-09-16 12:00:41,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 227 transitions, 1255 flow, removed 11 selfloop flow, removed 15 redundant places. [2022-09-16 12:00:41,526 INFO L231 Difference]: Finished difference. Result has 226 places, 194 transitions, 973 flow [2022-09-16 12:00:41,527 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=973, PETRI_PLACES=226, PETRI_TRANSITIONS=194} [2022-09-16 12:00:41,527 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 97 predicate places. [2022-09-16 12:00:41,527 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 194 transitions, 973 flow [2022-09-16 12:00:41,528 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-09-16 12:00:41,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:41,529 INFO L208 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-09-16 12:00:41,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-16 12:00:41,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:41,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2026197646, now seen corresponding path program 1 times [2022-09-16 12:00:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:41,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081081077] [2022-09-16 12:00:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:42,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:42,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081081077] [2022-09-16 12:00:42,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081081077] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:00:42,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560469204] [2022-09-16 12:00:42,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:42,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:42,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:42,730 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:00:42,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-16 12:00:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:42,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-16 12:00:42,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:00:42,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:42,853 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 12:00:42,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:43,177 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:00:43,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:43,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:43,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-09-16 12:00:44,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:00:44,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-09-16 12:00:44,234 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-09-16 12:00:44,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 12 [2022-09-16 12:00:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:44,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:00:44,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:00:44,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-09-16 12:00:44,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:00:44,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 182 treesize of output 170 [2022-09-16 12:00:44,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 65 [2022-09-16 12:00:44,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 142 treesize of output 118 [2022-09-16 12:00:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:46,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560469204] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:00:46,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:00:46,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 65 [2022-09-16 12:00:46,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927348822] [2022-09-16 12:00:46,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:00:46,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-09-16 12:00:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:46,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-09-16 12:00:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=4007, Unknown=10, NotChecked=0, Total=4290 [2022-09-16 12:00:46,793 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 153 [2022-09-16 12:00:46,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 194 transitions, 973 flow. Second operand has 66 states, 66 states have (on average 72.95454545454545) internal successors, (4815), 66 states have internal predecessors, (4815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:46,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:46,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 153 [2022-09-16 12:00:46,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:49,366 INFO L130 PetriNetUnfolder]: 1203/3747 cut-off events. [2022-09-16 12:00:49,366 INFO L131 PetriNetUnfolder]: For 9409/9751 co-relation queries the response was YES. [2022-09-16 12:00:49,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11902 conditions, 3747 events. 1203/3747 cut-off events. For 9409/9751 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 32745 event pairs, 432 based on Foata normal form. 112/3709 useless extension candidates. Maximal degree in co-relation 11729. Up to 1949 conditions per place. [2022-09-16 12:00:49,420 INFO L137 encePairwiseOnDemand]: 120/153 looper letters, 115 selfloop transitions, 47 changer transitions 0/228 dead transitions. [2022-09-16 12:00:49,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 228 transitions, 1521 flow [2022-09-16 12:00:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 12:00:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-09-16 12:00:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2161 transitions. [2022-09-16 12:00:49,424 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.48704079332882577 [2022-09-16 12:00:49,424 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2161 transitions. [2022-09-16 12:00:49,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2161 transitions. [2022-09-16 12:00:49,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:49,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2161 transitions. [2022-09-16 12:00:49,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 74.51724137931035) internal successors, (2161), 29 states have internal predecessors, (2161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:49,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 153.0) internal successors, (4590), 30 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:49,433 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 153.0) internal successors, (4590), 30 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:49,433 INFO L175 Difference]: Start difference. First operand has 226 places, 194 transitions, 973 flow. Second operand 29 states and 2161 transitions. [2022-09-16 12:00:49,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 228 transitions, 1521 flow [2022-09-16 12:00:49,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 228 transitions, 1415 flow, removed 36 selfloop flow, removed 17 redundant places. [2022-09-16 12:00:49,489 INFO L231 Difference]: Finished difference. Result has 239 places, 211 transitions, 1198 flow [2022-09-16 12:00:49,489 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1198, PETRI_PLACES=239, PETRI_TRANSITIONS=211} [2022-09-16 12:00:49,490 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 110 predicate places. [2022-09-16 12:00:49,490 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 211 transitions, 1198 flow [2022-09-16 12:00:49,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 72.95454545454545) internal successors, (4815), 66 states have internal predecessors, (4815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:49,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:49,492 INFO L208 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-09-16 12:00:49,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-16 12:00:49,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:49,715 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 862272728, now seen corresponding path program 2 times [2022-09-16 12:00:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:49,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611209400] [2022-09-16 12:00:49,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:49,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:50,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:50,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611209400] [2022-09-16 12:00:50,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611209400] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:00:50,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292166243] [2022-09-16 12:00:50,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 12:00:50,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:50,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:50,141 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:00:50,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-16 12:00:50,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 12:00:50,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:00:50,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 12:00:50,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:00:50,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 12:00:50,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 12:00:50,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292166243] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:00:50,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 12:00:50,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2022-09-16 12:00:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496062773] [2022-09-16 12:00:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:00:50,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 12:00:50,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:50,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 12:00:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-09-16 12:00:50,404 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 153 [2022-09-16 12:00:50,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 211 transitions, 1198 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:50,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:50,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 153 [2022-09-16 12:00:50,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:51,393 INFO L130 PetriNetUnfolder]: 2043/6245 cut-off events. [2022-09-16 12:00:51,393 INFO L131 PetriNetUnfolder]: For 18167/20987 co-relation queries the response was YES. [2022-09-16 12:00:51,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21739 conditions, 6245 events. 2043/6245 cut-off events. For 18167/20987 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 60361 event pairs, 339 based on Foata normal form. 292/6207 useless extension candidates. Maximal degree in co-relation 21584. Up to 1863 conditions per place. [2022-09-16 12:00:51,494 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 122 selfloop transitions, 22 changer transitions 1/264 dead transitions. [2022-09-16 12:00:51,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 264 transitions, 1895 flow [2022-09-16 12:00:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 12:00:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-09-16 12:00:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions. [2022-09-16 12:00:51,496 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7745098039215687 [2022-09-16 12:00:51,496 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 711 transitions. [2022-09-16 12:00:51,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 711 transitions. [2022-09-16 12:00:51,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:51,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 711 transitions. [2022-09-16 12:00:51,497 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-09-16 12:00:51,498 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-09-16 12:00:51,498 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-09-16 12:00:51,498 INFO L175 Difference]: Start difference. First operand has 239 places, 211 transitions, 1198 flow. Second operand 6 states and 711 transitions. [2022-09-16 12:00:51,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 264 transitions, 1895 flow [2022-09-16 12:00:51,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 264 transitions, 1816 flow, removed 14 selfloop flow, removed 23 redundant places. [2022-09-16 12:00:51,689 INFO L231 Difference]: Finished difference. Result has 224 places, 218 transitions, 1289 flow [2022-09-16 12:00:51,689 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1289, PETRI_PLACES=224, PETRI_TRANSITIONS=218} [2022-09-16 12:00:51,691 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 95 predicate places. [2022-09-16 12:00:51,691 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 218 transitions, 1289 flow [2022-09-16 12:00:51,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:51,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:51,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 12:00:51,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-16 12:00:51,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-09-16 12:00:51,909 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash 834197681, now seen corresponding path program 1 times [2022-09-16 12:00:51,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:51,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396946423] [2022-09-16 12:00:51,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:52,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396946423] [2022-09-16 12:00:52,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396946423] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:00:52,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106929273] [2022-09-16 12:00:52,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:52,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:52,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:52,690 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:00:52,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-09-16 12:00:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:52,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-09-16 12:00:52,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:00:53,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:53,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:00:53,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:00:53,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 22 [2022-09-16 12:00:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:54,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106929273] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:00:54,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:00:54,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 11] total 43 [2022-09-16 12:00:54,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331121497] [2022-09-16 12:00:54,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:00:54,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-09-16 12:00:54,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:00:54,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-09-16 12:00:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1587, Unknown=0, NotChecked=0, Total=1892 [2022-09-16 12:00:54,215 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 153 [2022-09-16 12:00:54,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 218 transitions, 1289 flow. Second operand has 44 states, 44 states have (on average 85.63636363636364) internal successors, (3768), 44 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:54,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:00:54,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 153 [2022-09-16 12:00:54,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:00:57,652 INFO L130 PetriNetUnfolder]: 2540/7971 cut-off events. [2022-09-16 12:00:57,653 INFO L131 PetriNetUnfolder]: For 26822/29279 co-relation queries the response was YES. [2022-09-16 12:00:57,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28704 conditions, 7971 events. 2540/7971 cut-off events. For 26822/29279 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 82092 event pairs, 165 based on Foata normal form. 712/8314 useless extension candidates. Maximal degree in co-relation 28544. Up to 1295 conditions per place. [2022-09-16 12:00:57,789 INFO L137 encePairwiseOnDemand]: 124/153 looper letters, 210 selfloop transitions, 117 changer transitions 27/430 dead transitions. [2022-09-16 12:00:57,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 430 transitions, 3625 flow [2022-09-16 12:00:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-09-16 12:00:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-09-16 12:00:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3801 transitions. [2022-09-16 12:00:57,792 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5777473780209759 [2022-09-16 12:00:57,792 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3801 transitions. [2022-09-16 12:00:57,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3801 transitions. [2022-09-16 12:00:57,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:00:57,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3801 transitions. [2022-09-16 12:00:57,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 88.3953488372093) internal successors, (3801), 43 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:57,801 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-09-16 12:00:57,802 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-09-16 12:00:57,802 INFO L175 Difference]: Start difference. First operand has 224 places, 218 transitions, 1289 flow. Second operand 43 states and 3801 transitions. [2022-09-16 12:00:57,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 430 transitions, 3625 flow [2022-09-16 12:00:57,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 430 transitions, 3579 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-09-16 12:00:57,885 INFO L231 Difference]: Finished difference. Result has 275 places, 289 transitions, 2410 flow [2022-09-16 12:00:57,885 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=2410, PETRI_PLACES=275, PETRI_TRANSITIONS=289} [2022-09-16 12:00:57,886 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 146 predicate places. [2022-09-16 12:00:57,886 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 289 transitions, 2410 flow [2022-09-16 12:00:57,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 85.63636363636364) internal successors, (3768), 44 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:00:57,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:00:57,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 12:00:57,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-09-16 12:00:58,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-09-16 12:00:58,105 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:00:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:00:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1920983811, now seen corresponding path program 1 times [2022-09-16 12:00:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:00:58,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462018298] [2022-09-16 12:00:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:00:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:58,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:00:58,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462018298] [2022-09-16 12:00:58,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462018298] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:00:58,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44547092] [2022-09-16 12:00:58,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:00:58,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:00:58,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:00:58,634 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:00:58,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-09-16 12:00:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:00:58,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjunts are in the unsatisfiable core [2022-09-16 12:00:58,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:00:58,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:58,902 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:00:58,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:59,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:59,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:00:59,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:59,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:59,844 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-09-16 12:00:59,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:00:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:00:59,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:00:59,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_282) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) 2147483648)) is different from false [2022-09-16 12:01:00,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:01:00,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:00,238 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:01:00,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 84 [2022-09-16 12:01:00,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 30 [2022-09-16 12:01:00,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 50 [2022-09-16 12:01:01,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:01,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:01,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44547092] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:01:01,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:01:01,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 22] total 60 [2022-09-16 12:01:01,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593099472] [2022-09-16 12:01:01,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:01:01,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-09-16 12:01:01,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:01:01,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-09-16 12:01:01,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3307, Unknown=5, NotChecked=116, Total=3660 [2022-09-16 12:01:01,817 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 153 [2022-09-16 12:01:01,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 289 transitions, 2410 flow. Second operand has 61 states, 61 states have (on average 73.11475409836065) internal successors, (4460), 61 states have internal predecessors, (4460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:01,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:01:01,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 153 [2022-09-16 12:01:01,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:01:04,846 INFO L130 PetriNetUnfolder]: 2495/7608 cut-off events. [2022-09-16 12:01:04,846 INFO L131 PetriNetUnfolder]: For 62552/64332 co-relation queries the response was YES. [2022-09-16 12:01:04,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33434 conditions, 7608 events. 2495/7608 cut-off events. For 62552/64332 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 77609 event pairs, 871 based on Foata normal form. 299/7549 useless extension candidates. Maximal degree in co-relation 33244. Up to 3140 conditions per place. [2022-09-16 12:01:04,911 INFO L137 encePairwiseOnDemand]: 121/153 looper letters, 164 selfloop transitions, 82 changer transitions 0/312 dead transitions. [2022-09-16 12:01:04,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 312 transitions, 3111 flow [2022-09-16 12:01:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 12:01:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-09-16 12:01:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2159 transitions. [2022-09-16 12:01:04,915 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.48659003831417624 [2022-09-16 12:01:04,915 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2159 transitions. [2022-09-16 12:01:04,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2159 transitions. [2022-09-16 12:01:04,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:01:04,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2159 transitions. [2022-09-16 12:01:04,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 74.44827586206897) internal successors, (2159), 29 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:04,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 153.0) internal successors, (4590), 30 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:04,922 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 153.0) internal successors, (4590), 30 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:04,922 INFO L175 Difference]: Start difference. First operand has 275 places, 289 transitions, 2410 flow. Second operand 29 states and 2159 transitions. [2022-09-16 12:01:04,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 312 transitions, 3111 flow [2022-09-16 12:01:05,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 312 transitions, 2769 flow, removed 92 selfloop flow, removed 25 redundant places. [2022-09-16 12:01:05,136 INFO L231 Difference]: Finished difference. Result has 277 places, 300 transitions, 2521 flow [2022-09-16 12:01:05,136 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2092, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2521, PETRI_PLACES=277, PETRI_TRANSITIONS=300} [2022-09-16 12:01:05,136 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 148 predicate places. [2022-09-16 12:01:05,137 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 300 transitions, 2521 flow [2022-09-16 12:01:05,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 73.11475409836065) internal successors, (4460), 61 states have internal predecessors, (4460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:05,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:01:05,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 12:01:05,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-09-16 12:01:05,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-09-16 12:01:05,351 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:01:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:01:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1704057156, now seen corresponding path program 1 times [2022-09-16 12:01:05,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:01:05,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956908777] [2022-09-16 12:01:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:01:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:06,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:01:06,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956908777] [2022-09-16 12:01:06,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956908777] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:01:06,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634346512] [2022-09-16 12:01:06,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:06,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:01:06,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:01:06,054 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:01:06,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-09-16 12:01:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:06,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjunts are in the unsatisfiable core [2022-09-16 12:01:06,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:01:06,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:06,510 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:01:06,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:06,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:07,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:01:07,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:07,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-09-16 12:01:07,528 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-09-16 12:01:07,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 12 [2022-09-16 12:01:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:07,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:01:07,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array Int Int))) (< 0 (+ c_~s~0 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_311) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) is different from false [2022-09-16 12:01:08,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:01:08,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-09-16 12:01:08,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:01:08,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 182 treesize of output 170 [2022-09-16 12:01:08,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 65 [2022-09-16 12:01:08,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 142 treesize of output 118 [2022-09-16 12:01:09,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:09,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:09,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634346512] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:01:09,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:01:09,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 64 [2022-09-16 12:01:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038268646] [2022-09-16 12:01:09,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:01:09,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-09-16 12:01:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:01:09,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-09-16 12:01:09,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3727, Unknown=7, NotChecked=124, Total=4160 [2022-09-16 12:01:09,438 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 153 [2022-09-16 12:01:09,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 300 transitions, 2521 flow. Second operand has 65 states, 65 states have (on average 73.03076923076924) internal successors, (4747), 65 states have internal predecessors, (4747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:09,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:01:09,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 153 [2022-09-16 12:01:09,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:01:12,086 INFO L130 PetriNetUnfolder]: 2507/7731 cut-off events. [2022-09-16 12:01:12,086 INFO L131 PetriNetUnfolder]: For 62308/63950 co-relation queries the response was YES. [2022-09-16 12:01:12,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33450 conditions, 7731 events. 2507/7731 cut-off events. For 62308/63950 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 79887 event pairs, 836 based on Foata normal form. 353/7775 useless extension candidates. Maximal degree in co-relation 33256. Up to 3847 conditions per place. [2022-09-16 12:01:12,161 INFO L137 encePairwiseOnDemand]: 121/153 looper letters, 180 selfloop transitions, 67 changer transitions 0/313 dead transitions. [2022-09-16 12:01:12,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 313 transitions, 3093 flow [2022-09-16 12:01:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 12:01:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-09-16 12:01:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2225 transitions. [2022-09-16 12:01:12,171 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.48474945533769065 [2022-09-16 12:01:12,171 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2225 transitions. [2022-09-16 12:01:12,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2225 transitions. [2022-09-16 12:01:12,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:01:12,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2225 transitions. [2022-09-16 12:01:12,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 74.16666666666667) internal successors, (2225), 30 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:12,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:12,185 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:12,185 INFO L175 Difference]: Start difference. First operand has 277 places, 300 transitions, 2521 flow. Second operand 30 states and 2225 transitions. [2022-09-16 12:01:12,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 313 transitions, 3093 flow [2022-09-16 12:01:12,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 313 transitions, 3027 flow, removed 9 selfloop flow, removed 22 redundant places. [2022-09-16 12:01:12,523 INFO L231 Difference]: Finished difference. Result has 287 places, 303 transitions, 2710 flow [2022-09-16 12:01:12,523 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2710, PETRI_PLACES=287, PETRI_TRANSITIONS=303} [2022-09-16 12:01:12,523 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 158 predicate places. [2022-09-16 12:01:12,524 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 303 transitions, 2710 flow [2022-09-16 12:01:12,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 73.03076923076924) internal successors, (4747), 65 states have internal predecessors, (4747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:12,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:01:12,525 INFO L208 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-09-16 12:01:12,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-09-16 12:01:12,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-09-16 12:01:12,743 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:01:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:01:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1263421962, now seen corresponding path program 2 times [2022-09-16 12:01:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:01:12,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985434458] [2022-09-16 12:01:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:01:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:12,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:01:12,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985434458] [2022-09-16 12:01:12,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985434458] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:01:12,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098568291] [2022-09-16 12:01:12,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 12:01:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:01:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:01:12,823 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:01:12,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-09-16 12:01:12,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 12:01:12,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:01:12,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2022-09-16 12:01:12,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:01:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-09-16 12:01:12,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:01:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-09-16 12:01:13,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098568291] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:01:13,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:01:13,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-09-16 12:01:13,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831420082] [2022-09-16 12:01:13,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:01:13,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 12:01:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:01:13,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 12:01:13,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 12:01:13,221 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 153 [2022-09-16 12:01:13,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 303 transitions, 2710 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-09-16 12:01:13,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:01:13,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 153 [2022-09-16 12:01:13,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:01:15,178 INFO L130 PetriNetUnfolder]: 1725/8365 cut-off events. [2022-09-16 12:01:15,178 INFO L131 PetriNetUnfolder]: For 69360/70625 co-relation queries the response was YES. [2022-09-16 12:01:15,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36348 conditions, 8365 events. 1725/8365 cut-off events. For 69360/70625 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 93411 event pairs, 229 based on Foata normal form. 114/8081 useless extension candidates. Maximal degree in co-relation 36172. Up to 1622 conditions per place. [2022-09-16 12:01:15,294 INFO L137 encePairwiseOnDemand]: 142/153 looper letters, 456 selfloop transitions, 25 changer transitions 0/653 dead transitions. [2022-09-16 12:01:15,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 653 transitions, 7612 flow [2022-09-16 12:01:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-16 12:01:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-09-16 12:01:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2713 transitions. [2022-09-16 12:01:15,297 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7388344226579521 [2022-09-16 12:01:15,297 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2713 transitions. [2022-09-16 12:01:15,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2713 transitions. [2022-09-16 12:01:15,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:01:15,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2713 transitions. [2022-09-16 12:01:15,303 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-09-16 12:01:15,307 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-09-16 12:01:15,307 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-09-16 12:01:15,308 INFO L175 Difference]: Start difference. First operand has 287 places, 303 transitions, 2710 flow. Second operand 24 states and 2713 transitions. [2022-09-16 12:01:15,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 653 transitions, 7612 flow [2022-09-16 12:01:15,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 653 transitions, 7543 flow, removed 0 selfloop flow, removed 31 redundant places. [2022-09-16 12:01:15,797 INFO L231 Difference]: Finished difference. Result has 279 places, 307 transitions, 2718 flow [2022-09-16 12:01:15,797 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2718, PETRI_PLACES=279, PETRI_TRANSITIONS=307} [2022-09-16 12:01:15,798 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 150 predicate places. [2022-09-16 12:01:15,798 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 307 transitions, 2718 flow [2022-09-16 12:01:15,799 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-09-16 12:01:15,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:01:15,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 12:01:15,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-09-16 12:01:16,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-09-16 12:01:16,017 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:01:16,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:01:16,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1465548730, now seen corresponding path program 2 times [2022-09-16 12:01:16,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:01:16,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410108137] [2022-09-16 12:01:16,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:01:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:16,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:01:16,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410108137] [2022-09-16 12:01:16,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410108137] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:01:16,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397049788] [2022-09-16 12:01:16,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 12:01:16,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:01:16,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:01:16,722 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:01:16,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-09-16 12:01:16,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 12:01:16,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:01:16,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-09-16 12:01:16,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:01:17,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 12:01:17,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 12:01:17,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397049788] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:01:17,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 12:01:17,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27 [2022-09-16 12:01:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763116594] [2022-09-16 12:01:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:01:17,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 12:01:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:01:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 12:01:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2022-09-16 12:01:17,049 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 153 [2022-09-16 12:01:17,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 307 transitions, 2718 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:17,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:01:17,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 153 [2022-09-16 12:01:17,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:01:21,102 INFO L130 PetriNetUnfolder]: 6421/19434 cut-off events. [2022-09-16 12:01:21,102 INFO L131 PetriNetUnfolder]: For 171619/179259 co-relation queries the response was YES. [2022-09-16 12:01:21,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90408 conditions, 19434 events. 6421/19434 cut-off events. For 171619/179259 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 224076 event pairs, 1935 based on Foata normal form. 1241/19856 useless extension candidates. Maximal degree in co-relation 90094. Up to 5416 conditions per place. [2022-09-16 12:01:21,531 INFO L137 encePairwiseOnDemand]: 144/153 looper letters, 249 selfloop transitions, 41 changer transitions 0/413 dead transitions. [2022-09-16 12:01:21,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 413 transitions, 4679 flow [2022-09-16 12:01:21,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 12:01:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-09-16 12:01:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2022-09-16 12:01:21,533 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2022-09-16 12:01:21,533 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 714 transitions. [2022-09-16 12:01:21,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 714 transitions. [2022-09-16 12:01:21,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:01:21,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 714 transitions. [2022-09-16 12:01:21,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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-09-16 12:01:21,535 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-09-16 12:01:21,535 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-09-16 12:01:21,535 INFO L175 Difference]: Start difference. First operand has 279 places, 307 transitions, 2718 flow. Second operand 6 states and 714 transitions. [2022-09-16 12:01:21,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 413 transitions, 4679 flow [2022-09-16 12:01:22,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 413 transitions, 4611 flow, removed 2 selfloop flow, removed 19 redundant places. [2022-09-16 12:01:22,830 INFO L231 Difference]: Finished difference. Result has 266 places, 327 transitions, 3246 flow [2022-09-16 12:01:22,830 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2641, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3246, PETRI_PLACES=266, PETRI_TRANSITIONS=327} [2022-09-16 12:01:22,831 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 137 predicate places. [2022-09-16 12:01:22,831 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 327 transitions, 3246 flow [2022-09-16 12:01:22,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:22,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:01:22,831 INFO L208 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-09-16 12:01:22,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-09-16 12:01:23,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-09-16 12:01:23,049 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:01:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:01:23,049 INFO L85 PathProgramCache]: Analyzing trace with hash 790246699, now seen corresponding path program 1 times [2022-09-16 12:01:23,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:01:23,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737462111] [2022-09-16 12:01:23,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:01:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 12:01:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:01:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737462111] [2022-09-16 12:01:23,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737462111] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:01:23,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:01:23,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-16 12:01:23,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932381903] [2022-09-16 12:01:23,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:01:23,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 12:01:23,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:01:23,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 12:01:23,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 12:01:23,084 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 153 [2022-09-16 12:01:23,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 327 transitions, 3246 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-09-16 12:01:23,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:01:23,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 153 [2022-09-16 12:01:23,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:01:25,994 INFO L130 PetriNetUnfolder]: 3823/15822 cut-off events. [2022-09-16 12:01:25,995 INFO L131 PetriNetUnfolder]: For 178686/183125 co-relation queries the response was YES. [2022-09-16 12:01:26,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75863 conditions, 15822 events. 3823/15822 cut-off events. For 178686/183125 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 189009 event pairs, 290 based on Foata normal form. 1120/16179 useless extension candidates. Maximal degree in co-relation 75389. Up to 4155 conditions per place. [2022-09-16 12:01:26,174 INFO L137 encePairwiseOnDemand]: 149/153 looper letters, 53 selfloop transitions, 61 changer transitions 43/346 dead transitions. [2022-09-16 12:01:26,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 346 transitions, 3670 flow [2022-09-16 12:01:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:01:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-09-16 12:01:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2022-09-16 12:01:26,175 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8627450980392157 [2022-09-16 12:01:26,175 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2022-09-16 12:01:26,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2022-09-16 12:01:26,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:01:26,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2022-09-16 12:01:26,177 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-09-16 12:01:26,177 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-09-16 12:01:26,177 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-09-16 12:01:26,177 INFO L175 Difference]: Start difference. First operand has 266 places, 327 transitions, 3246 flow. Second operand 4 states and 528 transitions. [2022-09-16 12:01:26,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 346 transitions, 3670 flow [2022-09-16 12:01:27,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 346 transitions, 3604 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-09-16 12:01:27,357 INFO L231 Difference]: Finished difference. Result has 267 places, 299 transitions, 3159 flow [2022-09-16 12:01:27,357 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2874, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3159, PETRI_PLACES=267, PETRI_TRANSITIONS=299} [2022-09-16 12:01:27,358 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 138 predicate places. [2022-09-16 12:01:27,358 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 299 transitions, 3159 flow [2022-09-16 12:01:27,358 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-09-16 12:01:27,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:01:27,358 INFO L208 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-09-16 12:01:27,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-09-16 12:01:27,358 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:01:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:01:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash -640088531, now seen corresponding path program 2 times [2022-09-16 12:01:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:01:27,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849752952] [2022-09-16 12:01:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:27,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:01:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:28,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:01:28,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849752952] [2022-09-16 12:01:28,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849752952] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:01:28,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412016147] [2022-09-16 12:01:28,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 12:01:28,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:01:28,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:01:28,006 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:01:28,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-09-16 12:01:28,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 12:01:28,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:01:28,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core [2022-09-16 12:01:28,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:01:28,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:28,161 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:01:28,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:28,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:28,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 12:01:28,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 12:01:28,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412016147] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:01:28,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 12:01:28,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [20] total 31 [2022-09-16 12:01:28,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667416948] [2022-09-16 12:01:28,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:01:28,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-16 12:01:28,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:01:28,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-16 12:01:28,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2022-09-16 12:01:28,360 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2022-09-16 12:01:28,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 299 transitions, 3159 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-09-16 12:01:28,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:01:28,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2022-09-16 12:01:28,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:01:32,579 INFO L130 PetriNetUnfolder]: 7891/22201 cut-off events. [2022-09-16 12:01:32,579 INFO L131 PetriNetUnfolder]: For 292291/313451 co-relation queries the response was YES. [2022-09-16 12:01:32,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114498 conditions, 22201 events. 7891/22201 cut-off events. For 292291/313451 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 252354 event pairs, 1235 based on Foata normal form. 1810/22861 useless extension candidates. Maximal degree in co-relation 114445. Up to 9994 conditions per place. [2022-09-16 12:01:32,964 INFO L137 encePairwiseOnDemand]: 138/153 looper letters, 207 selfloop transitions, 30 changer transitions 4/342 dead transitions. [2022-09-16 12:01:32,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 342 transitions, 4125 flow [2022-09-16 12:01:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:01:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-16 12:01:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1350 transitions. [2022-09-16 12:01:32,966 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6302521008403361 [2022-09-16 12:01:32,966 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1350 transitions. [2022-09-16 12:01:32,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1350 transitions. [2022-09-16 12:01:32,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:01:32,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1350 transitions. [2022-09-16 12:01:32,968 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-09-16 12:01:32,969 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-09-16 12:01:32,969 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-09-16 12:01:32,969 INFO L175 Difference]: Start difference. First operand has 267 places, 299 transitions, 3159 flow. Second operand 14 states and 1350 transitions. [2022-09-16 12:01:32,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 342 transitions, 4125 flow [2022-09-16 12:01:35,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 342 transitions, 3715 flow, removed 122 selfloop flow, removed 17 redundant places. [2022-09-16 12:01:35,971 INFO L231 Difference]: Finished difference. Result has 237 places, 300 transitions, 2935 flow [2022-09-16 12:01:35,972 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2853, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2935, PETRI_PLACES=237, PETRI_TRANSITIONS=300} [2022-09-16 12:01:35,972 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 108 predicate places. [2022-09-16 12:01:35,972 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 300 transitions, 2935 flow [2022-09-16 12:01:35,972 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-09-16 12:01:35,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:01:35,973 INFO L208 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-09-16 12:01:35,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-09-16 12:01:36,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:01:36,187 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:01:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:01:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1935395143, now seen corresponding path program 1 times [2022-09-16 12:01:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:01:36,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952470586] [2022-09-16 12:01:36,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:01:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 12:01:36,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:01:36,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952470586] [2022-09-16 12:01:36,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952470586] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:01:36,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365928203] [2022-09-16 12:01:36,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:36,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:01:36,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:01:36,232 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:01:36,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-09-16 12:01:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:36,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 12:01:36,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:01:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 12:01:36,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 12:01:36,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365928203] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:01:36,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 12:01:36,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 12:01:36,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011337789] [2022-09-16 12:01:36,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:01:36,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 12:01:36,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:01:36,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 12:01:36,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 12:01:36,317 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 153 [2022-09-16 12:01:36,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 300 transitions, 2935 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-09-16 12:01:36,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:01:36,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 153 [2022-09-16 12:01:36,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:01:37,416 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][175], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 7496#(and (<= 1 |thread1Thread1of1ForFork0_#t~post1#1|) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 162#true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 36#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 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|)), 401#(< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483646), 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-09-16 12:01:37,419 INFO L383 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-09-16 12:01:37,419 INFO L386 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-09-16 12:01:37,419 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-09-16 12:01:37,419 INFO L386 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-09-16 12:01:37,671 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][175], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 7496#(and (<= 1 |thread1Thread1of1ForFork0_#t~post1#1|) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 20#L47-5true, Black: 162#true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 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|)), 401#(< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483646), 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-09-16 12:01:37,672 INFO L383 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-09-16 12:01:37,672 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-09-16 12:01:37,672 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-09-16 12:01:37,672 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-09-16 12:01:37,742 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 74#L47-6true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 162#true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 401#(< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483646), 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: 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-09-16 12:01:37,743 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-09-16 12:01:37,743 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-09-16 12:01:37,743 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-09-16 12:01:37,743 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-09-16 12:01:37,817 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 144#L48true, Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 162#true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 401#(< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483646), 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: 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-09-16 12:01:37,817 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-09-16 12:01:37,817 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-09-16 12:01:37,817 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-09-16 12:01:37,817 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-09-16 12:01:37,817 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), 45#L47-7true, Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 162#true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 401#(< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483646), 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: 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-09-16 12:01:37,831 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-09-16 12:01:37,831 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-09-16 12:01:37,831 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-09-16 12:01:37,831 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-09-16 12:01:38,283 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][175], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 7496#(and (<= 1 |thread1Thread1of1ForFork0_#t~post1#1|) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 162#true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 36#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 372#(< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483647), 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: 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-09-16 12:01:38,296 INFO L383 tUnfolder$Statistics]: this new event has 137 ancestors and is cut-off event [2022-09-16 12:01:38,296 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-09-16 12:01:38,296 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-09-16 12:01:38,296 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-09-16 12:01:38,507 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][175], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 7496#(and (<= 1 |thread1Thread1of1ForFork0_#t~post1#1|) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 20#L47-5true, Black: 162#true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 372#(< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483647), 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: 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-09-16 12:01:38,508 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-09-16 12:01:38,508 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-09-16 12:01:38,508 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-09-16 12:01:38,508 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-09-16 12:01:38,585 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 6841#true, Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 74#L47-6true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 162#true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 372#(< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483647), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:38,585 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-09-16 12:01:38,585 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-09-16 12:01:38,585 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-09-16 12:01:38,586 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-09-16 12:01:38,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 6841#true, Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 144#L48true, Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 162#true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 372#(< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483647), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:38,674 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-09-16 12:01:38,674 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-09-16 12:01:38,675 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-09-16 12:01:38,675 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-09-16 12:01:38,675 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 6841#true, Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), 45#L47-7true, Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 162#true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 372#(< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2147483647), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:38,675 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-09-16 12:01:38,675 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-09-16 12:01:38,675 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-09-16 12:01:38,675 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-09-16 12:01:39,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][175], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 7496#(and (<= 1 |thread1Thread1of1ForFork0_#t~post1#1|) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), 6520#(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: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 36#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 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: 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-09-16 12:01:39,152 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-09-16 12:01:39,152 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-09-16 12:01:39,152 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-09-16 12:01:39,152 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-09-16 12:01:39,311 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][175], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 7496#(and (<= 1 |thread1Thread1of1ForFork0_#t~post1#1|) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), 6520#(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: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 20#L47-5true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 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: 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-09-16 12:01:39,311 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-09-16 12:01:39,312 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-09-16 12:01:39,312 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-09-16 12:01:39,312 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-09-16 12:01:39,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 74#L47-6true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), 6520#(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: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:39,383 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-09-16 12:01:39,383 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-09-16 12:01:39,383 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-09-16 12:01:39,383 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-09-16 12:01:39,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 144#L48true, Black: 6843#(<= ~q_back~0 ~q_front~0), 6520#(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: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:39,454 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-09-16 12:01:39,454 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-09-16 12:01:39,454 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-09-16 12:01:39,454 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-09-16 12:01:39,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), 45#L47-7true, Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), 6520#(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: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:39,454 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-09-16 12:01:39,454 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-09-16 12:01:39,454 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-09-16 12:01:39,454 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-09-16 12:01:39,854 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][175], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 6526#(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)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 7496#(and (<= 1 |thread1Thread1of1ForFork0_#t~post1#1|) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 36#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 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: 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-09-16 12:01:39,854 INFO L383 tUnfolder$Statistics]: this new event has 155 ancestors and is cut-off event [2022-09-16 12:01:39,854 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-09-16 12:01:39,854 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-09-16 12:01:39,854 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-09-16 12:01:39,950 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][175], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 6526#(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)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 7496#(and (<= 1 |thread1Thread1of1ForFork0_#t~post1#1|) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 20#L47-5true, 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 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: 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-09-16 12:01:39,950 INFO L383 tUnfolder$Statistics]: this new event has 157 ancestors and is cut-off event [2022-09-16 12:01:39,950 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-09-16 12:01:39,950 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-09-16 12:01:39,950 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-09-16 12:01:39,988 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 6526#(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)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 74#L47-6true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:39,988 INFO L383 tUnfolder$Statistics]: this new event has 158 ancestors and is cut-off event [2022-09-16 12:01:39,988 INFO L386 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-09-16 12:01:39,988 INFO L386 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-09-16 12:01:39,988 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-09-16 12:01:40,024 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 6526#(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)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 144#L48true, Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:40,025 INFO L383 tUnfolder$Statistics]: this new event has 159 ancestors and is cut-off event [2022-09-16 12:01:40,025 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-09-16 12:01:40,025 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-09-16 12:01:40,025 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-09-16 12:01:40,025 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 6526#(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)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), 45#L47-7true, Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:40,025 INFO L383 tUnfolder$Statistics]: this new event has 159 ancestors and is cut-off event [2022-09-16 12:01:40,025 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-09-16 12:01:40,025 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-09-16 12:01:40,025 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-09-16 12:01:40,141 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][175], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 7496#(and (<= 1 |thread1Thread1of1ForFork0_#t~post1#1|) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 36#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 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: 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-09-16 12:01:40,142 INFO L383 tUnfolder$Statistics]: this new event has 164 ancestors and is cut-off event [2022-09-16 12:01:40,142 INFO L386 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-09-16 12:01:40,142 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-09-16 12:01:40,142 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-09-16 12:01:40,165 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][175], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 7496#(and (<= 1 |thread1Thread1of1ForFork0_#t~post1#1|) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 20#L47-5true, 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 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: 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-09-16 12:01:40,165 INFO L383 tUnfolder$Statistics]: this new event has 166 ancestors and is cut-off event [2022-09-16 12:01:40,165 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-09-16 12:01:40,165 INFO L386 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-09-16 12:01:40,165 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-09-16 12:01:40,168 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 1669#true, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), 74#L47-6true, Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:40,168 INFO L383 tUnfolder$Statistics]: this new event has 167 ancestors and is cut-off event [2022-09-16 12:01:40,168 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-09-16 12:01:40,168 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-09-16 12:01:40,168 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-09-16 12:01:40,173 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 144#L48true, Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:40,173 INFO L383 tUnfolder$Statistics]: this new event has 168 ancestors and is cut-off event [2022-09-16 12:01:40,173 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-09-16 12:01:40,173 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-09-16 12:01:40,173 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-09-16 12:01:40,173 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~q_front~0_35 v_~q_back~0_76) (< v_~q_front~0_35 v_~n~0_49) (<= 0 v_~q_front~0_35)) 1 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (<= v_~q_front~0_34 2147483647) (<= 0 (+ v_~q_front~0_34 2147483648)) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_56| v_~q~0.base_48) (+ (* v_~q_front~0_35 4) v_~q~0.offset_48)))) InVars {~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_76, #memory_int=|v_#memory_int_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_48, ~n~0=v_~n~0_49, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_48, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][168], [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: 4911#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 1631#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1974#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), Black: 2007#(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_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)) (not (< ~q_back~0 ~n~0))), 6841#true, Black: 1991#(forall ((v_ArrVal_147 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147) ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648)), 91#L70true, Black: 2947#(and (<= (+ 2 ~q~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (and (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4))) 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0) (<= ~n~0 (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1)))) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 2927#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), 4572#(and (< ~s~0 2147483648) (or (= (* ~q_back~0 4) (* ~q_front~0 4)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 2922#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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, Black: 2315#true, Black: 2925#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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: 2931#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (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|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |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)), thread2Thread1of1ForFork1InUse, Black: 7188#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= |thread2Thread1of1ForFork1_~j~0#1| 0)), Black: 7186#(and (<= ~s~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= ~q~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), 45#L47-7true, Black: 5576#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), Black: 3279#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 2810#(or (and (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1))) (or (< |#StackHeapBarrier| (+ |ULTIMATE.start_main_~#t2~0#1.base| 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< |#StackHeapBarrier| (+ 1 |ULTIMATE.start_main_~#t1~0#1.base|))) (or (< ~s~0 1) (< 0 ~q_back~0))) (not (<= 0 ~q_back~0))), 80#L94-1true, Black: 811#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1066#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1067#(= |thread1Thread1of1ForFork0_#t~post1#1| 0), Black: 1069#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread1Thread1of1ForFork0_#t~post1#1| 0)), Black: 1076#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (not (<= 0 ~q_front~0))), Black: 6594#(<= 0 ~s~0), Black: 6834#(and (<= 0 ~s~0) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 6843#(<= ~q_back~0 ~q_front~0), Black: 6844#(<= ~q_back~0 (+ ~q_front~0 1)), 6494#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483647) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647) (<= ~n~0 2147483647)), 4594#true, 6848#true, 1623#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 162#true, Black: 4562#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4574#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4580#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4558#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4568#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), Black: 4548#(and (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) 2147483648) (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4550#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 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) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4566#(and (or (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~q_front~0 1) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (not (<= (+ ~q_front~0 1) 0)) (<= ~q_back~0 ~q_front~0)) (or (and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_front~0 ~q_back~0)) (<= (+ ~q_front~0 1) 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4578#(and (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (< ~q_back~0 ~n~0))) (< ~s~0 2147483648) (or (and (= (* ~q_back~0 4) (* ~q_front~0 4)) (< ~s~0 2147483648)) (not (<= 0 ~q_back~0)) (< 0 ~q_back~0))), 7196#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 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: 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-09-16 12:01:40,174 INFO L383 tUnfolder$Statistics]: this new event has 168 ancestors and is cut-off event [2022-09-16 12:01:40,174 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-09-16 12:01:40,174 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-09-16 12:01:40,174 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-09-16 12:01:40,181 INFO L130 PetriNetUnfolder]: 5906/20641 cut-off events. [2022-09-16 12:01:40,181 INFO L131 PetriNetUnfolder]: For 191285/196360 co-relation queries the response was YES. [2022-09-16 12:01:40,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102489 conditions, 20641 events. 5906/20641 cut-off events. For 191285/196360 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 246358 event pairs, 900 based on Foata normal form. 1175/20276 useless extension candidates. Maximal degree in co-relation 102444. Up to 6435 conditions per place. [2022-09-16 12:01:40,538 INFO L137 encePairwiseOnDemand]: 148/153 looper letters, 139 selfloop transitions, 8 changer transitions 0/323 dead transitions. [2022-09-16 12:01:40,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 323 transitions, 3487 flow [2022-09-16 12:01:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 12:01:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-16 12:01:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2022-09-16 12:01:40,539 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2022-09-16 12:01:40,539 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2022-09-16 12:01:40,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2022-09-16 12:01:40,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:01:40,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2022-09-16 12:01:40,540 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-09-16 12:01:40,541 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-09-16 12:01:40,541 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-09-16 12:01:40,541 INFO L175 Difference]: Start difference. First operand has 237 places, 300 transitions, 2935 flow. Second operand 7 states and 882 transitions. [2022-09-16 12:01:40,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 323 transitions, 3487 flow [2022-09-16 12:01:41,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 323 transitions, 3439 flow, removed 2 selfloop flow, removed 10 redundant places. [2022-09-16 12:01:41,409 INFO L231 Difference]: Finished difference. Result has 232 places, 298 transitions, 2889 flow [2022-09-16 12:01:41,410 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2873, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2889, PETRI_PLACES=232, PETRI_TRANSITIONS=298} [2022-09-16 12:01:41,410 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 103 predicate places. [2022-09-16 12:01:41,410 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 298 transitions, 2889 flow [2022-09-16 12:01:41,410 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-09-16 12:01:41,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:01:41,411 INFO L208 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-09-16 12:01:41,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-09-16 12:01:41,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:01:41,624 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:01:41,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:01:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1725937726, now seen corresponding path program 1 times [2022-09-16 12:01:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:01:41,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932693115] [2022-09-16 12:01:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:01:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:42,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:01:42,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932693115] [2022-09-16 12:01:42,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932693115] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:01:42,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630848306] [2022-09-16 12:01:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:42,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:01:42,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:01:42,318 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:01:42,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-09-16 12:01:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:42,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-16 12:01:42,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:01:42,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:42,592 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:01:42,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:43,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:43,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:43,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:01:43,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int))) (< 0 (+ c_~s~0 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) is different from false [2022-09-16 12:01:43,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:01:43,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:43,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:44,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630848306] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:01:44,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:01:44,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2022-09-16 12:01:44,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667615406] [2022-09-16 12:01:44,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:01:44,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-09-16 12:01:44,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:01:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-09-16 12:01:44,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=2959, Unknown=1, NotChecked=112, Total=3422 [2022-09-16 12:01:44,557 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 153 [2022-09-16 12:01:44,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 298 transitions, 2889 flow. Second operand has 59 states, 59 states have (on average 77.47457627118644) internal successors, (4571), 59 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:44,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:01:44,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 153 [2022-09-16 12:01:44,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:01:51,351 INFO L130 PetriNetUnfolder]: 8519/23022 cut-off events. [2022-09-16 12:01:51,351 INFO L131 PetriNetUnfolder]: For 206170/227472 co-relation queries the response was YES. [2022-09-16 12:01:51,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106258 conditions, 23022 events. 8519/23022 cut-off events. For 206170/227472 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 256918 event pairs, 1169 based on Foata normal form. 5675/27568 useless extension candidates. Maximal degree in co-relation 106214. Up to 5556 conditions per place. [2022-09-16 12:01:51,647 INFO L137 encePairwiseOnDemand]: 122/153 looper letters, 303 selfloop transitions, 132 changer transitions 0/500 dead transitions. [2022-09-16 12:01:51,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 500 transitions, 6009 flow [2022-09-16 12:01:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 12:01:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-09-16 12:01:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3102 transitions. [2022-09-16 12:01:51,650 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5198592257415787 [2022-09-16 12:01:51,650 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3102 transitions. [2022-09-16 12:01:51,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3102 transitions. [2022-09-16 12:01:51,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:01:51,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3102 transitions. [2022-09-16 12:01:51,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 79.53846153846153) internal successors, (3102), 39 states have internal predecessors, (3102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:51,659 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-09-16 12:01:51,660 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-09-16 12:01:51,660 INFO L175 Difference]: Start difference. First operand has 232 places, 298 transitions, 2889 flow. Second operand 39 states and 3102 transitions. [2022-09-16 12:01:51,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 500 transitions, 6009 flow [2022-09-16 12:01:52,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 500 transitions, 5994 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-09-16 12:01:52,303 INFO L231 Difference]: Finished difference. Result has 274 places, 367 transitions, 4310 flow [2022-09-16 12:01:52,304 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2874, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=4310, PETRI_PLACES=274, PETRI_TRANSITIONS=367} [2022-09-16 12:01:52,305 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 145 predicate places. [2022-09-16 12:01:52,305 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 367 transitions, 4310 flow [2022-09-16 12:01:52,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 77.47457627118644) internal successors, (4571), 59 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:01:52,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:01:52,306 INFO L208 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-09-16 12:01:52,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-09-16 12:01:52,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:01:52,524 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:01:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:01:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash -6626644, now seen corresponding path program 3 times [2022-09-16 12:01:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:01:52,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225922571] [2022-09-16 12:01:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:01:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:01:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:01:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:01:53,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:01:53,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225922571] [2022-09-16 12:01:53,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225922571] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:01:53,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399012652] [2022-09-16 12:01:53,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 12:01:53,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:01:53,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:01:53,713 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:01:53,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-09-16 12:01:53,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-09-16 12:01:53,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:01:53,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core [2022-09-16 12:01:53,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:01:53,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:53,942 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:01:53,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:54,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:54,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:01:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 12:01:54,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 12:01:54,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399012652] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:01:54,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 12:01:54,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [25] total 36 [2022-09-16 12:01:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367329392] [2022-09-16 12:01:54,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:01:54,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-16 12:01:54,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:01:54,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-16 12:01:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2022-09-16 12:01:54,301 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2022-09-16 12:01:54,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 367 transitions, 4310 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-09-16 12:01:54,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:01:54,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2022-09-16 12:01:54,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:01:59,361 INFO L130 PetriNetUnfolder]: 8264/22708 cut-off events. [2022-09-16 12:01:59,362 INFO L131 PetriNetUnfolder]: For 256319/277656 co-relation queries the response was YES. [2022-09-16 12:01:59,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117430 conditions, 22708 events. 8264/22708 cut-off events. For 256319/277656 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 256030 event pairs, 1481 based on Foata normal form. 1826/23289 useless extension candidates. Maximal degree in co-relation 117379. Up to 10241 conditions per place. [2022-09-16 12:01:59,697 INFO L137 encePairwiseOnDemand]: 138/153 looper letters, 238 selfloop transitions, 50 changer transitions 15/403 dead transitions. [2022-09-16 12:01:59,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 403 transitions, 5281 flow [2022-09-16 12:01:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:01:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-16 12:01:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1346 transitions. [2022-09-16 12:01:59,699 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6283846872082166 [2022-09-16 12:01:59,699 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1346 transitions. [2022-09-16 12:01:59,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1346 transitions. [2022-09-16 12:01:59,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:01:59,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1346 transitions. [2022-09-16 12:01:59,700 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-09-16 12:01:59,702 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-09-16 12:01:59,702 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-09-16 12:01:59,702 INFO L175 Difference]: Start difference. First operand has 274 places, 367 transitions, 4310 flow. Second operand 14 states and 1346 transitions. [2022-09-16 12:01:59,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 403 transitions, 5281 flow [2022-09-16 12:02:00,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 403 transitions, 5201 flow, removed 17 selfloop flow, removed 17 redundant places. [2022-09-16 12:02:00,653 INFO L231 Difference]: Finished difference. Result has 271 places, 363 transitions, 4263 flow [2022-09-16 12:02:00,654 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4230, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4263, PETRI_PLACES=271, PETRI_TRANSITIONS=363} [2022-09-16 12:02:00,654 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 142 predicate places. [2022-09-16 12:02:00,654 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 363 transitions, 4263 flow [2022-09-16 12:02:00,655 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-09-16 12:02:00,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:02:00,655 INFO L208 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] [2022-09-16 12:02:00,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-09-16 12:02:00,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:02:00,872 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:02:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:02:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash -40375295, now seen corresponding path program 2 times [2022-09-16 12:02:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:02:00,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538501231] [2022-09-16 12:02:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:02:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:02:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:02:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:02:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:02:01,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538501231] [2022-09-16 12:02:01,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538501231] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:02:01,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516215548] [2022-09-16 12:02:01,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 12:02:01,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:02:01,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:02:01,563 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:02:01,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-09-16 12:02:01,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 12:02:01,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:02:01,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 24 conjunts are in the unsatisfiable core [2022-09-16 12:02:01,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:02:01,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:01,759 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:02:01,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:02,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:02,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 12:02:02,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 12:02:02,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516215548] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:02:02,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 12:02:02,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [20] total 31 [2022-09-16 12:02:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527074630] [2022-09-16 12:02:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:02:02,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-16 12:02:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:02:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-16 12:02:02,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2022-09-16 12:02:02,044 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2022-09-16 12:02:02,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 363 transitions, 4263 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-09-16 12:02:02,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:02:02,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2022-09-16 12:02:02,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:02:06,256 INFO L130 PetriNetUnfolder]: 8069/21973 cut-off events. [2022-09-16 12:02:06,257 INFO L131 PetriNetUnfolder]: For 255789/276802 co-relation queries the response was YES. [2022-09-16 12:02:06,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114274 conditions, 21973 events. 8069/21973 cut-off events. For 255789/276802 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 245257 event pairs, 1304 based on Foata normal form. 2292/23017 useless extension candidates. Maximal degree in co-relation 114221. Up to 10241 conditions per place. [2022-09-16 12:02:06,668 INFO L137 encePairwiseOnDemand]: 139/153 looper letters, 221 selfloop transitions, 67 changer transitions 0/388 dead transitions. [2022-09-16 12:02:06,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 388 transitions, 5109 flow [2022-09-16 12:02:06,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:02:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-16 12:02:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1337 transitions. [2022-09-16 12:02:06,670 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6241830065359477 [2022-09-16 12:02:06,671 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1337 transitions. [2022-09-16 12:02:06,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1337 transitions. [2022-09-16 12:02:06,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:02:06,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1337 transitions. [2022-09-16 12:02:06,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.5) internal successors, (1337), 14 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:06,674 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-09-16 12:02:06,675 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-09-16 12:02:06,675 INFO L175 Difference]: Start difference. First operand has 271 places, 363 transitions, 4263 flow. Second operand 14 states and 1337 transitions. [2022-09-16 12:02:06,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 388 transitions, 5109 flow [2022-09-16 12:02:07,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 388 transitions, 4936 flow, removed 8 selfloop flow, removed 16 redundant places. [2022-09-16 12:02:07,709 INFO L231 Difference]: Finished difference. Result has 264 places, 359 transitions, 4225 flow [2022-09-16 12:02:07,709 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4040, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4225, PETRI_PLACES=264, PETRI_TRANSITIONS=359} [2022-09-16 12:02:07,710 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 135 predicate places. [2022-09-16 12:02:07,710 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 359 transitions, 4225 flow [2022-09-16 12:02:07,710 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-09-16 12:02:07,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:02:07,710 INFO L208 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-09-16 12:02:07,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-09-16 12:02:07,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:02:07,926 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:02:07,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:02:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1251633588, now seen corresponding path program 3 times [2022-09-16 12:02:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:02:07,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112927221] [2022-09-16 12:02:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:02:07,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:02:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:02:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:02:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:02:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112927221] [2022-09-16 12:02:09,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112927221] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:02:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587778979] [2022-09-16 12:02:09,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 12:02:09,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:02:09,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:02:09,118 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:02:09,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-09-16 12:02:09,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-09-16 12:02:09,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:02:09,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjunts are in the unsatisfiable core [2022-09-16 12:02:09,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:02:09,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:09,346 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:02:09,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:09,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:09,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 12:02:09,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 12:02:09,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587778979] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:02:09,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 12:02:09,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [25] total 36 [2022-09-16 12:02:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108211747] [2022-09-16 12:02:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:02:09,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-16 12:02:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:02:09,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-16 12:02:09,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1176, Unknown=0, NotChecked=0, Total=1332 [2022-09-16 12:02:09,714 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2022-09-16 12:02:09,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 359 transitions, 4225 flow. Second operand has 13 states, 13 states have (on average 93.61538461538461) internal successors, (1217), 13 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:09,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:02:09,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2022-09-16 12:02:09,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:02:15,209 INFO L130 PetriNetUnfolder]: 9418/25316 cut-off events. [2022-09-16 12:02:15,210 INFO L131 PetriNetUnfolder]: For 286085/307991 co-relation queries the response was YES. [2022-09-16 12:02:15,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133497 conditions, 25316 events. 9418/25316 cut-off events. For 286085/307991 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 285370 event pairs, 1139 based on Foata normal form. 3048/27054 useless extension candidates. Maximal degree in co-relation 133446. Up to 6239 conditions per place. [2022-09-16 12:02:15,629 INFO L137 encePairwiseOnDemand]: 138/153 looper letters, 283 selfloop transitions, 59 changer transitions 0/442 dead transitions. [2022-09-16 12:02:15,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 442 transitions, 5993 flow [2022-09-16 12:02:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:02:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-16 12:02:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1349 transitions. [2022-09-16 12:02:15,631 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6297852474323062 [2022-09-16 12:02:15,631 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1349 transitions. [2022-09-16 12:02:15,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1349 transitions. [2022-09-16 12:02:15,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:02:15,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1349 transitions. [2022-09-16 12:02:15,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.35714285714286) internal successors, (1349), 14 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:15,634 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-09-16 12:02:15,634 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-09-16 12:02:15,635 INFO L175 Difference]: Start difference. First operand has 264 places, 359 transitions, 4225 flow. Second operand 14 states and 1349 transitions. [2022-09-16 12:02:15,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 442 transitions, 5993 flow [2022-09-16 12:02:16,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 442 transitions, 5785 flow, removed 11 selfloop flow, removed 15 redundant places. [2022-09-16 12:02:16,630 INFO L231 Difference]: Finished difference. Result has 261 places, 358 transitions, 4305 flow [2022-09-16 12:02:16,631 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3899, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4305, PETRI_PLACES=261, PETRI_TRANSITIONS=358} [2022-09-16 12:02:16,631 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 132 predicate places. [2022-09-16 12:02:16,631 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 358 transitions, 4305 flow [2022-09-16 12:02:16,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 93.61538461538461) internal successors, (1217), 13 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:16,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:02:16,632 INFO L208 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-09-16 12:02:16,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-09-16 12:02:16,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:02:16,851 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:02:16,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:02:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1895659313, now seen corresponding path program 2 times [2022-09-16 12:02:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:02:16,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765041842] [2022-09-16 12:02:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:02:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:02:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:02:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:02:16,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:02:16,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765041842] [2022-09-16 12:02:16,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765041842] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:02:16,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945327046] [2022-09-16 12:02:16,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 12:02:16,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:02:16,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:02:16,928 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:02:16,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-09-16 12:02:16,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 12:02:16,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:02:17,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 12:02:17,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:02:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-09-16 12:02:17,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:02:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-09-16 12:02:17,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945327046] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:02:17,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:02:17,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2022-09-16 12:02:17,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512867827] [2022-09-16 12:02:17,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:02:17,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-09-16 12:02:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:02:17,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-09-16 12:02:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-09-16 12:02:17,208 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 153 [2022-09-16 12:02:17,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 358 transitions, 4305 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-09-16 12:02:17,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:02:17,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 153 [2022-09-16 12:02:17,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:02:22,021 INFO L130 PetriNetUnfolder]: 6051/21084 cut-off events. [2022-09-16 12:02:22,021 INFO L131 PetriNetUnfolder]: For 285565/288959 co-relation queries the response was YES. [2022-09-16 12:02:22,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118317 conditions, 21084 events. 6051/21084 cut-off events. For 285565/288959 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 248160 event pairs, 874 based on Foata normal form. 1767/21621 useless extension candidates. Maximal degree in co-relation 118267. Up to 4370 conditions per place. [2022-09-16 12:02:22,366 INFO L137 encePairwiseOnDemand]: 133/153 looper letters, 294 selfloop transitions, 59 changer transitions 0/516 dead transitions. [2022-09-16 12:02:22,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 516 transitions, 7657 flow [2022-09-16 12:02:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-16 12:02:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-09-16 12:02:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2716 transitions. [2022-09-16 12:02:22,368 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6339869281045751 [2022-09-16 12:02:22,368 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2716 transitions. [2022-09-16 12:02:22,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2716 transitions. [2022-09-16 12:02:22,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:02:22,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2716 transitions. [2022-09-16 12:02:22,371 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-09-16 12:02:22,374 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-09-16 12:02:22,374 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-09-16 12:02:22,374 INFO L175 Difference]: Start difference. First operand has 261 places, 358 transitions, 4305 flow. Second operand 28 states and 2716 transitions. [2022-09-16 12:02:22,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 516 transitions, 7657 flow [2022-09-16 12:02:23,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 516 transitions, 7404 flow, removed 52 selfloop flow, removed 12 redundant places. [2022-09-16 12:02:23,241 INFO L231 Difference]: Finished difference. Result has 278 places, 375 transitions, 4593 flow [2022-09-16 12:02:23,242 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4078, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4593, PETRI_PLACES=278, PETRI_TRANSITIONS=375} [2022-09-16 12:02:23,243 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 149 predicate places. [2022-09-16 12:02:23,243 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 375 transitions, 4593 flow [2022-09-16 12:02:23,245 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-09-16 12:02:23,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:02:23,245 INFO L208 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-09-16 12:02:23,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-09-16 12:02:23,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-09-16 12:02:23,450 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:02:23,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:02:23,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1400540797, now seen corresponding path program 1 times [2022-09-16 12:02:23,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:02:23,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112691264] [2022-09-16 12:02:23,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:02:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:02:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:02:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:02:23,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:02:23,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112691264] [2022-09-16 12:02:23,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112691264] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:02:23,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730610984] [2022-09-16 12:02:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:02:23,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:02:23,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:02:23,952 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:02:23,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-09-16 12:02:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:02:24,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 52 conjunts are in the unsatisfiable core [2022-09-16 12:02:24,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:02:24,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:24,217 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:02:24,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:24,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:25,015 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-09-16 12:02:25,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:02:25,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:02:25,315 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-09-16 12:02:25,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:25,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:02:25,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:02:27,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730610984] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:02:27,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:02:27,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 65 [2022-09-16 12:02:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117099674] [2022-09-16 12:02:27,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:02:27,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-09-16 12:02:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:02:27,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-09-16 12:02:27,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=3948, Unknown=12, NotChecked=0, Total=4290 [2022-09-16 12:02:27,741 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 153 [2022-09-16 12:02:27,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 375 transitions, 4593 flow. Second operand has 66 states, 66 states have (on average 77.43939393939394) internal successors, (5111), 66 states have internal predecessors, (5111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:27,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:02:27,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 153 [2022-09-16 12:02:27,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:02:35,594 INFO L130 PetriNetUnfolder]: 7918/21794 cut-off events. [2022-09-16 12:02:35,594 INFO L131 PetriNetUnfolder]: For 272426/290966 co-relation queries the response was YES. [2022-09-16 12:02:35,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117781 conditions, 21794 events. 7918/21794 cut-off events. For 272426/290966 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 241325 event pairs, 1661 based on Foata normal form. 3088/24370 useless extension candidates. Maximal degree in co-relation 117728. Up to 6074 conditions per place. [2022-09-16 12:02:35,990 INFO L137 encePairwiseOnDemand]: 120/153 looper letters, 301 selfloop transitions, 192 changer transitions 7/575 dead transitions. [2022-09-16 12:02:35,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 575 transitions, 8090 flow [2022-09-16 12:02:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 12:02:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-09-16 12:02:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3590 transitions. [2022-09-16 12:02:35,996 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5214233841684822 [2022-09-16 12:02:35,996 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3590 transitions. [2022-09-16 12:02:35,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3590 transitions. [2022-09-16 12:02:35,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:02:35,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3590 transitions. [2022-09-16 12:02:36,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 79.77777777777777) internal successors, (3590), 45 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:36,006 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-09-16 12:02:36,006 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-09-16 12:02:36,006 INFO L175 Difference]: Start difference. First operand has 278 places, 375 transitions, 4593 flow. Second operand 45 states and 3590 transitions. [2022-09-16 12:02:36,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 575 transitions, 8090 flow [2022-09-16 12:02:37,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 575 transitions, 8049 flow, removed 0 selfloop flow, removed 15 redundant places. [2022-09-16 12:02:37,056 INFO L231 Difference]: Finished difference. Result has 317 places, 434 transitions, 6375 flow [2022-09-16 12:02:37,056 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4552, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=6375, PETRI_PLACES=317, PETRI_TRANSITIONS=434} [2022-09-16 12:02:37,057 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 188 predicate places. [2022-09-16 12:02:37,057 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 434 transitions, 6375 flow [2022-09-16 12:02:37,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 77.43939393939394) internal successors, (5111), 66 states have internal predecessors, (5111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:37,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:02:37,058 INFO L208 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-09-16 12:02:37,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-09-16 12:02:37,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-09-16 12:02:37,271 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:02:37,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:02:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1305384353, now seen corresponding path program 2 times [2022-09-16 12:02:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:02:37,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868484388] [2022-09-16 12:02:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:02:37,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:02:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:02:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:02:37,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:02:37,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868484388] [2022-09-16 12:02:37,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868484388] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:02:37,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435981267] [2022-09-16 12:02:37,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 12:02:37,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:02:37,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:02:37,708 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:02:37,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-09-16 12:02:37,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 12:02:37,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:02:37,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjunts are in the unsatisfiable core [2022-09-16 12:02:37,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:02:38,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:38,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:39,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:02:39,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:39,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:02:39,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:02:39,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:02:40,270 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:02:40,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:40,285 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:02:40,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 424 treesize of output 416 [2022-09-16 12:02:40,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:02:40,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 340 treesize of output 286 [2022-09-16 12:02:40,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:02:40,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 284 treesize of output 290 [2022-09-16 12:02:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:02:42,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435981267] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:02:42,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:02:42,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25] total 69 [2022-09-16 12:02:42,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896147014] [2022-09-16 12:02:42,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:02:42,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-09-16 12:02:42,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:02:42,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-09-16 12:02:42,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=4396, Unknown=20, NotChecked=0, Total=4830 [2022-09-16 12:02:42,505 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 153 [2022-09-16 12:02:42,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 434 transitions, 6375 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-09-16 12:02:42,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:02:42,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 153 [2022-09-16 12:02:42,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:02:54,403 INFO L130 PetriNetUnfolder]: 7895/21924 cut-off events. [2022-09-16 12:02:54,403 INFO L131 PetriNetUnfolder]: For 355314/379273 co-relation queries the response was YES. [2022-09-16 12:02:54,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129150 conditions, 21924 events. 7895/21924 cut-off events. For 355314/379273 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 243184 event pairs, 743 based on Foata normal form. 5565/27050 useless extension candidates. Maximal degree in co-relation 129088. Up to 6396 conditions per place. [2022-09-16 12:02:54,700 INFO L137 encePairwiseOnDemand]: 120/153 looper letters, 328 selfloop transitions, 274 changer transitions 14/693 dead transitions. [2022-09-16 12:02:54,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 693 transitions, 11040 flow [2022-09-16 12:02:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-09-16 12:02:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2022-09-16 12:02:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 5544 transitions. [2022-09-16 12:02:54,704 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.525149190110827 [2022-09-16 12:02:54,705 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 5544 transitions. [2022-09-16 12:02:54,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 5544 transitions. [2022-09-16 12:02:54,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:02:54,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 5544 transitions. [2022-09-16 12:02:54,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 80.34782608695652) internal successors, (5544), 69 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:54,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 153.0) internal successors, (10710), 70 states have internal predecessors, (10710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:54,717 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 153.0) internal successors, (10710), 70 states have internal predecessors, (10710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:54,717 INFO L175 Difference]: Start difference. First operand has 317 places, 434 transitions, 6375 flow. Second operand 69 states and 5544 transitions. [2022-09-16 12:02:54,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 693 transitions, 11040 flow [2022-09-16 12:02:55,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 693 transitions, 10791 flow, removed 99 selfloop flow, removed 23 redundant places. [2022-09-16 12:02:55,944 INFO L231 Difference]: Finished difference. Result has 377 places, 515 transitions, 8722 flow [2022-09-16 12:02:55,945 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=6206, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=8722, PETRI_PLACES=377, PETRI_TRANSITIONS=515} [2022-09-16 12:02:55,945 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 248 predicate places. [2022-09-16 12:02:55,945 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 515 transitions, 8722 flow [2022-09-16 12:02:55,946 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-09-16 12:02:55,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:02:55,946 INFO L208 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-09-16 12:02:55,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-09-16 12:02:56,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-09-16 12:02:56,163 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:02:56,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:02:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2125245539, now seen corresponding path program 3 times [2022-09-16 12:02:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:02:56,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356371984] [2022-09-16 12:02:56,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:02:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:02:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:02:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:02:56,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:02:56,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356371984] [2022-09-16 12:02:56,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356371984] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:02:56,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967760251] [2022-09-16 12:02:56,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 12:02:56,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:02:56,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:02:56,863 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:02:56,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-09-16 12:02:56,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-16 12:02:56,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:02:56,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 15 conjunts are in the unsatisfiable core [2022-09-16 12:02:56,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:02:57,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:02:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 12:02:57,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:02:57,335 INFO L356 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-09-16 12:02:57,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 17 [2022-09-16 12:02:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 12:02:57,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967760251] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:02:57,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:02:57,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8, 8] total 36 [2022-09-16 12:02:57,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463998617] [2022-09-16 12:02:57,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:02:57,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-09-16 12:02:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:02:57,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-09-16 12:02:57,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2022-09-16 12:02:57,413 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 153 [2022-09-16 12:02:57,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 515 transitions, 8722 flow. Second operand has 37 states, 37 states have (on average 81.0) internal successors, (2997), 37 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:02:57,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:02:57,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 153 [2022-09-16 12:02:57,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:03:07,794 INFO L130 PetriNetUnfolder]: 10204/28860 cut-off events. [2022-09-16 12:03:07,794 INFO L131 PetriNetUnfolder]: For 599721/625657 co-relation queries the response was YES. [2022-09-16 12:03:08,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183936 conditions, 28860 events. 10204/28860 cut-off events. For 599721/625657 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 339832 event pairs, 753 based on Foata normal form. 6948/35242 useless extension candidates. Maximal degree in co-relation 183859. Up to 6215 conditions per place. [2022-09-16 12:03:08,467 INFO L137 encePairwiseOnDemand]: 127/153 looper letters, 377 selfloop transitions, 415 changer transitions 19/886 dead transitions. [2022-09-16 12:03:08,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 886 transitions, 16665 flow [2022-09-16 12:03:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-09-16 12:03:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-09-16 12:03:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 5032 transitions. [2022-09-16 12:03:08,472 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2022-09-16 12:03:08,472 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 5032 transitions. [2022-09-16 12:03:08,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 5032 transitions. [2022-09-16 12:03:08,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:03:08,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 5032 transitions. [2022-09-16 12:03:08,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 83.86666666666666) internal successors, (5032), 60 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:08,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 153.0) internal successors, (9333), 61 states have internal predecessors, (9333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:08,503 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 153.0) internal successors, (9333), 61 states have internal predecessors, (9333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:08,503 INFO L175 Difference]: Start difference. First operand has 377 places, 515 transitions, 8722 flow. Second operand 60 states and 5032 transitions. [2022-09-16 12:03:08,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 886 transitions, 16665 flow [2022-09-16 12:03:11,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 886 transitions, 16174 flow, removed 178 selfloop flow, removed 29 redundant places. [2022-09-16 12:03:11,671 INFO L231 Difference]: Finished difference. Result has 415 places, 651 transitions, 13252 flow [2022-09-16 12:03:11,671 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=8301, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=286, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=13252, PETRI_PLACES=415, PETRI_TRANSITIONS=651} [2022-09-16 12:03:11,682 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 286 predicate places. [2022-09-16 12:03:11,690 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 651 transitions, 13252 flow [2022-09-16 12:03:11,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 81.0) internal successors, (2997), 37 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:11,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:03:11,691 INFO L208 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-09-16 12:03:11,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-09-16 12:03:11,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:03:11,908 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:03:11,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:03:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1652779317, now seen corresponding path program 4 times [2022-09-16 12:03:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:03:11,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755285191] [2022-09-16 12:03:11,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:03:11,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:03:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:03:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:03:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:03:12,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755285191] [2022-09-16 12:03:12,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755285191] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:03:12,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474898633] [2022-09-16 12:03:12,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-16 12:03:12,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:03:12,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:03:12,767 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:03:12,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-09-16 12:03:12,877 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-16 12:03:12,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:03:12,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjunts are in the unsatisfiable core [2022-09-16 12:03:12,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:03:12,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:03:13,109 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:03:13,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:03:13,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 30 [2022-09-16 12:03:13,980 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-09-16 12:03:13,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 16 [2022-09-16 12:03:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:03:14,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:03:14,398 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-09-16 12:03:14,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 94 [2022-09-16 12:03:14,407 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-09-16 12:03:14,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2022-09-16 12:03:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:03:16,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474898633] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:03:16,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:03:16,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 68 [2022-09-16 12:03:16,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397901466] [2022-09-16 12:03:16,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:03:16,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-09-16 12:03:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:03:16,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-09-16 12:03:16,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=4297, Unknown=1, NotChecked=0, Total=4692 [2022-09-16 12:03:16,414 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 153 [2022-09-16 12:03:16,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 651 transitions, 13252 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-09-16 12:03:16,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:03:16,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 153 [2022-09-16 12:03:16,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:03:28,217 INFO L130 PetriNetUnfolder]: 10476/29831 cut-off events. [2022-09-16 12:03:28,218 INFO L131 PetriNetUnfolder]: For 740777/763122 co-relation queries the response was YES. [2022-09-16 12:03:28,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199230 conditions, 29831 events. 10476/29831 cut-off events. For 740777/763122 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 350288 event pairs, 1856 based on Foata normal form. 3664/32765 useless extension candidates. Maximal degree in co-relation 199146. Up to 12038 conditions per place. [2022-09-16 12:03:28,799 INFO L137 encePairwiseOnDemand]: 120/153 looper letters, 506 selfloop transitions, 400 changer transitions 3/981 dead transitions. [2022-09-16 12:03:28,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 981 transitions, 22735 flow [2022-09-16 12:03:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-09-16 12:03:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-09-16 12:03:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 3616 transitions. [2022-09-16 12:03:28,802 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5137823245240125 [2022-09-16 12:03:28,802 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 3616 transitions. [2022-09-16 12:03:28,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 3616 transitions. [2022-09-16 12:03:28,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:03:28,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 3616 transitions. [2022-09-16 12:03:28,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 78.6086956521739) internal successors, (3616), 46 states have internal predecessors, (3616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:28,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 153.0) internal successors, (7191), 47 states have internal predecessors, (7191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:28,838 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 153.0) internal successors, (7191), 47 states have internal predecessors, (7191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:28,838 INFO L175 Difference]: Start difference. First operand has 415 places, 651 transitions, 13252 flow. Second operand 46 states and 3616 transitions. [2022-09-16 12:03:28,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 981 transitions, 22735 flow [2022-09-16 12:03:33,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 981 transitions, 22137 flow, removed 101 selfloop flow, removed 29 redundant places. [2022-09-16 12:03:33,407 INFO L231 Difference]: Finished difference. Result has 439 places, 892 transitions, 20931 flow [2022-09-16 12:03:33,408 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=12671, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=20931, PETRI_PLACES=439, PETRI_TRANSITIONS=892} [2022-09-16 12:03:33,410 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 310 predicate places. [2022-09-16 12:03:33,410 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 892 transitions, 20931 flow [2022-09-16 12:03:33,411 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-09-16 12:03:33,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:03:33,411 INFO L208 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-09-16 12:03:33,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-09-16 12:03:33,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-09-16 12:03:33,628 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:03:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:03:33,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2031400389, now seen corresponding path program 1 times [2022-09-16 12:03:33,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:03:33,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194604259] [2022-09-16 12:03:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:03:33,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:03:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:03:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:03:34,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:03:34,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194604259] [2022-09-16 12:03:34,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194604259] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:03:34,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128364272] [2022-09-16 12:03:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:03:34,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:03:34,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:03:34,326 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:03:34,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-09-16 12:03:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:03:34,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 43 conjunts are in the unsatisfiable core [2022-09-16 12:03:34,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:03:35,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:03:35,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:03:35,526 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-09-16 12:03:35,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:03:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:03:35,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:03:35,818 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-09-16 12:03:35,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:03:35,831 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:03:35,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:03:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:03:37,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128364272] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:03:37,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:03:37,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 68 [2022-09-16 12:03:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635421783] [2022-09-16 12:03:37,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:03:37,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-09-16 12:03:37,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:03:37,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-09-16 12:03:37,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=4326, Unknown=10, NotChecked=0, Total=4692 [2022-09-16 12:03:37,686 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 153 [2022-09-16 12:03:37,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 892 transitions, 20931 flow. Second operand has 69 states, 69 states have (on average 80.30434782608695) internal successors, (5541), 69 states have internal predecessors, (5541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:37,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:03:37,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 153 [2022-09-16 12:03:37,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:03:55,472 INFO L130 PetriNetUnfolder]: 10665/31064 cut-off events. [2022-09-16 12:03:55,473 INFO L131 PetriNetUnfolder]: For 891887/914580 co-relation queries the response was YES. [2022-09-16 12:03:56,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226864 conditions, 31064 events. 10665/31064 cut-off events. For 891887/914580 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 369995 event pairs, 1284 based on Foata normal form. 6151/36558 useless extension candidates. Maximal degree in co-relation 226769. Up to 7345 conditions per place. [2022-09-16 12:03:56,261 INFO L137 encePairwiseOnDemand]: 121/153 looper letters, 492 selfloop transitions, 625 changer transitions 0/1192 dead transitions. [2022-09-16 12:03:56,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 1192 transitions, 27692 flow [2022-09-16 12:03:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-09-16 12:03:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-09-16 12:03:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 5131 transitions. [2022-09-16 12:03:56,265 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5409023824583596 [2022-09-16 12:03:56,265 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 5131 transitions. [2022-09-16 12:03:56,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 5131 transitions. [2022-09-16 12:03:56,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:03:56,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 5131 transitions. [2022-09-16 12:03:56,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 82.75806451612904) internal successors, (5131), 62 states have internal predecessors, (5131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:56,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 153.0) internal successors, (9639), 63 states have internal predecessors, (9639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:56,275 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 153.0) internal successors, (9639), 63 states have internal predecessors, (9639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:03:56,275 INFO L175 Difference]: Start difference. First operand has 439 places, 892 transitions, 20931 flow. Second operand 62 states and 5131 transitions. [2022-09-16 12:03:56,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 1192 transitions, 27692 flow [2022-09-16 12:04:02,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 1192 transitions, 27192 flow, removed 190 selfloop flow, removed 23 redundant places. [2022-09-16 12:04:02,977 INFO L231 Difference]: Finished difference. Result has 489 places, 962 transitions, 24122 flow [2022-09-16 12:04:02,978 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=20648, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=556, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=24122, PETRI_PLACES=489, PETRI_TRANSITIONS=962} [2022-09-16 12:04:02,978 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 360 predicate places. [2022-09-16 12:04:02,979 INFO L495 AbstractCegarLoop]: Abstraction has has 489 places, 962 transitions, 24122 flow [2022-09-16 12:04:02,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 80.30434782608695) internal successors, (5541), 69 states have internal predecessors, (5541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:04:02,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:04:02,979 INFO L208 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-09-16 12:04:02,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-09-16 12:04:03,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:04:03,196 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:04:03,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:04:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 179691830, now seen corresponding path program 1 times [2022-09-16 12:04:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:04:03,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204140994] [2022-09-16 12:04:03,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:04:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:04:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:04:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:04:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:04:03,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204140994] [2022-09-16 12:04:03,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204140994] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:04:03,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437511429] [2022-09-16 12:04:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:04:03,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:04:03,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:04:03,576 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:04:03,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-09-16 12:04:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:04:03,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 54 conjunts are in the unsatisfiable core [2022-09-16 12:04:03,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:04:03,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:04:03,957 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 12:04:03,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:04:04,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:04:04,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:04:04,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:04:04,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:04:05,197 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-09-16 12:04:05,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 18 [2022-09-16 12:04:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:04:05,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:04:06,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:04:06,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 64 [2022-09-16 12:04:06,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:04:06,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 282 treesize of output 296 [2022-09-16 12:04:06,097 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:04:06,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 127 treesize of output 121 [2022-09-16 12:04:06,103 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:04:06,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 126 [2022-09-16 12:04:09,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:04:09,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:04:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:04:09,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437511429] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:04:09,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:04:09,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27, 27] total 73 [2022-09-16 12:04:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303104752] [2022-09-16 12:04:09,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:04:09,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-09-16 12:04:09,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:04:09,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-09-16 12:04:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=4998, Unknown=17, NotChecked=0, Total=5402 [2022-09-16 12:04:09,930 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 153 [2022-09-16 12:04:09,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 962 transitions, 24122 flow. Second operand has 74 states, 74 states have (on average 73.39189189189189) internal successors, (5431), 74 states have internal predecessors, (5431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:04:09,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:04:09,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 153 [2022-09-16 12:04:09,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:04:23,672 INFO L130 PetriNetUnfolder]: 10702/31045 cut-off events. [2022-09-16 12:04:23,672 INFO L131 PetriNetUnfolder]: For 1023946/1046930 co-relation queries the response was YES. [2022-09-16 12:04:24,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241581 conditions, 31045 events. 10702/31045 cut-off events. For 1023946/1046930 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 369752 event pairs, 1973 based on Foata normal form. 4376/34867 useless extension candidates. Maximal degree in co-relation 241474. Up to 16921 conditions per place. [2022-09-16 12:04:24,791 INFO L137 encePairwiseOnDemand]: 116/153 looper letters, 613 selfloop transitions, 385 changer transitions 44/1110 dead transitions. [2022-09-16 12:04:24,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 1110 transitions, 28665 flow [2022-09-16 12:04:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-09-16 12:04:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-09-16 12:04:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 3728 transitions. [2022-09-16 12:04:24,794 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.4873202614379085 [2022-09-16 12:04:24,794 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 3728 transitions. [2022-09-16 12:04:24,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 3728 transitions. [2022-09-16 12:04:24,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:04:24,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 3728 transitions. [2022-09-16 12:04:24,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 74.56) internal successors, (3728), 50 states have internal predecessors, (3728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:04:24,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 153.0) internal successors, (7803), 51 states have internal predecessors, (7803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:04:24,826 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 153.0) internal successors, (7803), 51 states have internal predecessors, (7803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:04:24,826 INFO L175 Difference]: Start difference. First operand has 489 places, 962 transitions, 24122 flow. Second operand 50 states and 3728 transitions. [2022-09-16 12:04:24,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 1110 transitions, 28665 flow [2022-09-16 12:04:33,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 1110 transitions, 28170 flow, removed 113 selfloop flow, removed 31 redundant places. [2022-09-16 12:04:33,652 INFO L231 Difference]: Finished difference. Result has 525 places, 1022 transitions, 26356 flow [2022-09-16 12:04:33,653 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=23669, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=333, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=26356, PETRI_PLACES=525, PETRI_TRANSITIONS=1022} [2022-09-16 12:04:33,653 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 396 predicate places. [2022-09-16 12:04:33,653 INFO L495 AbstractCegarLoop]: Abstraction has has 525 places, 1022 transitions, 26356 flow [2022-09-16 12:04:33,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 73.39189189189189) internal successors, (5431), 74 states have internal predecessors, (5431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:04:33,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:04:33,654 INFO L208 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-09-16 12:04:33,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-09-16 12:04:33,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-09-16 12:04:33,867 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:04:33,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:04:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1812208722, now seen corresponding path program 2 times [2022-09-16 12:04:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:04:33,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472823388] [2022-09-16 12:04:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:04:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:04:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:04:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:04:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:04:34,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472823388] [2022-09-16 12:04:34,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472823388] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:04:34,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031701225] [2022-09-16 12:04:34,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 12:04:34,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:04:34,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:04:34,251 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:04:34,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-09-16 12:04:34,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 12:04:34,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:04:34,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 51 conjunts are in the unsatisfiable core [2022-09-16 12:04:34,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:04:34,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:04:35,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:04:35,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-09-16 12:04:35,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:04:35,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 32 [2022-09-16 12:04:35,905 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-09-16 12:04:35,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 18 [2022-09-16 12:04:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:04:35,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:04:36,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:04:36,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 64 [2022-09-16 12:04:36,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:04:36,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 282 treesize of output 296 [2022-09-16 12:04:36,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:04:36,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 228 treesize of output 222 [2022-09-16 12:04:36,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:04:36,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 126 [2022-09-16 12:04:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:04:39,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031701225] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:04:39,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:04:39,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27, 27] total 73 [2022-09-16 12:04:39,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638880676] [2022-09-16 12:04:39,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:04:39,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-09-16 12:04:39,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:04:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-09-16 12:04:39,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=4968, Unknown=26, NotChecked=0, Total=5402 [2022-09-16 12:04:39,220 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 153 [2022-09-16 12:04:39,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 1022 transitions, 26356 flow. Second operand has 74 states, 74 states have (on average 76.35135135135135) internal successors, (5650), 74 states have internal predecessors, (5650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:04:39,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:04:39,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 153 [2022-09-16 12:04:39,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:04:56,979 INFO L130 PetriNetUnfolder]: 12121/35050 cut-off events. [2022-09-16 12:04:56,979 INFO L131 PetriNetUnfolder]: For 1508807/1533731 co-relation queries the response was YES. [2022-09-16 12:04:57,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315632 conditions, 35050 events. 12121/35050 cut-off events. For 1508807/1533731 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 421038 event pairs, 1407 based on Foata normal form. 5666/40177 useless extension candidates. Maximal degree in co-relation 315508. Up to 19796 conditions per place. [2022-09-16 12:04:58,008 INFO L137 encePairwiseOnDemand]: 117/153 looper letters, 694 selfloop transitions, 610 changer transitions 12/1387 dead transitions. [2022-09-16 12:04:58,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 1387 transitions, 40563 flow [2022-09-16 12:04:58,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 12:04:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-09-16 12:04:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3476 transitions. [2022-09-16 12:04:58,011 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5048656499636892 [2022-09-16 12:04:58,011 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3476 transitions. [2022-09-16 12:04:58,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3476 transitions. [2022-09-16 12:04:58,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:04:58,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3476 transitions. [2022-09-16 12:04:58,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 77.24444444444444) internal successors, (3476), 45 states have internal predecessors, (3476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:04:58,018 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-09-16 12:04:58,018 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-09-16 12:04:58,018 INFO L175 Difference]: Start difference. First operand has 525 places, 1022 transitions, 26356 flow. Second operand 45 states and 3476 transitions. [2022-09-16 12:04:58,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 1387 transitions, 40563 flow [2022-09-16 12:05:14,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 1387 transitions, 40337 flow, removed 68 selfloop flow, removed 31 redundant places. [2022-09-16 12:05:14,312 INFO L231 Difference]: Finished difference. Result has 543 places, 1340 transitions, 40136 flow [2022-09-16 12:05:14,313 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=26149, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1022, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=40136, PETRI_PLACES=543, PETRI_TRANSITIONS=1340} [2022-09-16 12:05:14,313 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 414 predicate places. [2022-09-16 12:05:14,313 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 1340 transitions, 40136 flow [2022-09-16 12:05:14,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 76.35135135135135) internal successors, (5650), 74 states have internal predecessors, (5650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:05:14,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:05:14,314 INFO L208 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-09-16 12:05:14,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-09-16 12:05:14,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:05:14,533 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:05:14,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:05:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash 536713642, now seen corresponding path program 3 times [2022-09-16 12:05:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:05:14,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870458398] [2022-09-16 12:05:14,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:05:14,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:05:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:05:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:05:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:05:15,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870458398] [2022-09-16 12:05:15,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870458398] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:05:15,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470716325] [2022-09-16 12:05:15,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 12:05:15,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:05:15,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:05:15,437 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:05:15,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-09-16 12:05:15,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-16 12:05:15,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:05:15,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2022-09-16 12:05:15,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:05:15,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:05:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 12:05:15,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:05:15,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:05:15,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 24 [2022-09-16 12:05:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 12:05:15,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470716325] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:05:15,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:05:15,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7, 7] total 37 [2022-09-16 12:05:15,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396400183] [2022-09-16 12:05:15,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:05:15,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-09-16 12:05:15,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:05:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-09-16 12:05:15,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2022-09-16 12:05:15,893 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 153 [2022-09-16 12:05:15,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 1340 transitions, 40136 flow. Second operand has 38 states, 38 states have (on average 77.02631578947368) internal successors, (2927), 38 states have internal predecessors, (2927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:05:15,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:05:15,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 153 [2022-09-16 12:05:15,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 12:05:44,940 INFO L130 PetriNetUnfolder]: 16033/46804 cut-off events. [2022-09-16 12:05:44,941 INFO L131 PetriNetUnfolder]: For 2316299/2376498 co-relation queries the response was YES. [2022-09-16 12:05:46,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449861 conditions, 46804 events. 16033/46804 cut-off events. For 2316299/2376498 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 584895 event pairs, 976 based on Foata normal form. 13569/59864 useless extension candidates. Maximal degree in co-relation 449735. Up to 11492 conditions per place. [2022-09-16 12:05:46,956 INFO L137 encePairwiseOnDemand]: 124/153 looper letters, 670 selfloop transitions, 860 changer transitions 258/1859 dead transitions. [2022-09-16 12:05:46,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 1859 transitions, 57254 flow [2022-09-16 12:05:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-09-16 12:05:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-09-16 12:05:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 4460 transitions. [2022-09-16 12:05:46,960 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5205415499533147 [2022-09-16 12:05:46,960 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 4460 transitions. [2022-09-16 12:05:46,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 4460 transitions. [2022-09-16 12:05:46,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 12:05:46,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 4460 transitions. [2022-09-16 12:05:46,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 79.64285714285714) internal successors, (4460), 56 states have internal predecessors, (4460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:05:46,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 153.0) internal successors, (8721), 57 states have internal predecessors, (8721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:05:46,969 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 153.0) internal successors, (8721), 57 states have internal predecessors, (8721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:05:46,969 INFO L175 Difference]: Start difference. First operand has 543 places, 1340 transitions, 40136 flow. Second operand 56 states and 4460 transitions. [2022-09-16 12:05:46,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 1859 transitions, 57254 flow [2022-09-16 12:06:28,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 1859 transitions, 56514 flow, removed 332 selfloop flow, removed 33 redundant places. [2022-09-16 12:06:28,078 INFO L231 Difference]: Finished difference. Result has 580 places, 1356 transitions, 44108 flow [2022-09-16 12:06:28,080 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=39820, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=672, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=44108, PETRI_PLACES=580, PETRI_TRANSITIONS=1356} [2022-09-16 12:06:28,080 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 451 predicate places. [2022-09-16 12:06:28,080 INFO L495 AbstractCegarLoop]: Abstraction has has 580 places, 1356 transitions, 44108 flow [2022-09-16 12:06:28,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 77.02631578947368) internal successors, (2927), 38 states have internal predecessors, (2927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:06:28,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 12:06:28,081 INFO L208 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-09-16 12:06:28,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-09-16 12:06:28,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:06:28,295 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2022-09-16 12:06:28,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:06:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1817580402, now seen corresponding path program 4 times [2022-09-16 12:06:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:06:28,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342293445] [2022-09-16 12:06:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:06:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:06:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:06:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:06:28,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:06:28,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342293445] [2022-09-16 12:06:28,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342293445] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:06:28,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776186627] [2022-09-16 12:06:28,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-16 12:06:28,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:06:28,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:06:28,933 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 12:06:28,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-09-16 12:06:29,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-16 12:06:29,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 12:06:29,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 30 conjunts are in the unsatisfiable core [2022-09-16 12:06:29,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:06:29,496 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-09-16 12:06:29,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:06:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:06:29,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:06:29,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:06:29,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:06:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:06:30,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776186627] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 12:06:30,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 12:06:30,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 16] total 54 [2022-09-16 12:06:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632367556] [2022-09-16 12:06:30,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 12:06:30,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-09-16 12:06:30,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:06:30,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-09-16 12:06:30,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2629, Unknown=0, NotChecked=0, Total=2970 [2022-09-16 12:06:30,370 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 153 [2022-09-16 12:06:30,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 1356 transitions, 44108 flow. Second operand has 55 states, 55 states have (on average 80.81818181818181) internal successors, (4445), 55 states have internal predecessors, (4445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 12:06:30,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 12:06:30,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 153 [2022-09-16 12:06:30,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand