/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:59:19,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:59:19,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:59:19,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:59:19,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:59:19,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:59:19,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:59:19,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:59:19,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:59:19,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:59:19,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:59:19,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:59:19,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:59:19,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:59:19,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:59:19,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:59:19,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:59:19,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:59:19,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:59:19,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:59:19,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:59:19,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:59:19,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:59:19,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:59:19,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:59:19,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:59:19,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:59:19,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:59:19,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:59:19,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:59:19,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:59:19,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:59:19,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:59:19,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:59:19,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:59:19,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:59:19,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:59:19,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:59:19,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:59:19,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:59:19,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:59:19,875 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:59:19,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:59:19,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:59:19,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:59:19,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:59:19,904 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:59:19,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:59:19,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:59:19,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:59:19,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:59:19,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:59:19,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:59:19,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:59:19,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:59:19,906 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:59:19,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:59:19,906 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:59:19,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:59:19,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:59:19,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:59:19,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:59:19,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:59:19,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:59:19,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:59:19,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:59:19,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:59:19,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:59:19,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:59:19,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:59:19,908 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 [2022-12-06 04:59:20,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:59:20,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:59:20,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:59:20,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:59:20,241 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:59:20,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2022-12-06 04:59:21,392 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:59:21,602 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:59:21,604 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2022-12-06 04:59:21,611 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b97967a/7d22e4b802814f2ca96387c03189afd4/FLAG35f1d8ee4 [2022-12-06 04:59:21,631 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b97967a/7d22e4b802814f2ca96387c03189afd4 [2022-12-06 04:59:21,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:59:21,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:59:21,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:59:21,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:59:21,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:59:21,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c57b2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21, skipping insertion in model container [2022-12-06 04:59:21,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:59:21,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:59:21,824 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c[2251,2264] [2022-12-06 04:59:21,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:59:21,853 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:59:21,879 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c[2251,2264] [2022-12-06 04:59:21,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:59:21,902 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:59:21,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21 WrapperNode [2022-12-06 04:59:21,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:59:21,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:59:21,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:59:21,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:59:21,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,959 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 112 [2022-12-06 04:59:21,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:59:21,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:59:21,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:59:21,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:59:21,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,981 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:59:21,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:59:21,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:59:21,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:59:21,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (1/1) ... [2022-12-06 04:59:21,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:59:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:22,019 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-12-06 04:59:22,041 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-12-06 04:59:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:59:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 04:59:22,065 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 04:59:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 04:59:22,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 04:59:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:59:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:59:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:59:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 04:59:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:59:22,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:59:22,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:59:22,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:59:22,068 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:59:22,137 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:59:22,138 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:59:22,424 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:59:22,432 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:59:22,432 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 04:59:22,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:22 BoogieIcfgContainer [2022-12-06 04:59:22,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:59:22,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:59:22,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:59:22,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:59:22,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:59:21" (1/3) ... [2022-12-06 04:59:22,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e60bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:22, skipping insertion in model container [2022-12-06 04:59:22,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:21" (2/3) ... [2022-12-06 04:59:22,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e60bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:22, skipping insertion in model container [2022-12-06 04:59:22,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:22" (3/3) ... [2022-12-06 04:59:22,441 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2022-12-06 04:59:22,460 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:59:22,460 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:59:22,461 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:59:22,574 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 04:59:22,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 159 transitions, 334 flow [2022-12-06 04:59:22,732 INFO L130 PetriNetUnfolder]: 15/157 cut-off events. [2022-12-06 04:59:22,733 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:59:22,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 15/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 122 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2022-12-06 04:59:22,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 159 transitions, 334 flow [2022-12-06 04:59:22,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 149 transitions, 310 flow [2022-12-06 04:59:22,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:22,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 149 transitions, 310 flow [2022-12-06 04:59:22,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 149 transitions, 310 flow [2022-12-06 04:59:22,841 INFO L130 PetriNetUnfolder]: 15/149 cut-off events. [2022-12-06 04:59:22,841 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:59:22,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 149 events. 15/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 121 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2022-12-06 04:59:22,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 149 transitions, 310 flow [2022-12-06 04:59:22,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 992 [2022-12-06 04:59:27,463 INFO L203 LiptonReduction]: Total number of compositions: 129 [2022-12-06 04:59:27,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:59:27,480 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=REPEATED_LIPTON_PN, 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;@7da62128, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:59:27,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 04:59:27,486 INFO L130 PetriNetUnfolder]: 5/18 cut-off events. [2022-12-06 04:59:27,486 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:59:27,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:27,487 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:27,487 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1749098858, now seen corresponding path program 1 times [2022-12-06 04:59:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:27,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407958234] [2022-12-06 04:59:27,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:27,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:28,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407958234] [2022-12-06 04:59:28,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407958234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:28,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:28,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112671315] [2022-12-06 04:59:28,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:28,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:59:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:28,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:59:28,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:59:28,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:59:28,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:28,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:28,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:59:28,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:28,205 INFO L130 PetriNetUnfolder]: 81/151 cut-off events. [2022-12-06 04:59:28,205 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 04:59:28,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 151 events. 81/151 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 24 based on Foata normal form. 2/109 useless extension candidates. Maximal degree in co-relation 204. Up to 73 conditions per place. [2022-12-06 04:59:28,208 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 27 selfloop transitions, 4 changer transitions 13/44 dead transitions. [2022-12-06 04:59:28,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 44 transitions, 209 flow [2022-12-06 04:59:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 04:59:28,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2022-12-06 04:59:28,219 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 50 flow. Second operand 5 states and 48 transitions. [2022-12-06 04:59:28,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 44 transitions, 209 flow [2022-12-06 04:59:28,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 44 transitions, 187 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:59:28,223 INFO L231 Difference]: Finished difference. Result has 24 places, 22 transitions, 77 flow [2022-12-06 04:59:28,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=24, PETRI_TRANSITIONS=22} [2022-12-06 04:59:28,227 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 04:59:28,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:28,228 INFO L89 Accepts]: Start accepts. Operand has 24 places, 22 transitions, 77 flow [2022-12-06 04:59:28,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:28,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:28,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 22 transitions, 77 flow [2022-12-06 04:59:28,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 77 flow [2022-12-06 04:59:28,242 INFO L130 PetriNetUnfolder]: 12/37 cut-off events. [2022-12-06 04:59:28,243 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:59:28,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 37 events. 12/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 56. Up to 12 conditions per place. [2022-12-06 04:59:28,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 22 transitions, 77 flow [2022-12-06 04:59:28,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-06 04:59:29,066 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:29,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 840 [2022-12-06 04:59:29,068 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 73 flow [2022-12-06 04:59:29,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:29,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:29,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:29,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:59:29,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:29,069 INFO L85 PathProgramCache]: Analyzing trace with hash 479574592, now seen corresponding path program 1 times [2022-12-06 04:59:29,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:29,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77532785] [2022-12-06 04:59:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:29,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:29,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:29,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77532785] [2022-12-06 04:59:29,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77532785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:29,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:29,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:59:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706145140] [2022-12-06 04:59:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:29,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:59:29,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:29,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:59:29,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:59:29,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:59:29,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:29,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:29,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:59:29,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:29,260 INFO L130 PetriNetUnfolder]: 150/267 cut-off events. [2022-12-06 04:59:29,260 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-06 04:59:29,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 267 events. 150/267 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 852 event pairs, 70 based on Foata normal form. 16/280 useless extension candidates. Maximal degree in co-relation 664. Up to 105 conditions per place. [2022-12-06 04:59:29,262 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 42 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2022-12-06 04:59:29,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 48 transitions, 252 flow [2022-12-06 04:59:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-06 04:59:29,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4842105263157895 [2022-12-06 04:59:29,263 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 73 flow. Second operand 5 states and 46 transitions. [2022-12-06 04:59:29,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 48 transitions, 252 flow [2022-12-06 04:59:29,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 48 transitions, 236 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:29,265 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 101 flow [2022-12-06 04:59:29,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2022-12-06 04:59:29,265 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 04:59:29,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:29,266 INFO L89 Accepts]: Start accepts. Operand has 27 places, 24 transitions, 101 flow [2022-12-06 04:59:29,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:29,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:29,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 24 transitions, 101 flow [2022-12-06 04:59:29,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 101 flow [2022-12-06 04:59:29,271 INFO L130 PetriNetUnfolder]: 14/59 cut-off events. [2022-12-06 04:59:29,271 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-12-06 04:59:29,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 59 events. 14/59 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 65. Up to 16 conditions per place. [2022-12-06 04:59:29,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 24 transitions, 101 flow [2022-12-06 04:59:29,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 04:59:29,818 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:29,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 554 [2022-12-06 04:59:29,819 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 97 flow [2022-12-06 04:59:29,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:29,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:29,819 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:29,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:59:29,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:29,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:29,820 INFO L85 PathProgramCache]: Analyzing trace with hash -875387484, now seen corresponding path program 1 times [2022-12-06 04:59:29,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:29,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953694340] [2022-12-06 04:59:29,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:29,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:29,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:29,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953694340] [2022-12-06 04:59:29,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953694340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:29,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:29,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410946463] [2022-12-06 04:59:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:29,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:29,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:29,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:29,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:59:29,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:29,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:29,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:59:29,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:29,948 INFO L130 PetriNetUnfolder]: 132/236 cut-off events. [2022-12-06 04:59:29,949 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-06 04:59:29,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 236 events. 132/236 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 718 event pairs, 54 based on Foata normal form. 6/241 useless extension candidates. Maximal degree in co-relation 578. Up to 113 conditions per place. [2022-12-06 04:59:29,950 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 32 selfloop transitions, 3 changer transitions 10/45 dead transitions. [2022-12-06 04:59:29,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 45 transitions, 252 flow [2022-12-06 04:59:29,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 04:59:29,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-06 04:59:29,964 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 97 flow. Second operand 4 states and 43 transitions. [2022-12-06 04:59:29,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 45 transitions, 252 flow [2022-12-06 04:59:29,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 45 transitions, 234 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 04:59:29,965 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 93 flow [2022-12-06 04:59:29,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2022-12-06 04:59:29,966 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-06 04:59:29,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:29,966 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 93 flow [2022-12-06 04:59:29,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:29,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:29,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 93 flow [2022-12-06 04:59:29,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 93 flow [2022-12-06 04:59:29,971 INFO L130 PetriNetUnfolder]: 13/45 cut-off events. [2022-12-06 04:59:29,971 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 04:59:29,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 45 events. 13/45 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 67. Up to 17 conditions per place. [2022-12-06 04:59:29,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 23 transitions, 93 flow [2022-12-06 04:59:29,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 04:59:29,972 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:29,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:59:29,973 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 93 flow [2022-12-06 04:59:29,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:29,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:29,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:29,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:59:29,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:29,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1579593735, now seen corresponding path program 1 times [2022-12-06 04:59:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:29,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247266398] [2022-12-06 04:59:29,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:29,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:59:30,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:30,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247266398] [2022-12-06 04:59:30,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247266398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:30,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:30,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325502338] [2022-12-06 04:59:30,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:30,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:30,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:30,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:59:30,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:30,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:30,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:59:30,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:30,087 INFO L130 PetriNetUnfolder]: 113/199 cut-off events. [2022-12-06 04:59:30,087 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 04:59:30,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 199 events. 113/199 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 567 event pairs, 45 based on Foata normal form. 10/207 useless extension candidates. Maximal degree in co-relation 336. Up to 113 conditions per place. [2022-12-06 04:59:30,089 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 04:59:30,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 198 flow [2022-12-06 04:59:30,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 04:59:30,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-06 04:59:30,090 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 93 flow. Second operand 4 states and 32 transitions. [2022-12-06 04:59:30,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 198 flow [2022-12-06 04:59:30,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 34 transitions, 191 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:30,091 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 101 flow [2022-12-06 04:59:30,091 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2022-12-06 04:59:30,092 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-06 04:59:30,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:30,092 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 101 flow [2022-12-06 04:59:30,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:30,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:30,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 101 flow [2022-12-06 04:59:30,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 101 flow [2022-12-06 04:59:30,096 INFO L130 PetriNetUnfolder]: 13/45 cut-off events. [2022-12-06 04:59:30,096 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:59:30,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 45 events. 13/45 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 93 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 67. Up to 17 conditions per place. [2022-12-06 04:59:30,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 23 transitions, 101 flow [2022-12-06 04:59:30,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 04:59:30,097 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:30,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 04:59:30,098 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 101 flow [2022-12-06 04:59:30,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:30,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:30,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:30,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:59:30,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:30,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1232028078, now seen corresponding path program 1 times [2022-12-06 04:59:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:30,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539729275] [2022-12-06 04:59:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:30,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:30,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539729275] [2022-12-06 04:59:30,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539729275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:30,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:30,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:59:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603768478] [2022-12-06 04:59:30,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:30,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:59:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:59:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:59:30,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:59:30,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 101 flow. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:30,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:30,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:59:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:30,577 INFO L130 PetriNetUnfolder]: 126/219 cut-off events. [2022-12-06 04:59:30,577 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-12-06 04:59:30,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 219 events. 126/219 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 671 event pairs, 22 based on Foata normal form. 2/220 useless extension candidates. Maximal degree in co-relation 316. Up to 164 conditions per place. [2022-12-06 04:59:30,579 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 27 selfloop transitions, 10 changer transitions 4/41 dead transitions. [2022-12-06 04:59:30,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 236 flow [2022-12-06 04:59:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:59:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:59:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-12-06 04:59:30,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3007518796992481 [2022-12-06 04:59:30,581 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 101 flow. Second operand 7 states and 40 transitions. [2022-12-06 04:59:30,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 236 flow [2022-12-06 04:59:30,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:59:30,584 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 155 flow [2022-12-06 04:59:30,584 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=155, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2022-12-06 04:59:30,586 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-06 04:59:30,586 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:30,586 INFO L89 Accepts]: Start accepts. Operand has 34 places, 28 transitions, 155 flow [2022-12-06 04:59:30,587 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:30,587 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:30,587 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 155 flow [2022-12-06 04:59:30,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 155 flow [2022-12-06 04:59:30,594 INFO L130 PetriNetUnfolder]: 27/83 cut-off events. [2022-12-06 04:59:30,595 INFO L131 PetriNetUnfolder]: For 48/50 co-relation queries the response was YES. [2022-12-06 04:59:30,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 83 events. 27/83 cut-off events. For 48/50 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 265 event pairs, 3 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 172. Up to 28 conditions per place. [2022-12-06 04:59:30,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 155 flow [2022-12-06 04:59:30,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 04:59:30,603 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 04:59:30,640 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:59:30,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:30,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 04:59:30,726 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 163 flow [2022-12-06 04:59:30,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:30,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:30,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:30,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:59:30,727 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:30,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1339657302, now seen corresponding path program 1 times [2022-12-06 04:59:30,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:30,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338109565] [2022-12-06 04:59:30,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:30,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:31,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:31,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338109565] [2022-12-06 04:59:31,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338109565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:31,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:31,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:59:31,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371729293] [2022-12-06 04:59:31,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:31,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:59:31,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:59:31,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:59:31,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:59:31,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:31,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:31,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:59:31,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:31,362 INFO L130 PetriNetUnfolder]: 122/217 cut-off events. [2022-12-06 04:59:31,362 INFO L131 PetriNetUnfolder]: For 362/362 co-relation queries the response was YES. [2022-12-06 04:59:31,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 217 events. 122/217 cut-off events. For 362/362 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 704 event pairs, 21 based on Foata normal form. 4/221 useless extension candidates. Maximal degree in co-relation 629. Up to 164 conditions per place. [2022-12-06 04:59:31,364 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 28 selfloop transitions, 5 changer transitions 9/42 dead transitions. [2022-12-06 04:59:31,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 295 flow [2022-12-06 04:59:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 04:59:31,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44565217391304346 [2022-12-06 04:59:31,366 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 163 flow. Second operand 4 states and 41 transitions. [2022-12-06 04:59:31,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 295 flow [2022-12-06 04:59:31,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 42 transitions, 269 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 04:59:31,371 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 143 flow [2022-12-06 04:59:31,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-12-06 04:59:31,376 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2022-12-06 04:59:31,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:31,376 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 143 flow [2022-12-06 04:59:31,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:31,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:31,376 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 143 flow [2022-12-06 04:59:31,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 143 flow [2022-12-06 04:59:31,382 INFO L130 PetriNetUnfolder]: 24/76 cut-off events. [2022-12-06 04:59:31,382 INFO L131 PetriNetUnfolder]: For 58/60 co-relation queries the response was YES. [2022-12-06 04:59:31,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 76 events. 24/76 cut-off events. For 58/60 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 245 event pairs, 3 based on Foata normal form. 2/74 useless extension candidates. Maximal degree in co-relation 115. Up to 24 conditions per place. [2022-12-06 04:59:31,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 26 transitions, 143 flow [2022-12-06 04:59:31,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 04:59:31,384 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:31,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 04:59:31,385 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 143 flow [2022-12-06 04:59:31,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:31,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:31,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:31,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:59:31,385 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1405615281, now seen corresponding path program 1 times [2022-12-06 04:59:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:31,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098737394] [2022-12-06 04:59:31,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:31,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098737394] [2022-12-06 04:59:31,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098737394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:31,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:31,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:59:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033496964] [2022-12-06 04:59:31,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:31,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:59:31,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:31,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:59:31,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:59:31,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:59:31,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 143 flow. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:31,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:31,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:59:31,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:31,959 INFO L130 PetriNetUnfolder]: 112/196 cut-off events. [2022-12-06 04:59:31,959 INFO L131 PetriNetUnfolder]: For 252/252 co-relation queries the response was YES. [2022-12-06 04:59:31,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 196 events. 112/196 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 596 event pairs, 15 based on Foata normal form. 2/198 useless extension candidates. Maximal degree in co-relation 378. Up to 162 conditions per place. [2022-12-06 04:59:31,961 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 26 selfloop transitions, 10 changer transitions 4/40 dead transitions. [2022-12-06 04:59:31,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 272 flow [2022-12-06 04:59:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:59:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:59:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-12-06 04:59:31,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2532467532467532 [2022-12-06 04:59:31,964 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 143 flow. Second operand 7 states and 39 transitions. [2022-12-06 04:59:31,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 272 flow [2022-12-06 04:59:31,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:31,965 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 174 flow [2022-12-06 04:59:31,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-06 04:59:31,965 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 04:59:31,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:31,966 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 174 flow [2022-12-06 04:59:31,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:31,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:31,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 174 flow [2022-12-06 04:59:31,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 174 flow [2022-12-06 04:59:31,973 INFO L130 PetriNetUnfolder]: 24/72 cut-off events. [2022-12-06 04:59:31,973 INFO L131 PetriNetUnfolder]: For 77/78 co-relation queries the response was YES. [2022-12-06 04:59:31,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 72 events. 24/72 cut-off events. For 77/78 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 216 event pairs, 5 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 170. Up to 25 conditions per place. [2022-12-06 04:59:31,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 174 flow [2022-12-06 04:59:31,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 04:59:31,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [584] L47-5-->L80-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_51| |v_#pthreadsForks_72|) (< v_~i_AB~0_81 v_~An~0_70) (= |v_#pthreadsForks_71| (+ |v_#pthreadsForks_72| 1)) (= (select (select |v_#memory_int_158| v_~A~0.base_69) (+ v_~A~0.offset_69 (* v_~i_AB~0_81 4))) |v_thread1Thread1of1ForFork1_#t~mem1_57|) (< v_~i_AB~0_81 v_~Bn~0_86) (= (store |v_#memory_int_158| |v_ULTIMATE.start_main_~#t2~0#1.base_49| (store (select |v_#memory_int_158| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) |v_ULTIMATE.start_main_~#t2~0#1.offset_49| |v_ULTIMATE.start_main_#t~pre13#1_51|)) |v_#memory_int_157|)) InVars {~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, #pthreadsForks=|v_#pthreadsForks_72|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, #memory_int=|v_#memory_int_158|, ~i_AB~0=v_~i_AB~0_81, ~Bn~0=v_~Bn~0_86, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ~An~0=v_~An~0_70} OutVars{~A~0.base=v_~A~0.base_69, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_51|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_57|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, ~i_AB~0=v_~i_AB~0_81, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_39|, ~An~0=v_~An~0_70, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_57|, ~A~0.offset=v_~A~0.offset_69, #pthreadsForks=|v_#pthreadsForks_71|, #memory_int=|v_#memory_int_157|, ~Bn~0=v_~Bn~0_86, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork1_#t~mem1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 04:59:32,015 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [584] L47-5-->L80-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_51| |v_#pthreadsForks_72|) (< v_~i_AB~0_81 v_~An~0_70) (= |v_#pthreadsForks_71| (+ |v_#pthreadsForks_72| 1)) (= (select (select |v_#memory_int_158| v_~A~0.base_69) (+ v_~A~0.offset_69 (* v_~i_AB~0_81 4))) |v_thread1Thread1of1ForFork1_#t~mem1_57|) (< v_~i_AB~0_81 v_~Bn~0_86) (= (store |v_#memory_int_158| |v_ULTIMATE.start_main_~#t2~0#1.base_49| (store (select |v_#memory_int_158| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) |v_ULTIMATE.start_main_~#t2~0#1.offset_49| |v_ULTIMATE.start_main_#t~pre13#1_51|)) |v_#memory_int_157|)) InVars {~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, #pthreadsForks=|v_#pthreadsForks_72|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, #memory_int=|v_#memory_int_158|, ~i_AB~0=v_~i_AB~0_81, ~Bn~0=v_~Bn~0_86, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ~An~0=v_~An~0_70} OutVars{~A~0.base=v_~A~0.base_69, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_51|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_57|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, ~i_AB~0=v_~i_AB~0_81, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_39|, ~An~0=v_~An~0_70, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_57|, ~A~0.offset=v_~A~0.offset_69, #pthreadsForks=|v_#pthreadsForks_71|, #memory_int=|v_#memory_int_157|, ~Bn~0=v_~Bn~0_86, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork1_#t~mem1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [566] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_17| 0) (not (= (select (select |v_#memory_int_117| v_~B~0.base_51) (+ (* v_~i_AB~0_57 4) v_~B~0.offset_51)) |v_thread1Thread1of1ForFork1_#t~mem1_32|)) (= |v_thread1Thread1of1ForFork1_#res.base_17| 0)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_32|, ~B~0.base=v_~B~0.base_51, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, ~B~0.offset=v_~B~0.offset_51} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_17|, ~B~0.base=v_~B~0.base_51, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_33|, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_17|, ~B~0.offset=v_~B~0.offset_51} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 04:59:32,061 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:32,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 04:59:32,062 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 184 flow [2022-12-06 04:59:32,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:32,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:32,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:32,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:59:32,062 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:32,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1334500807, now seen corresponding path program 1 times [2022-12-06 04:59:32,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:32,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491676385] [2022-12-06 04:59:32,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:32,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:32,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:32,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491676385] [2022-12-06 04:59:32,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491676385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:32,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:32,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:59:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127799842] [2022-12-06 04:59:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:32,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:32,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:32,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:32,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:59:32,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:32,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:32,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:59:32,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:32,509 INFO L130 PetriNetUnfolder]: 103/185 cut-off events. [2022-12-06 04:59:32,509 INFO L131 PetriNetUnfolder]: For 376/376 co-relation queries the response was YES. [2022-12-06 04:59:32,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 185 events. 103/185 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 550 event pairs, 31 based on Foata normal form. 2/186 useless extension candidates. Maximal degree in co-relation 651. Up to 158 conditions per place. [2022-12-06 04:59:32,510 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 8 changer transitions 5/38 dead transitions. [2022-12-06 04:59:32,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 290 flow [2022-12-06 04:59:32,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:59:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:59:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-06 04:59:32,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 04:59:32,511 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 184 flow. Second operand 6 states and 36 transitions. [2022-12-06 04:59:32,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 290 flow [2022-12-06 04:59:32,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 268 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-06 04:59:32,512 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 186 flow [2022-12-06 04:59:32,512 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-06 04:59:32,513 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 04:59:32,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:32,513 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 186 flow [2022-12-06 04:59:32,513 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:32,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:32,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 186 flow [2022-12-06 04:59:32,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 186 flow [2022-12-06 04:59:32,518 INFO L130 PetriNetUnfolder]: 23/71 cut-off events. [2022-12-06 04:59:32,518 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 04:59:32,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 71 events. 23/71 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 220 event pairs, 2 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 131. Up to 22 conditions per place. [2022-12-06 04:59:32,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 186 flow [2022-12-06 04:59:32,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 04:59:32,519 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:32,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:59:32,520 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 186 flow [2022-12-06 04:59:32,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:32,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:32,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:32,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:59:32,521 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:32,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:32,521 INFO L85 PathProgramCache]: Analyzing trace with hash 198995376, now seen corresponding path program 1 times [2022-12-06 04:59:32,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:32,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102709661] [2022-12-06 04:59:32,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:32,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:32,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:32,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102709661] [2022-12-06 04:59:32,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102709661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:32,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:32,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:59:32,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709227192] [2022-12-06 04:59:32,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:32,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:32,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:32,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:32,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:32,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:59:32,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:32,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:32,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:59:32,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:32,924 INFO L130 PetriNetUnfolder]: 95/170 cut-off events. [2022-12-06 04:59:32,925 INFO L131 PetriNetUnfolder]: For 426/426 co-relation queries the response was YES. [2022-12-06 04:59:32,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 170 events. 95/170 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 460 event pairs, 39 based on Foata normal form. 4/173 useless extension candidates. Maximal degree in co-relation 354. Up to 154 conditions per place. [2022-12-06 04:59:32,926 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 23 selfloop transitions, 7 changer transitions 5/35 dead transitions. [2022-12-06 04:59:32,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 275 flow [2022-12-06 04:59:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-06 04:59:32,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-06 04:59:32,927 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 186 flow. Second operand 5 states and 33 transitions. [2022-12-06 04:59:32,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 275 flow [2022-12-06 04:59:32,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 253 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 04:59:32,928 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 170 flow [2022-12-06 04:59:32,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-06 04:59:32,928 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-06 04:59:32,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:32,928 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 170 flow [2022-12-06 04:59:32,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:32,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:32,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 170 flow [2022-12-06 04:59:32,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 170 flow [2022-12-06 04:59:32,934 INFO L130 PetriNetUnfolder]: 21/66 cut-off events. [2022-12-06 04:59:32,934 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 04:59:32,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 66 events. 21/66 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 184 event pairs, 3 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 116. Up to 21 conditions per place. [2022-12-06 04:59:32,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 170 flow [2022-12-06 04:59:32,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-06 04:59:32,935 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:32,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:59:32,935 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 170 flow [2022-12-06 04:59:32,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:32,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:32,936 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:32,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:59:32,936 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:32,936 INFO L85 PathProgramCache]: Analyzing trace with hash 876829237, now seen corresponding path program 1 times [2022-12-06 04:59:32,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:32,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695419021] [2022-12-06 04:59:32,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:32,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:33,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:33,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695419021] [2022-12-06 04:59:33,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695419021] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:33,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933448494] [2022-12-06 04:59:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:33,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:33,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:33,289 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-12-06 04:59:33,338 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-12-06 04:59:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:33,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 04:59:33,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:33,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:33,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 04:59:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:33,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:33,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:59:33,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 182 [2022-12-06 04:59:33,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:59:33,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 104 [2022-12-06 04:59:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:34,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933448494] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:34,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:34,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 11 [2022-12-06 04:59:34,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551322401] [2022-12-06 04:59:34,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:34,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 04:59:34,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:34,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 04:59:34,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-06 04:59:34,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:59:34,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 170 flow. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:34,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:34,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:59:34,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:34,352 INFO L130 PetriNetUnfolder]: 112/193 cut-off events. [2022-12-06 04:59:34,353 INFO L131 PetriNetUnfolder]: For 419/419 co-relation queries the response was YES. [2022-12-06 04:59:34,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 193 events. 112/193 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 535 event pairs, 13 based on Foata normal form. 8/201 useless extension candidates. Maximal degree in co-relation 422. Up to 153 conditions per place. [2022-12-06 04:59:34,354 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 29 selfloop transitions, 10 changer transitions 0/39 dead transitions. [2022-12-06 04:59:34,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 297 flow [2022-12-06 04:59:34,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:59:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:59:34,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-12-06 04:59:34,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26811594202898553 [2022-12-06 04:59:34,355 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 170 flow. Second operand 6 states and 37 transitions. [2022-12-06 04:59:34,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 297 flow [2022-12-06 04:59:34,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 283 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:59:34,356 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 198 flow [2022-12-06 04:59:34,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-06 04:59:34,357 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 04:59:34,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:34,357 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 198 flow [2022-12-06 04:59:34,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:34,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:34,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 198 flow [2022-12-06 04:59:34,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 198 flow [2022-12-06 04:59:34,363 INFO L130 PetriNetUnfolder]: 24/75 cut-off events. [2022-12-06 04:59:34,363 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-06 04:59:34,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 75 events. 24/75 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 236 event pairs, 4 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 139. Up to 23 conditions per place. [2022-12-06 04:59:34,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 198 flow [2022-12-06 04:59:34,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 04:59:34,364 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:34,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:59:34,365 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 198 flow [2022-12-06 04:59:34,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:34,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:34,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:34,373 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-12-06 04:59:34,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 04:59:34,570 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:34,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:34,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1700841223, now seen corresponding path program 2 times [2022-12-06 04:59:34,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:34,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041024761] [2022-12-06 04:59:34,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:34,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:34,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:34,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041024761] [2022-12-06 04:59:34,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041024761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:34,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110821039] [2022-12-06 04:59:34,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:59:34,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:34,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:34,941 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-12-06 04:59:34,943 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-12-06 04:59:35,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:59:35,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:59:35,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 04:59:35,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:35,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:35,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:35,215 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 04:59:35,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2022-12-06 04:59:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:35,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:35,347 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-06 04:59:35,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 151 [2022-12-06 04:59:35,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:59:35,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 58 [2022-12-06 04:59:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:35,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110821039] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:35,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:35,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 04:59:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387303266] [2022-12-06 04:59:35,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:35,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 04:59:35,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:35,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 04:59:35,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=221, Unknown=1, NotChecked=0, Total=272 [2022-12-06 04:59:35,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:59:35,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 198 flow. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:35,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:35,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:59:35,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:35,858 INFO L130 PetriNetUnfolder]: 99/170 cut-off events. [2022-12-06 04:59:35,858 INFO L131 PetriNetUnfolder]: For 488/488 co-relation queries the response was YES. [2022-12-06 04:59:35,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 170 events. 99/170 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 14 based on Foata normal form. 8/178 useless extension candidates. Maximal degree in co-relation 454. Up to 107 conditions per place. [2022-12-06 04:59:35,859 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 28 selfloop transitions, 10 changer transitions 0/38 dead transitions. [2022-12-06 04:59:35,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 308 flow [2022-12-06 04:59:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:59:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:59:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-06 04:59:35,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2608695652173913 [2022-12-06 04:59:35,860 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 198 flow. Second operand 6 states and 36 transitions. [2022-12-06 04:59:35,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 308 flow [2022-12-06 04:59:35,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:59:35,862 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 208 flow [2022-12-06 04:59:35,862 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-12-06 04:59:35,862 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-06 04:59:35,862 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:35,862 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 208 flow [2022-12-06 04:59:35,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:35,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:35,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 208 flow [2022-12-06 04:59:35,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 208 flow [2022-12-06 04:59:35,868 INFO L130 PetriNetUnfolder]: 22/67 cut-off events. [2022-12-06 04:59:35,868 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-12-06 04:59:35,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 67 events. 22/67 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 193 event pairs, 3 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 147. Up to 20 conditions per place. [2022-12-06 04:59:35,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 208 flow [2022-12-06 04:59:35,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 04:59:35,869 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:35,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 04:59:35,870 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 208 flow [2022-12-06 04:59:35,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:35,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:35,870 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:35,877 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-12-06 04:59:36,075 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,SelfDestructingSolverStorable10 [2022-12-06 04:59:36,075 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:36,076 INFO L85 PathProgramCache]: Analyzing trace with hash -395382877, now seen corresponding path program 1 times [2022-12-06 04:59:36,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:36,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298113885] [2022-12-06 04:59:36,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:36,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:36,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:36,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298113885] [2022-12-06 04:59:36,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298113885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:36,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783805674] [2022-12-06 04:59:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:36,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:36,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:36,175 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-12-06 04:59:36,189 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-12-06 04:59:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:36,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 04:59:36,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:36,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:36,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783805674] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:36,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:36,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2022-12-06 04:59:36,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997771976] [2022-12-06 04:59:36,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:36,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:59:36,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:36,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:59:36,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:59:36,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:59:36,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 208 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:36,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:36,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:59:36,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:36,469 INFO L130 PetriNetUnfolder]: 215/363 cut-off events. [2022-12-06 04:59:36,469 INFO L131 PetriNetUnfolder]: For 1160/1160 co-relation queries the response was YES. [2022-12-06 04:59:36,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 363 events. 215/363 cut-off events. For 1160/1160 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1236 event pairs, 14 based on Foata normal form. 2/365 useless extension candidates. Maximal degree in co-relation 951. Up to 181 conditions per place. [2022-12-06 04:59:36,471 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 56 selfloop transitions, 15 changer transitions 2/73 dead transitions. [2022-12-06 04:59:36,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 73 transitions, 581 flow [2022-12-06 04:59:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:59:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:59:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-06 04:59:36,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2022-12-06 04:59:36,472 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 208 flow. Second operand 7 states and 70 transitions. [2022-12-06 04:59:36,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 73 transitions, 581 flow [2022-12-06 04:59:36,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 73 transitions, 555 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-06 04:59:36,475 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 310 flow [2022-12-06 04:59:36,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-06 04:59:36,475 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-06 04:59:36,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:36,475 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 310 flow [2022-12-06 04:59:36,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:36,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:36,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 310 flow [2022-12-06 04:59:36,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 310 flow [2022-12-06 04:59:36,484 INFO L130 PetriNetUnfolder]: 40/122 cut-off events. [2022-12-06 04:59:36,484 INFO L131 PetriNetUnfolder]: For 285/291 co-relation queries the response was YES. [2022-12-06 04:59:36,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 122 events. 40/122 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 495 event pairs, 6 based on Foata normal form. 2/115 useless extension candidates. Maximal degree in co-relation 359. Up to 34 conditions per place. [2022-12-06 04:59:36,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 310 flow [2022-12-06 04:59:36,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 04:59:36,486 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:36,487 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:59:36,487 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 310 flow [2022-12-06 04:59:36,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:36,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:36,487 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:36,508 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-12-06 04:59:36,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:36,693 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1149504912, now seen corresponding path program 1 times [2022-12-06 04:59:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:36,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442770952] [2022-12-06 04:59:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:36,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:36,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:36,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442770952] [2022-12-06 04:59:36,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442770952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:36,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:36,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:59:36,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434053510] [2022-12-06 04:59:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:36,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:59:36,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:36,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:59:36,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:59:36,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:59:36,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:36,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:36,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:59:36,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:37,026 INFO L130 PetriNetUnfolder]: 221/373 cut-off events. [2022-12-06 04:59:37,026 INFO L131 PetriNetUnfolder]: For 1585/1585 co-relation queries the response was YES. [2022-12-06 04:59:37,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 373 events. 221/373 cut-off events. For 1585/1585 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1273 event pairs, 101 based on Foata normal form. 4/377 useless extension candidates. Maximal degree in co-relation 1504. Up to 354 conditions per place. [2022-12-06 04:59:37,028 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 37 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2022-12-06 04:59:37,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 434 flow [2022-12-06 04:59:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 04:59:37,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2022-12-06 04:59:37,029 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 310 flow. Second operand 4 states and 32 transitions. [2022-12-06 04:59:37,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 434 flow [2022-12-06 04:59:37,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 396 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:37,032 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 299 flow [2022-12-06 04:59:37,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 04:59:37,033 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-06 04:59:37,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:37,033 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 299 flow [2022-12-06 04:59:37,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:37,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:37,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 299 flow [2022-12-06 04:59:37,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 299 flow [2022-12-06 04:59:37,042 INFO L130 PetriNetUnfolder]: 41/125 cut-off events. [2022-12-06 04:59:37,042 INFO L131 PetriNetUnfolder]: For 291/297 co-relation queries the response was YES. [2022-12-06 04:59:37,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 125 events. 41/125 cut-off events. For 291/297 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 510 event pairs, 6 based on Foata normal form. 2/118 useless extension candidates. Maximal degree in co-relation 380. Up to 33 conditions per place. [2022-12-06 04:59:37,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 299 flow [2022-12-06 04:59:37,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-06 04:59:37,043 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:37,044 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 04:59:37,044 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 299 flow [2022-12-06 04:59:37,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:37,044 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:37,044 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:37,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:59:37,044 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:37,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:37,044 INFO L85 PathProgramCache]: Analyzing trace with hash 509128806, now seen corresponding path program 1 times [2022-12-06 04:59:37,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:37,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540762093] [2022-12-06 04:59:37,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:37,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:37,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540762093] [2022-12-06 04:59:37,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540762093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:37,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:37,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:59:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353342055] [2022-12-06 04:59:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:37,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:59:37,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:37,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:59:37,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:59:37,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:59:37,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 299 flow. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:37,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:37,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:59:37,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:37,474 INFO L130 PetriNetUnfolder]: 227/383 cut-off events. [2022-12-06 04:59:37,474 INFO L131 PetriNetUnfolder]: For 1567/1567 co-relation queries the response was YES. [2022-12-06 04:59:37,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 383 events. 227/383 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1321 event pairs, 104 based on Foata normal form. 4/387 useless extension candidates. Maximal degree in co-relation 1549. Up to 356 conditions per place. [2022-12-06 04:59:37,477 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 37 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2022-12-06 04:59:37,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 436 flow [2022-12-06 04:59:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:59:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:59:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-12-06 04:59:37,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2536231884057971 [2022-12-06 04:59:37,477 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 299 flow. Second operand 6 states and 35 transitions. [2022-12-06 04:59:37,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 436 flow [2022-12-06 04:59:37,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:37,481 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 324 flow [2022-12-06 04:59:37,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-06 04:59:37,481 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-06 04:59:37,481 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:37,481 INFO L89 Accepts]: Start accepts. Operand has 49 places, 40 transitions, 324 flow [2022-12-06 04:59:37,484 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:37,484 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:37,484 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 324 flow [2022-12-06 04:59:37,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 324 flow [2022-12-06 04:59:37,498 INFO L130 PetriNetUnfolder]: 42/127 cut-off events. [2022-12-06 04:59:37,498 INFO L131 PetriNetUnfolder]: For 351/357 co-relation queries the response was YES. [2022-12-06 04:59:37,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 127 events. 42/127 cut-off events. For 351/357 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 522 event pairs, 6 based on Foata normal form. 2/120 useless extension candidates. Maximal degree in co-relation 410. Up to 33 conditions per place. [2022-12-06 04:59:37,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 40 transitions, 324 flow [2022-12-06 04:59:37,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 04:59:37,500 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:37,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 04:59:37,501 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 324 flow [2022-12-06 04:59:37,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:37,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:37,501 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:37,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:59:37,501 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash -545822863, now seen corresponding path program 2 times [2022-12-06 04:59:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:37,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168675167] [2022-12-06 04:59:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:59:37,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:37,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168675167] [2022-12-06 04:59:37,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168675167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:37,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937967685] [2022-12-06 04:59:37,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:59:37,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:37,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:37,558 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-12-06 04:59:37,571 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-12-06 04:59:37,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:59:37,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:59:37,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 04:59:37,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:59:37,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 04:59:37,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937967685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:37,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 04:59:37,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2022-12-06 04:59:37,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234344686] [2022-12-06 04:59:37,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:37,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:37,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:37,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 04:59:37,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:59:37,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:37,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:37,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:59:37,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:37,890 INFO L130 PetriNetUnfolder]: 390/684 cut-off events. [2022-12-06 04:59:37,891 INFO L131 PetriNetUnfolder]: For 3233/3233 co-relation queries the response was YES. [2022-12-06 04:59:37,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3291 conditions, 684 events. 390/684 cut-off events. For 3233/3233 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2950 event pairs, 152 based on Foata normal form. 36/720 useless extension candidates. Maximal degree in co-relation 3029. Up to 383 conditions per place. [2022-12-06 04:59:37,895 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 68 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2022-12-06 04:59:37,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 789 flow [2022-12-06 04:59:37,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:59:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:59:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 04:59:37,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2022-12-06 04:59:37,896 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 324 flow. Second operand 6 states and 51 transitions. [2022-12-06 04:59:37,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 789 flow [2022-12-06 04:59:37,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 79 transitions, 751 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 04:59:37,901 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 462 flow [2022-12-06 04:59:37,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2022-12-06 04:59:37,901 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 04:59:37,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:37,901 INFO L89 Accepts]: Start accepts. Operand has 53 places, 49 transitions, 462 flow [2022-12-06 04:59:37,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:37,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:37,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 49 transitions, 462 flow [2022-12-06 04:59:37,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 49 transitions, 462 flow [2022-12-06 04:59:37,921 INFO L130 PetriNetUnfolder]: 69/232 cut-off events. [2022-12-06 04:59:37,921 INFO L131 PetriNetUnfolder]: For 651/665 co-relation queries the response was YES. [2022-12-06 04:59:37,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 232 events. 69/232 cut-off events. For 651/665 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1254 event pairs, 7 based on Foata normal form. 6/223 useless extension candidates. Maximal degree in co-relation 761. Up to 58 conditions per place. [2022-12-06 04:59:37,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 49 transitions, 462 flow [2022-12-06 04:59:37,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 04:59:37,927 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L47-5-->L59-5: Formula: (let ((.cse0 (select |v_#memory_int_155| v_~A~0.base_67))) (and (= (select .cse0 (+ v_~A~0.offset_67 (* v_~i_AB~0_79 4))) |v_thread1Thread1of1ForFork1_#t~mem1_55|) (< v_~i_AB~0_79 v_~An~0_68) (< v_~i_AB~0_79 v_~Bn~0_84) (= (+ 1 v_~i_BA~0_80) v_~i_BA~0_79) (let ((.cse1 (* 4 v_~i_BA~0_80))) (= (select .cse0 (+ .cse1 v_~A~0.offset_67)) (select (select |v_#memory_int_155| v_~B~0.base_67) (+ .cse1 v_~B~0.offset_67)))) (< v_~i_BA~0_80 v_~An~0_68) (< v_~i_BA~0_80 v_~Bn~0_84))) InVars {~A~0.base=v_~A~0.base_67, ~A~0.offset=v_~A~0.offset_67, ~B~0.base=v_~B~0.base_67, #memory_int=|v_#memory_int_155|, ~i_AB~0=v_~i_AB~0_79, ~i_BA~0=v_~i_BA~0_80, ~B~0.offset=v_~B~0.offset_67, ~Bn~0=v_~Bn~0_84, ~An~0=v_~An~0_68} OutVars{~A~0.base=v_~A~0.base_67, ~B~0.base=v_~B~0.base_67, ~i_AB~0=v_~i_AB~0_79, ~An~0=v_~An~0_68, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_19|, ~A~0.offset=v_~A~0.offset_67, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_55|, #memory_int=|v_#memory_int_155|, ~i_BA~0=v_~i_BA~0_79, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_39|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_41|, ~B~0.offset=v_~B~0.offset_67, ~Bn~0=v_~Bn~0_84} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 04:59:38,752 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:59:38,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 852 [2022-12-06 04:59:38,753 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 471 flow [2022-12-06 04:59:38,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:38,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:38,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:38,766 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-12-06 04:59:38,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 04:59:38,960 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:38,960 INFO L85 PathProgramCache]: Analyzing trace with hash -786218530, now seen corresponding path program 1 times [2022-12-06 04:59:38,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:38,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268370528] [2022-12-06 04:59:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:39,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:39,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268370528] [2022-12-06 04:59:39,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268370528] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:39,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227397940] [2022-12-06 04:59:39,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:39,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:39,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:39,061 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-12-06 04:59:39,064 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-12-06 04:59:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:39,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 04:59:39,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:39,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 04:59:39,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227397940] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:39,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 04:59:39,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 3] total 5 [2022-12-06 04:59:39,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167649589] [2022-12-06 04:59:39,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:39,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:39,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:39,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:39,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:59:39,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:59:39,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 471 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:39,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:39,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:59:39,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:39,369 INFO L130 PetriNetUnfolder]: 490/858 cut-off events. [2022-12-06 04:59:39,369 INFO L131 PetriNetUnfolder]: For 4269/4269 co-relation queries the response was YES. [2022-12-06 04:59:39,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 858 events. 490/858 cut-off events. For 4269/4269 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3989 event pairs, 217 based on Foata normal form. 2/859 useless extension candidates. Maximal degree in co-relation 3901. Up to 632 conditions per place. [2022-12-06 04:59:39,377 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 57 selfloop transitions, 15 changer transitions 2/74 dead transitions. [2022-12-06 04:59:39,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 779 flow [2022-12-06 04:59:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 04:59:39,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2022-12-06 04:59:39,378 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 471 flow. Second operand 4 states and 50 transitions. [2022-12-06 04:59:39,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 779 flow [2022-12-06 04:59:39,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 765 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:39,388 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 589 flow [2022-12-06 04:59:39,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=589, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2022-12-06 04:59:39,389 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-06 04:59:39,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:39,389 INFO L89 Accepts]: Start accepts. Operand has 56 places, 55 transitions, 589 flow [2022-12-06 04:59:39,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:39,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:39,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 55 transitions, 589 flow [2022-12-06 04:59:39,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 589 flow [2022-12-06 04:59:39,435 INFO L130 PetriNetUnfolder]: 82/281 cut-off events. [2022-12-06 04:59:39,435 INFO L131 PetriNetUnfolder]: For 937/952 co-relation queries the response was YES. [2022-12-06 04:59:39,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 281 events. 82/281 cut-off events. For 937/952 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1673 event pairs, 13 based on Foata normal form. 2/265 useless extension candidates. Maximal degree in co-relation 1012. Up to 74 conditions per place. [2022-12-06 04:59:39,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 55 transitions, 589 flow [2022-12-06 04:59:39,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 04:59:39,454 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L47-5-->L59-5: Formula: (let ((.cse0 (select |v_#memory_int_155| v_~A~0.base_67))) (and (= (select .cse0 (+ v_~A~0.offset_67 (* v_~i_AB~0_79 4))) |v_thread1Thread1of1ForFork1_#t~mem1_55|) (< v_~i_AB~0_79 v_~An~0_68) (< v_~i_AB~0_79 v_~Bn~0_84) (= (+ 1 v_~i_BA~0_80) v_~i_BA~0_79) (let ((.cse1 (* 4 v_~i_BA~0_80))) (= (select .cse0 (+ .cse1 v_~A~0.offset_67)) (select (select |v_#memory_int_155| v_~B~0.base_67) (+ .cse1 v_~B~0.offset_67)))) (< v_~i_BA~0_80 v_~An~0_68) (< v_~i_BA~0_80 v_~Bn~0_84))) InVars {~A~0.base=v_~A~0.base_67, ~A~0.offset=v_~A~0.offset_67, ~B~0.base=v_~B~0.base_67, #memory_int=|v_#memory_int_155|, ~i_AB~0=v_~i_AB~0_79, ~i_BA~0=v_~i_BA~0_80, ~B~0.offset=v_~B~0.offset_67, ~Bn~0=v_~Bn~0_84, ~An~0=v_~An~0_68} OutVars{~A~0.base=v_~A~0.base_67, ~B~0.base=v_~B~0.base_67, ~i_AB~0=v_~i_AB~0_79, ~An~0=v_~An~0_68, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_19|, ~A~0.offset=v_~A~0.offset_67, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_55|, #memory_int=|v_#memory_int_155|, ~i_BA~0=v_~i_BA~0_79, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_39|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_41|, ~B~0.offset=v_~B~0.offset_67, ~Bn~0=v_~Bn~0_84} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 04:59:39,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:39,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 04:59:39,498 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 599 flow [2022-12-06 04:59:39,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:39,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:39,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:39,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 04:59:39,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 04:59:39,699 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:39,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1607932652, now seen corresponding path program 1 times [2022-12-06 04:59:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:39,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496426692] [2022-12-06 04:59:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:39,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:39,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496426692] [2022-12-06 04:59:39,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496426692] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:39,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002977902] [2022-12-06 04:59:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:39,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:39,928 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-12-06 04:59:39,963 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-12-06 04:59:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:40,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 04:59:40,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:40,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 04:59:40,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:40,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:40,030 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 04:59:40,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-06 04:59:40,067 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 04:59:40,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 04:59:40,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 04:59:40,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 04:59:40,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 04:59:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:40,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:40,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002977902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:40,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:40,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 04:59:40,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270716403] [2022-12-06 04:59:40,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:40,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 04:59:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:40,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 04:59:40,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=210, Unknown=1, NotChecked=0, Total=272 [2022-12-06 04:59:40,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:59:40,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 599 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:40,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:40,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:59:40,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:40,506 WARN L837 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (forall ((v_ArrVal_448 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448))) (let ((.cse2 (select .cse4 c_~B~0.base)) (.cse0 (select .cse4 c_~A~0.base))) (or (let ((.cse1 (* c_~i_AB~0 4))) (= (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ c_~B~0.offset .cse1)))) (not (let ((.cse3 (* c_~i_BA~0 4))) (= (select .cse2 (+ .cse3 c_~B~0.offset)) (select .cse0 (+ c_~A~0.offset .cse3))))))))) (= c_~B~0.offset 0) (= c_~A~0.offset 0) (not (= c_~B~0.base c_~A~0.base)) (= c_~i_AB~0 0)) is different from false [2022-12-06 04:59:40,946 INFO L130 PetriNetUnfolder]: 588/1044 cut-off events. [2022-12-06 04:59:40,946 INFO L131 PetriNetUnfolder]: For 5870/5870 co-relation queries the response was YES. [2022-12-06 04:59:40,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5350 conditions, 1044 events. 588/1044 cut-off events. For 5870/5870 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5296 event pairs, 226 based on Foata normal form. 20/1064 useless extension candidates. Maximal degree in co-relation 5058. Up to 740 conditions per place. [2022-12-06 04:59:40,952 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 88 selfloop transitions, 38 changer transitions 3/129 dead transitions. [2022-12-06 04:59:40,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 129 transitions, 1463 flow [2022-12-06 04:59:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 04:59:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 04:59:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 99 transitions. [2022-12-06 04:59:40,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27197802197802196 [2022-12-06 04:59:40,954 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 599 flow. Second operand 14 states and 99 transitions. [2022-12-06 04:59:40,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 129 transitions, 1463 flow [2022-12-06 04:59:40,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 129 transitions, 1393 flow, removed 35 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:40,961 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 962 flow [2022-12-06 04:59:40,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=962, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2022-12-06 04:59:40,961 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 54 predicate places. [2022-12-06 04:59:40,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:40,962 INFO L89 Accepts]: Start accepts. Operand has 75 places, 79 transitions, 962 flow [2022-12-06 04:59:40,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:40,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:40,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 79 transitions, 962 flow [2022-12-06 04:59:40,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 962 flow [2022-12-06 04:59:41,003 INFO L130 PetriNetUnfolder]: 243/610 cut-off events. [2022-12-06 04:59:41,004 INFO L131 PetriNetUnfolder]: For 4216/4256 co-relation queries the response was YES. [2022-12-06 04:59:41,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3030 conditions, 610 events. 243/610 cut-off events. For 4216/4256 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3994 event pairs, 106 based on Foata normal form. 8/563 useless extension candidates. Maximal degree in co-relation 2850. Up to 244 conditions per place. [2022-12-06 04:59:41,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 79 transitions, 962 flow [2022-12-06 04:59:41,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 04:59:45,656 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L80-4-->L81-1: Formula: (= (select (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t1~0#1.base_17|) |v_ULTIMATE.start_main_~#t1~0#1.offset_17|) |v_ULTIMATE.start_main_#t~mem15#1_14|) InVars {#memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_17|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_17|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_23|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_14|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_17|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_17|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet14#1] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 04:59:45,708 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:59:45,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4750 [2022-12-06 04:59:45,712 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 995 flow [2022-12-06 04:59:45,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:45,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:45,713 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:45,718 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-12-06 04:59:45,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 04:59:45,919 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash 578419231, now seen corresponding path program 1 times [2022-12-06 04:59:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:45,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034412655] [2022-12-06 04:59:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:46,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034412655] [2022-12-06 04:59:46,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034412655] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:46,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095678013] [2022-12-06 04:59:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:46,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:46,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:46,132 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-12-06 04:59:46,134 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-12-06 04:59:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:46,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 04:59:46,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:46,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:46,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:46,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:46,242 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 04:59:46,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-06 04:59:46,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:46,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 04:59:46,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 04:59:46,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 04:59:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:46,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:46,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095678013] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:46,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 04:59:46,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 12 [2022-12-06 04:59:46,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975748706] [2022-12-06 04:59:46,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:46,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:46,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:46,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:46,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2022-12-06 04:59:46,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 04:59:46,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 995 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:46,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:46,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 04:59:46,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:46,565 INFO L130 PetriNetUnfolder]: 615/1101 cut-off events. [2022-12-06 04:59:46,565 INFO L131 PetriNetUnfolder]: For 9729/9729 co-relation queries the response was YES. [2022-12-06 04:59:46,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6819 conditions, 1101 events. 615/1101 cut-off events. For 9729/9729 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5667 event pairs, 307 based on Foata normal form. 4/1104 useless extension candidates. Maximal degree in co-relation 6477. Up to 1065 conditions per place. [2022-12-06 04:59:46,573 INFO L137 encePairwiseOnDemand]: 12/31 looper letters, 84 selfloop transitions, 24 changer transitions 1/109 dead transitions. [2022-12-06 04:59:46,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 109 transitions, 1564 flow [2022-12-06 04:59:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:59:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:59:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-06 04:59:46,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2534562211981567 [2022-12-06 04:59:46,574 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 995 flow. Second operand 7 states and 55 transitions. [2022-12-06 04:59:46,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 109 transitions, 1564 flow [2022-12-06 04:59:46,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 109 transitions, 1462 flow, removed 50 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:46,607 INFO L231 Difference]: Finished difference. Result has 85 places, 99 transitions, 1296 flow [2022-12-06 04:59:46,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1296, PETRI_PLACES=85, PETRI_TRANSITIONS=99} [2022-12-06 04:59:46,608 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 64 predicate places. [2022-12-06 04:59:46,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:46,608 INFO L89 Accepts]: Start accepts. Operand has 85 places, 99 transitions, 1296 flow [2022-12-06 04:59:46,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:46,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:46,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 99 transitions, 1296 flow [2022-12-06 04:59:46,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 99 transitions, 1296 flow [2022-12-06 04:59:46,668 INFO L130 PetriNetUnfolder]: 259/654 cut-off events. [2022-12-06 04:59:46,668 INFO L131 PetriNetUnfolder]: For 5276/5306 co-relation queries the response was YES. [2022-12-06 04:59:46,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3431 conditions, 654 events. 259/654 cut-off events. For 5276/5306 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4324 event pairs, 112 based on Foata normal form. 5/608 useless extension candidates. Maximal degree in co-relation 3367. Up to 264 conditions per place. [2022-12-06 04:59:46,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 99 transitions, 1296 flow [2022-12-06 04:59:46,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 04:59:50,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:50,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4225 [2022-12-06 04:59:50,833 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 99 transitions, 1324 flow [2022-12-06 04:59:50,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:50,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:50,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:50,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 04:59:51,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:51,034 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1253002304, now seen corresponding path program 1 times [2022-12-06 04:59:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:51,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551089965] [2022-12-06 04:59:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:51,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:51,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551089965] [2022-12-06 04:59:51,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551089965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:51,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591638668] [2022-12-06 04:59:51,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:51,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:51,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:51,204 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-12-06 04:59:51,207 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-12-06 04:59:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:51,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 04:59:51,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:51,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:51,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:51,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 04:59:51,297 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 04:59:51,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-06 04:59:51,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 04:59:51,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 04:59:51,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 04:59:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:51,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:51,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591638668] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:51,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 04:59:51,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 12 [2022-12-06 04:59:51,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900691112] [2022-12-06 04:59:51,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:51,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:51,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:51,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=113, Unknown=2, NotChecked=0, Total=156 [2022-12-06 04:59:51,451 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 04:59:51,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 99 transitions, 1324 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:51,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:51,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 04:59:51,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:51,703 INFO L130 PetriNetUnfolder]: 638/1144 cut-off events. [2022-12-06 04:59:51,703 INFO L131 PetriNetUnfolder]: For 10899/10899 co-relation queries the response was YES. [2022-12-06 04:59:51,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7249 conditions, 1144 events. 638/1144 cut-off events. For 10899/10899 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5942 event pairs, 291 based on Foata normal form. 4/1148 useless extension candidates. Maximal degree in co-relation 6894. Up to 1093 conditions per place. [2022-12-06 04:59:51,712 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 88 selfloop transitions, 36 changer transitions 1/125 dead transitions. [2022-12-06 04:59:51,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 125 transitions, 1872 flow [2022-12-06 04:59:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:59:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:59:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-06 04:59:51,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-06 04:59:51,713 INFO L175 Difference]: Start difference. First operand has 84 places, 99 transitions, 1324 flow. Second operand 7 states and 55 transitions. [2022-12-06 04:59:51,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 125 transitions, 1872 flow [2022-12-06 04:59:51,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 125 transitions, 1822 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:51,731 INFO L231 Difference]: Finished difference. Result has 94 places, 115 transitions, 1652 flow [2022-12-06 04:59:51,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1652, PETRI_PLACES=94, PETRI_TRANSITIONS=115} [2022-12-06 04:59:51,732 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-06 04:59:51,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:51,732 INFO L89 Accepts]: Start accepts. Operand has 94 places, 115 transitions, 1652 flow [2022-12-06 04:59:51,732 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:51,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:51,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 115 transitions, 1652 flow [2022-12-06 04:59:51,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 115 transitions, 1652 flow [2022-12-06 04:59:51,801 INFO L130 PetriNetUnfolder]: 279/696 cut-off events. [2022-12-06 04:59:51,801 INFO L131 PetriNetUnfolder]: For 6813/6848 co-relation queries the response was YES. [2022-12-06 04:59:51,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3900 conditions, 696 events. 279/696 cut-off events. For 6813/6848 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4673 event pairs, 115 based on Foata normal form. 9/652 useless extension candidates. Maximal degree in co-relation 3698. Up to 283 conditions per place. [2022-12-06 04:59:51,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 115 transitions, 1652 flow [2022-12-06 04:59:51,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 04:59:57,541 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:57,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5809 [2022-12-06 04:59:57,541 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 115 transitions, 1680 flow [2022-12-06 04:59:57,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:57,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:57,542 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:57,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 04:59:57,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:57,742 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash -216807225, now seen corresponding path program 1 times [2022-12-06 04:59:57,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:57,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132493387] [2022-12-06 04:59:57,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:57,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:59:57,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:57,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132493387] [2022-12-06 04:59:57,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132493387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:57,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386046827] [2022-12-06 04:59:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:57,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:57,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:57,796 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-12-06 04:59:57,798 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-12-06 04:59:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:57,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 04:59:57,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:59:57,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 04:59:57,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386046827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:57,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 04:59:57,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 04:59:57,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956544283] [2022-12-06 04:59:57,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:57,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:57,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:57,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:57,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:57,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 04:59:57,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 115 transitions, 1680 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:57,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:57,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 04:59:57,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:58,180 INFO L130 PetriNetUnfolder]: 999/1821 cut-off events. [2022-12-06 04:59:58,180 INFO L131 PetriNetUnfolder]: For 19836/19836 co-relation queries the response was YES. [2022-12-06 04:59:58,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11721 conditions, 1821 events. 999/1821 cut-off events. For 19836/19836 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 10784 event pairs, 424 based on Foata normal form. 52/1873 useless extension candidates. Maximal degree in co-relation 11333. Up to 1087 conditions per place. [2022-12-06 04:59:58,201 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 145 selfloop transitions, 16 changer transitions 3/164 dead transitions. [2022-12-06 04:59:58,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 164 transitions, 2538 flow [2022-12-06 04:59:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 04:59:58,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2022-12-06 04:59:58,202 INFO L175 Difference]: Start difference. First operand has 93 places, 115 transitions, 1680 flow. Second operand 4 states and 66 transitions. [2022-12-06 04:59:58,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 164 transitions, 2538 flow [2022-12-06 04:59:58,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 164 transitions, 2450 flow, removed 44 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:58,231 INFO L231 Difference]: Finished difference. Result has 97 places, 125 transitions, 1869 flow [2022-12-06 04:59:58,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1869, PETRI_PLACES=97, PETRI_TRANSITIONS=125} [2022-12-06 04:59:58,232 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 76 predicate places. [2022-12-06 04:59:58,232 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:58,232 INFO L89 Accepts]: Start accepts. Operand has 97 places, 125 transitions, 1869 flow [2022-12-06 04:59:58,232 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:58,232 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:58,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 125 transitions, 1869 flow [2022-12-06 04:59:58,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 125 transitions, 1869 flow [2022-12-06 04:59:58,321 INFO L130 PetriNetUnfolder]: 422/1086 cut-off events. [2022-12-06 04:59:58,321 INFO L131 PetriNetUnfolder]: For 10377/10423 co-relation queries the response was YES. [2022-12-06 04:59:58,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5888 conditions, 1086 events. 422/1086 cut-off events. For 10377/10423 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 8301 event pairs, 184 based on Foata normal form. 9/1011 useless extension candidates. Maximal degree in co-relation 5833. Up to 429 conditions per place. [2022-12-06 04:59:58,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 125 transitions, 1869 flow [2022-12-06 04:59:58,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 04:59:58,333 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:58,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 04:59:58,333 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 125 transitions, 1869 flow [2022-12-06 04:59:58,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:58,334 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:58,334 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:58,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 04:59:58,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:58,538 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash 372793283, now seen corresponding path program 1 times [2022-12-06 04:59:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:58,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720584589] [2022-12-06 04:59:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:58,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:58,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720584589] [2022-12-06 04:59:58,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720584589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:58,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752825971] [2022-12-06 04:59:58,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:58,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:58,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:58,828 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-12-06 04:59:58,830 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-12-06 04:59:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:58,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 04:59:58,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:58,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:59,015 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 04:59:59,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-06 04:59:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:59,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752825971] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:59,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:59,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 04:59:59,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364111043] [2022-12-06 04:59:59,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:59,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:59:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:59,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:59:59,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:59:59,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 04:59:59,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 125 transitions, 1869 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:59,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:59,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 04:59:59,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:59,425 INFO L130 PetriNetUnfolder]: 1021/1854 cut-off events. [2022-12-06 04:59:59,426 INFO L131 PetriNetUnfolder]: For 20723/20723 co-relation queries the response was YES. [2022-12-06 04:59:59,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12131 conditions, 1854 events. 1021/1854 cut-off events. For 20723/20723 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 10959 event pairs, 419 based on Foata normal form. 8/1862 useless extension candidates. Maximal degree in co-relation 11833. Up to 1329 conditions per place. [2022-12-06 04:59:59,438 INFO L137 encePairwiseOnDemand]: 13/34 looper letters, 91 selfloop transitions, 85 changer transitions 1/177 dead transitions. [2022-12-06 04:59:59,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 177 transitions, 2781 flow [2022-12-06 04:59:59,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 04:59:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 04:59:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-12-06 04:59:59,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-06 04:59:59,439 INFO L175 Difference]: Start difference. First operand has 96 places, 125 transitions, 1869 flow. Second operand 9 states and 85 transitions. [2022-12-06 04:59:59,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 177 transitions, 2781 flow [2022-12-06 04:59:59,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 177 transitions, 2767 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:59,469 INFO L231 Difference]: Finished difference. Result has 108 places, 143 transitions, 2425 flow [2022-12-06 04:59:59,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2425, PETRI_PLACES=108, PETRI_TRANSITIONS=143} [2022-12-06 04:59:59,469 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 87 predicate places. [2022-12-06 04:59:59,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:59,469 INFO L89 Accepts]: Start accepts. Operand has 108 places, 143 transitions, 2425 flow [2022-12-06 04:59:59,470 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:59,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:59,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 143 transitions, 2425 flow [2022-12-06 04:59:59,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 143 transitions, 2425 flow [2022-12-06 04:59:59,571 INFO L130 PetriNetUnfolder]: 441/1123 cut-off events. [2022-12-06 04:59:59,572 INFO L131 PetriNetUnfolder]: For 15190/15246 co-relation queries the response was YES. [2022-12-06 04:59:59,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6881 conditions, 1123 events. 441/1123 cut-off events. For 15190/15246 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 8602 event pairs, 189 based on Foata normal form. 16/1056 useless extension candidates. Maximal degree in co-relation 6650. Up to 455 conditions per place. [2022-12-06 04:59:59,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 143 transitions, 2425 flow [2022-12-06 04:59:59,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 420 [2022-12-06 05:00:05,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:00:05,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6415 [2022-12-06 05:00:05,884 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 143 transitions, 2453 flow [2022-12-06 05:00:05,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:05,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:05,885 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:05,892 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-12-06 05:00:06,088 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,SelfDestructingSolverStorable20 [2022-12-06 05:00:06,088 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:06,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2097675134, now seen corresponding path program 1 times [2022-12-06 05:00:06,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:06,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839892881] [2022-12-06 05:00:06,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:06,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:00:06,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:06,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839892881] [2022-12-06 05:00:06,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839892881] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:06,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803022976] [2022-12-06 05:00:06,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:06,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:06,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:06,169 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-12-06 05:00:06,170 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-12-06 05:00:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:06,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:00:06,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:00:06,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:00:06,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803022976] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:06,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:06,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 05:00:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432194570] [2022-12-06 05:00:06,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:06,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:00:06,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:06,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:00:06,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:00:06,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:00:06,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 143 transitions, 2453 flow. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:06,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:06,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:00:06,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:06,840 INFO L130 PetriNetUnfolder]: 1532/2945 cut-off events. [2022-12-06 05:00:06,841 INFO L131 PetriNetUnfolder]: For 40199/40199 co-relation queries the response was YES. [2022-12-06 05:00:06,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20583 conditions, 2945 events. 1532/2945 cut-off events. For 40199/40199 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 20346 event pairs, 566 based on Foata normal form. 70/3015 useless extension candidates. Maximal degree in co-relation 20236. Up to 1201 conditions per place. [2022-12-06 05:00:06,860 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 177 selfloop transitions, 102 changer transitions 1/280 dead transitions. [2022-12-06 05:00:06,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 280 transitions, 4902 flow [2022-12-06 05:00:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:00:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:00:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-12-06 05:00:06,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44015444015444016 [2022-12-06 05:00:06,861 INFO L175 Difference]: Start difference. First operand has 108 places, 143 transitions, 2453 flow. Second operand 7 states and 114 transitions. [2022-12-06 05:00:06,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 280 transitions, 4902 flow [2022-12-06 05:00:06,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 280 transitions, 4720 flow, removed 39 selfloop flow, removed 3 redundant places. [2022-12-06 05:00:06,923 INFO L231 Difference]: Finished difference. Result has 115 places, 187 transitions, 3487 flow [2022-12-06 05:00:06,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2345, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3487, PETRI_PLACES=115, PETRI_TRANSITIONS=187} [2022-12-06 05:00:06,923 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 05:00:06,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:06,923 INFO L89 Accepts]: Start accepts. Operand has 115 places, 187 transitions, 3487 flow [2022-12-06 05:00:06,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:06,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:06,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 187 transitions, 3487 flow [2022-12-06 05:00:06,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 187 transitions, 3487 flow [2022-12-06 05:00:07,054 INFO L130 PetriNetUnfolder]: 613/1673 cut-off events. [2022-12-06 05:00:07,055 INFO L131 PetriNetUnfolder]: For 24700/24910 co-relation queries the response was YES. [2022-12-06 05:00:07,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10433 conditions, 1673 events. 613/1673 cut-off events. For 24700/24910 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 14459 event pairs, 314 based on Foata normal form. 44/1562 useless extension candidates. Maximal degree in co-relation 10381. Up to 697 conditions per place. [2022-12-06 05:00:07,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 187 transitions, 3487 flow [2022-12-06 05:00:07,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-06 05:00:07,071 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:00:07,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-06 05:00:07,071 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 187 transitions, 3487 flow [2022-12-06 05:00:07,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:07,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:07,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:07,078 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-12-06 05:00:07,276 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,SelfDestructingSolverStorable21 [2022-12-06 05:00:07,276 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:07,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1939721008, now seen corresponding path program 1 times [2022-12-06 05:00:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:07,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522535045] [2022-12-06 05:00:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522535045] [2022-12-06 05:00:07,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522535045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126579405] [2022-12-06 05:00:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:07,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:07,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:07,377 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-12-06 05:00:07,378 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-12-06 05:00:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:07,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:00:07,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:07,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:00:07,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126579405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:00:07,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:00:07,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 05:00:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658478912] [2022-12-06 05:00:07,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:00:07,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:00:07,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:07,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:00:07,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:00:07,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:00:07,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 187 transitions, 3487 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:07,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:07,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:00:07,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:07,878 INFO L130 PetriNetUnfolder]: 1410/2730 cut-off events. [2022-12-06 05:00:07,879 INFO L131 PetriNetUnfolder]: For 40743/40743 co-relation queries the response was YES. [2022-12-06 05:00:07,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19659 conditions, 2730 events. 1410/2730 cut-off events. For 40743/40743 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 18516 event pairs, 834 based on Foata normal form. 38/2768 useless extension candidates. Maximal degree in co-relation 19605. Up to 2349 conditions per place. [2022-12-06 05:00:07,898 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 127 selfloop transitions, 0 changer transitions 79/206 dead transitions. [2022-12-06 05:00:07,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 206 transitions, 4057 flow [2022-12-06 05:00:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:00:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:00:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 05:00:07,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2022-12-06 05:00:07,899 INFO L175 Difference]: Start difference. First operand has 114 places, 187 transitions, 3487 flow. Second operand 4 states and 59 transitions. [2022-12-06 05:00:07,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 206 transitions, 4057 flow [2022-12-06 05:00:07,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 206 transitions, 3998 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 05:00:07,975 INFO L231 Difference]: Finished difference. Result has 115 places, 127 transitions, 2063 flow [2022-12-06 05:00:07,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3386, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2063, PETRI_PLACES=115, PETRI_TRANSITIONS=127} [2022-12-06 05:00:07,975 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 05:00:07,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:07,976 INFO L89 Accepts]: Start accepts. Operand has 115 places, 127 transitions, 2063 flow [2022-12-06 05:00:07,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:07,976 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:07,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 127 transitions, 2063 flow [2022-12-06 05:00:07,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 127 transitions, 2063 flow [2022-12-06 05:00:08,065 INFO L130 PetriNetUnfolder]: 467/1268 cut-off events. [2022-12-06 05:00:08,065 INFO L131 PetriNetUnfolder]: For 11834/11977 co-relation queries the response was YES. [2022-12-06 05:00:08,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 1268 events. 467/1268 cut-off events. For 11834/11977 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 10430 event pairs, 254 based on Foata normal form. 27/1168 useless extension candidates. Maximal degree in co-relation 6642. Up to 517 conditions per place. [2022-12-06 05:00:08,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 127 transitions, 2063 flow [2022-12-06 05:00:08,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 05:00:11,150 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:00:11,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3175 [2022-12-06 05:00:11,151 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 127 transitions, 2101 flow [2022-12-06 05:00:11,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:11,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:11,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:11,157 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-12-06 05:00:11,352 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,SelfDestructingSolverStorable22 [2022-12-06 05:00:11,352 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:11,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1236647413, now seen corresponding path program 1 times [2022-12-06 05:00:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:11,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058053685] [2022-12-06 05:00:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:11,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:11,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058053685] [2022-12-06 05:00:11,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058053685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:11,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267774457] [2022-12-06 05:00:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:11,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:11,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:11,721 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-12-06 05:00:11,722 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-12-06 05:00:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:11,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:00:11,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:11,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:12,096 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:00:12,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:00:12,129 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-06 05:00:12,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-06 05:00:12,144 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:00:12,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:00:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:12,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267774457] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:12,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:12,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2022-12-06 05:00:12,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827192184] [2022-12-06 05:00:12,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:12,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:00:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:00:12,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:00:12,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:00:12,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 127 transitions, 2101 flow. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:12,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:12,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:00:12,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:13,105 INFO L130 PetriNetUnfolder]: 1297/2432 cut-off events. [2022-12-06 05:00:13,106 INFO L131 PetriNetUnfolder]: For 28053/28053 co-relation queries the response was YES. [2022-12-06 05:00:13,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16386 conditions, 2432 events. 1297/2432 cut-off events. For 28053/28053 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15660 event pairs, 713 based on Foata normal form. 4/2435 useless extension candidates. Maximal degree in co-relation 15842. Up to 2306 conditions per place. [2022-12-06 05:00:13,161 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 148 selfloop transitions, 39 changer transitions 7/194 dead transitions. [2022-12-06 05:00:13,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 194 transitions, 3151 flow [2022-12-06 05:00:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:00:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:00:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2022-12-06 05:00:13,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2549019607843137 [2022-12-06 05:00:13,163 INFO L175 Difference]: Start difference. First operand has 100 places, 127 transitions, 2101 flow. Second operand 12 states and 104 transitions. [2022-12-06 05:00:13,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 194 transitions, 3151 flow [2022-12-06 05:00:13,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 194 transitions, 3000 flow, removed 55 selfloop flow, removed 9 redundant places. [2022-12-06 05:00:13,199 INFO L231 Difference]: Finished difference. Result has 108 places, 156 transitions, 2520 flow [2022-12-06 05:00:13,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2520, PETRI_PLACES=108, PETRI_TRANSITIONS=156} [2022-12-06 05:00:13,200 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 87 predicate places. [2022-12-06 05:00:13,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:13,200 INFO L89 Accepts]: Start accepts. Operand has 108 places, 156 transitions, 2520 flow [2022-12-06 05:00:13,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:13,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:13,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 156 transitions, 2520 flow [2022-12-06 05:00:13,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 156 transitions, 2520 flow [2022-12-06 05:00:13,304 INFO L130 PetriNetUnfolder]: 514/1362 cut-off events. [2022-12-06 05:00:13,304 INFO L131 PetriNetUnfolder]: For 13621/13759 co-relation queries the response was YES. [2022-12-06 05:00:13,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7799 conditions, 1362 events. 514/1362 cut-off events. For 13621/13759 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 11158 event pairs, 240 based on Foata normal form. 27/1275 useless extension candidates. Maximal degree in co-relation 7734. Up to 536 conditions per place. [2022-12-06 05:00:13,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 156 transitions, 2520 flow [2022-12-06 05:00:13,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-06 05:00:16,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:00:16,602 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:00:16,623 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:00:16,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3424 [2022-12-06 05:00:16,624 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 156 transitions, 2582 flow [2022-12-06 05:00:16,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:16,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:16,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:16,630 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-12-06 05:00:16,829 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,SelfDestructingSolverStorable23 [2022-12-06 05:00:16,829 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:16,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1555159559, now seen corresponding path program 1 times [2022-12-06 05:00:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:16,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487337669] [2022-12-06 05:00:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:16,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:00:16,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:16,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487337669] [2022-12-06 05:00:16,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487337669] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:16,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855381728] [2022-12-06 05:00:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:16,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:16,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:16,865 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-12-06 05:00:16,868 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-12-06 05:00:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:16,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:00:16,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:00:16,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:00:16,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855381728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:00:16,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:00:16,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 05:00:16,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457154679] [2022-12-06 05:00:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:00:16,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:00:16,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:16,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:00:16,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:00:16,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:00:16,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 156 transitions, 2582 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:16,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:16,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:00:16,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:17,262 INFO L130 PetriNetUnfolder]: 1136/2117 cut-off events. [2022-12-06 05:00:17,262 INFO L131 PetriNetUnfolder]: For 27109/27109 co-relation queries the response was YES. [2022-12-06 05:00:17,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14978 conditions, 2117 events. 1136/2117 cut-off events. For 27109/27109 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12999 event pairs, 617 based on Foata normal form. 19/2136 useless extension candidates. Maximal degree in co-relation 14901. Up to 1982 conditions per place. [2022-12-06 05:00:17,276 INFO L137 encePairwiseOnDemand]: 30/37 looper letters, 144 selfloop transitions, 0 changer transitions 30/174 dead transitions. [2022-12-06 05:00:17,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 174 transitions, 3068 flow [2022-12-06 05:00:17,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:00:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:00:17,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 05:00:17,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41216216216216217 [2022-12-06 05:00:17,289 INFO L175 Difference]: Start difference. First operand has 105 places, 156 transitions, 2582 flow. Second operand 4 states and 61 transitions. [2022-12-06 05:00:17,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 174 transitions, 3068 flow [2022-12-06 05:00:17,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 174 transitions, 2892 flow, removed 88 selfloop flow, removed 3 redundant places. [2022-12-06 05:00:17,339 INFO L231 Difference]: Finished difference. Result has 107 places, 144 transitions, 2158 flow [2022-12-06 05:00:17,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2372, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2158, PETRI_PLACES=107, PETRI_TRANSITIONS=144} [2022-12-06 05:00:17,340 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 86 predicate places. [2022-12-06 05:00:17,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:17,340 INFO L89 Accepts]: Start accepts. Operand has 107 places, 144 transitions, 2158 flow [2022-12-06 05:00:17,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:17,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:17,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 144 transitions, 2158 flow [2022-12-06 05:00:17,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 144 transitions, 2158 flow [2022-12-06 05:00:17,466 INFO L130 PetriNetUnfolder]: 444/1140 cut-off events. [2022-12-06 05:00:17,466 INFO L131 PetriNetUnfolder]: For 11620/11731 co-relation queries the response was YES. [2022-12-06 05:00:17,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6554 conditions, 1140 events. 444/1140 cut-off events. For 11620/11731 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8813 event pairs, 178 based on Foata normal form. 21/1049 useless extension candidates. Maximal degree in co-relation 6488. Up to 452 conditions per place. [2022-12-06 05:00:17,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 144 transitions, 2158 flow [2022-12-06 05:00:17,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-06 05:00:17,477 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:00:17,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 05:00:17,478 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 144 transitions, 2158 flow [2022-12-06 05:00:17,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:17,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:17,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:17,484 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-12-06 05:00:17,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:17,684 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1591906623, now seen corresponding path program 1 times [2022-12-06 05:00:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:17,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022403236] [2022-12-06 05:00:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:17,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:17,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022403236] [2022-12-06 05:00:17,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022403236] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:17,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005897188] [2022-12-06 05:00:17,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:17,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:17,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:17,996 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-12-06 05:00:17,997 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-12-06 05:00:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:18,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 05:00:18,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:18,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:18,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:00:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:18,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:18,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:18,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2022-12-06 05:00:18,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-12-06 05:00:18,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:18,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2022-12-06 05:00:18,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-12-06 05:00:18,450 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-06 05:00:18,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 169 [2022-12-06 05:00:18,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:18,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 99 [2022-12-06 05:00:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:18,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005897188] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:18,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:18,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 05:00:18,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012042118] [2022-12-06 05:00:18,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:18,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:00:18,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:18,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:00:18,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:00:18,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:00:18,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 144 transitions, 2158 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:18,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:18,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:00:18,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:19,580 INFO L130 PetriNetUnfolder]: 1248/2282 cut-off events. [2022-12-06 05:00:19,580 INFO L131 PetriNetUnfolder]: For 27677/27677 co-relation queries the response was YES. [2022-12-06 05:00:19,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15835 conditions, 2282 events. 1248/2282 cut-off events. For 27677/27677 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 14164 event pairs, 442 based on Foata normal form. 24/2305 useless extension candidates. Maximal degree in co-relation 15691. Up to 1909 conditions per place. [2022-12-06 05:00:19,594 INFO L137 encePairwiseOnDemand]: 17/34 looper letters, 187 selfloop transitions, 76 changer transitions 0/263 dead transitions. [2022-12-06 05:00:19,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 263 transitions, 3715 flow [2022-12-06 05:00:19,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:00:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:00:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 159 transitions. [2022-12-06 05:00:19,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25980392156862747 [2022-12-06 05:00:19,595 INFO L175 Difference]: Start difference. First operand has 101 places, 144 transitions, 2158 flow. Second operand 18 states and 159 transitions. [2022-12-06 05:00:19,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 263 transitions, 3715 flow [2022-12-06 05:00:19,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 263 transitions, 3647 flow, removed 34 selfloop flow, removed 5 redundant places. [2022-12-06 05:00:19,642 INFO L231 Difference]: Finished difference. Result has 116 places, 183 transitions, 2806 flow [2022-12-06 05:00:19,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2806, PETRI_PLACES=116, PETRI_TRANSITIONS=183} [2022-12-06 05:00:19,642 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 95 predicate places. [2022-12-06 05:00:19,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:19,642 INFO L89 Accepts]: Start accepts. Operand has 116 places, 183 transitions, 2806 flow [2022-12-06 05:00:19,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:19,643 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:19,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 183 transitions, 2806 flow [2022-12-06 05:00:19,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 183 transitions, 2806 flow [2022-12-06 05:00:19,732 INFO L130 PetriNetUnfolder]: 510/1299 cut-off events. [2022-12-06 05:00:19,732 INFO L131 PetriNetUnfolder]: For 15580/15714 co-relation queries the response was YES. [2022-12-06 05:00:19,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7782 conditions, 1299 events. 510/1299 cut-off events. For 15580/15714 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 10295 event pairs, 191 based on Foata normal form. 29/1210 useless extension candidates. Maximal degree in co-relation 7471. Up to 488 conditions per place. [2022-12-06 05:00:19,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 183 transitions, 2806 flow [2022-12-06 05:00:19,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-06 05:00:19,743 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:00:19,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 05:00:19,744 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 183 transitions, 2806 flow [2022-12-06 05:00:19,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:19,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:19,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:19,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 05:00:19,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 05:00:19,946 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1162258835, now seen corresponding path program 2 times [2022-12-06 05:00:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752849254] [2022-12-06 05:00:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:19,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:20,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752849254] [2022-12-06 05:00:20,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752849254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709146512] [2022-12-06 05:00:20,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:00:20,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:20,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:20,314 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-12-06 05:00:20,317 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-12-06 05:00:20,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:00:20,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:00:20,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 05:00:20,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:20,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:20,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:00:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:20,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:20,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:20,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2022-12-06 05:00:20,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-12-06 05:00:20,766 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-06 05:00:20,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 169 [2022-12-06 05:00:20,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:20,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 99 [2022-12-06 05:00:21,217 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:00:21,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 24 [2022-12-06 05:00:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:21,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709146512] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:21,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:21,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 05:00:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200903298] [2022-12-06 05:00:21,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:21,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:00:21,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:21,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:00:21,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:00:21,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:00:21,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 183 transitions, 2806 flow. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:21,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:21,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:00:21,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:22,028 INFO L130 PetriNetUnfolder]: 1277/2325 cut-off events. [2022-12-06 05:00:22,028 INFO L131 PetriNetUnfolder]: For 33225/33225 co-relation queries the response was YES. [2022-12-06 05:00:22,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16702 conditions, 2325 events. 1277/2325 cut-off events. For 33225/33225 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14438 event pairs, 504 based on Foata normal form. 6/2330 useless extension candidates. Maximal degree in co-relation 16153. Up to 2133 conditions per place. [2022-12-06 05:00:22,055 INFO L137 encePairwiseOnDemand]: 17/34 looper letters, 137 selfloop transitions, 84 changer transitions 6/227 dead transitions. [2022-12-06 05:00:22,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 227 transitions, 3543 flow [2022-12-06 05:00:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:00:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:00:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-12-06 05:00:22,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21638655462184875 [2022-12-06 05:00:22,057 INFO L175 Difference]: Start difference. First operand has 116 places, 183 transitions, 2806 flow. Second operand 14 states and 103 transitions. [2022-12-06 05:00:22,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 227 transitions, 3543 flow [2022-12-06 05:00:22,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 227 transitions, 3425 flow, removed 47 selfloop flow, removed 2 redundant places. [2022-12-06 05:00:22,125 INFO L231 Difference]: Finished difference. Result has 130 places, 194 transitions, 3008 flow [2022-12-06 05:00:22,125 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2688, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3008, PETRI_PLACES=130, PETRI_TRANSITIONS=194} [2022-12-06 05:00:22,150 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 109 predicate places. [2022-12-06 05:00:22,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:22,150 INFO L89 Accepts]: Start accepts. Operand has 130 places, 194 transitions, 3008 flow [2022-12-06 05:00:22,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:22,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:22,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 194 transitions, 3008 flow [2022-12-06 05:00:22,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 194 transitions, 3008 flow [2022-12-06 05:00:22,242 INFO L130 PetriNetUnfolder]: 501/1273 cut-off events. [2022-12-06 05:00:22,242 INFO L131 PetriNetUnfolder]: For 17809/17927 co-relation queries the response was YES. [2022-12-06 05:00:22,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8143 conditions, 1273 events. 501/1273 cut-off events. For 17809/17927 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 9916 event pairs, 191 based on Foata normal form. 28/1206 useless extension candidates. Maximal degree in co-relation 8075. Up to 469 conditions per place. [2022-12-06 05:00:22,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 194 transitions, 3008 flow [2022-12-06 05:00:22,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 05:00:22,328 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:00:22,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:00:22,332 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 194 transitions, 3018 flow [2022-12-06 05:00:22,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:22,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:22,336 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:22,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 05:00:22,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 05:00:22,543 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash 121676107, now seen corresponding path program 1 times [2022-12-06 05:00:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:22,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845676540] [2022-12-06 05:00:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:22,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:22,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845676540] [2022-12-06 05:00:22,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845676540] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:22,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136310305] [2022-12-06 05:00:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:22,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:22,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:22,773 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-12-06 05:00:22,779 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-12-06 05:00:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:22,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:00:22,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:22,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:22,915 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-06 05:00:22,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-06 05:00:22,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:22,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:00:22,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:22,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:00:22,943 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:22,944 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2022-12-06 05:00:22,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:22,960 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-06 05:00:22,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 33 [2022-12-06 05:00:22,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:22,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:00:23,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:00:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:23,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:23,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136310305] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:23,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:23,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 05:00:23,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30664336] [2022-12-06 05:00:23,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:23,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:00:23,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:23,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:00:23,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=161, Unknown=2, NotChecked=0, Total=210 [2022-12-06 05:00:23,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:00:23,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 194 transitions, 3018 flow. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:23,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:23,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:00:23,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:23,789 INFO L130 PetriNetUnfolder]: 1368/2524 cut-off events. [2022-12-06 05:00:23,790 INFO L131 PetriNetUnfolder]: For 41785/41785 co-relation queries the response was YES. [2022-12-06 05:00:23,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18807 conditions, 2524 events. 1368/2524 cut-off events. For 41785/41785 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 16179 event pairs, 469 based on Foata normal form. 12/2535 useless extension candidates. Maximal degree in co-relation 18726. Up to 2272 conditions per place. [2022-12-06 05:00:23,805 INFO L137 encePairwiseOnDemand]: 16/36 looper letters, 179 selfloop transitions, 67 changer transitions 31/277 dead transitions. [2022-12-06 05:00:23,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 277 transitions, 4377 flow [2022-12-06 05:00:23,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:00:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:00:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 120 transitions. [2022-12-06 05:00:23,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2564102564102564 [2022-12-06 05:00:23,806 INFO L175 Difference]: Start difference. First operand has 128 places, 194 transitions, 3018 flow. Second operand 13 states and 120 transitions. [2022-12-06 05:00:23,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 277 transitions, 4377 flow [2022-12-06 05:00:23,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 277 transitions, 4205 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-06 05:00:23,915 INFO L231 Difference]: Finished difference. Result has 141 places, 224 transitions, 3558 flow [2022-12-06 05:00:23,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2878, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3558, PETRI_PLACES=141, PETRI_TRANSITIONS=224} [2022-12-06 05:00:23,919 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 120 predicate places. [2022-12-06 05:00:23,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:23,920 INFO L89 Accepts]: Start accepts. Operand has 141 places, 224 transitions, 3558 flow [2022-12-06 05:00:23,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:23,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:23,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 224 transitions, 3558 flow [2022-12-06 05:00:23,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 224 transitions, 3558 flow [2022-12-06 05:00:24,037 INFO L130 PetriNetUnfolder]: 544/1372 cut-off events. [2022-12-06 05:00:24,037 INFO L131 PetriNetUnfolder]: For 19408/19533 co-relation queries the response was YES. [2022-12-06 05:00:24,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9019 conditions, 1372 events. 544/1372 cut-off events. For 19408/19533 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 10899 event pairs, 196 based on Foata normal form. 28/1283 useless extension candidates. Maximal degree in co-relation 8901. Up to 517 conditions per place. [2022-12-06 05:00:24,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 224 transitions, 3558 flow [2022-12-06 05:00:24,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 05:00:30,806 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [566] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_17| 0) (not (= (select (select |v_#memory_int_117| v_~B~0.base_51) (+ (* v_~i_AB~0_57 4) v_~B~0.offset_51)) |v_thread1Thread1of1ForFork1_#t~mem1_32|)) (= |v_thread1Thread1of1ForFork1_#res.base_17| 0)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_32|, ~B~0.base=v_~B~0.base_51, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, ~B~0.offset=v_~B~0.offset_51} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_17|, ~B~0.base=v_~B~0.base_51, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_33|, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_17|, ~B~0.offset=v_~B~0.offset_51} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#res.offset] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:00:30,834 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:00:30,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6915 [2022-12-06 05:00:30,835 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 223 transitions, 3584 flow [2022-12-06 05:00:30,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:30,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:30,835 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:30,841 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-12-06 05:00:31,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 05:00:31,036 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash 342142492, now seen corresponding path program 1 times [2022-12-06 05:00:31,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:31,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10530090] [2022-12-06 05:00:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:31,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:31,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10530090] [2022-12-06 05:00:31,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10530090] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:31,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473850195] [2022-12-06 05:00:31,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:31,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:31,430 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-12-06 05:00:31,441 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-12-06 05:00:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:31,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 05:00:31,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:31,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:31,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:00:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:31,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:31,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:31,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 186 [2022-12-06 05:00:31,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:31,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 93 [2022-12-06 05:00:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:32,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473850195] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:32,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:32,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 05:00:32,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235418508] [2022-12-06 05:00:32,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:32,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:00:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:32,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:00:32,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-12-06 05:00:32,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:00:32,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 223 transitions, 3584 flow. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:32,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:32,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:00:32,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:33,116 INFO L130 PetriNetUnfolder]: 1762/3307 cut-off events. [2022-12-06 05:00:33,116 INFO L131 PetriNetUnfolder]: For 55063/55063 co-relation queries the response was YES. [2022-12-06 05:00:33,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24854 conditions, 3307 events. 1762/3307 cut-off events. For 55063/55063 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 22572 event pairs, 477 based on Foata normal form. 23/3328 useless extension candidates. Maximal degree in co-relation 24657. Up to 2152 conditions per place. [2022-12-06 05:00:33,137 INFO L137 encePairwiseOnDemand]: 15/40 looper letters, 179 selfloop transitions, 137 changer transitions 36/352 dead transitions. [2022-12-06 05:00:33,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 352 transitions, 5796 flow [2022-12-06 05:00:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:00:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:00:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2022-12-06 05:00:33,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-06 05:00:33,139 INFO L175 Difference]: Start difference. First operand has 137 places, 223 transitions, 3584 flow. Second operand 12 states and 135 transitions. [2022-12-06 05:00:33,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 352 transitions, 5796 flow [2022-12-06 05:00:33,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 352 transitions, 5720 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-12-06 05:00:33,263 INFO L231 Difference]: Finished difference. Result has 153 places, 266 transitions, 4855 flow [2022-12-06 05:00:33,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3528, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4855, PETRI_PLACES=153, PETRI_TRANSITIONS=266} [2022-12-06 05:00:33,263 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 132 predicate places. [2022-12-06 05:00:33,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:33,264 INFO L89 Accepts]: Start accepts. Operand has 153 places, 266 transitions, 4855 flow [2022-12-06 05:00:33,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:33,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:33,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 266 transitions, 4855 flow [2022-12-06 05:00:33,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 266 transitions, 4855 flow [2022-12-06 05:00:33,412 INFO L130 PetriNetUnfolder]: 661/1744 cut-off events. [2022-12-06 05:00:33,412 INFO L131 PetriNetUnfolder]: For 31237/31440 co-relation queries the response was YES. [2022-12-06 05:00:33,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12347 conditions, 1744 events. 661/1744 cut-off events. For 31237/31440 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 14862 event pairs, 289 based on Foata normal form. 31/1643 useless extension candidates. Maximal degree in co-relation 12287. Up to 674 conditions per place. [2022-12-06 05:00:33,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 266 transitions, 4855 flow [2022-12-06 05:00:33,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 844 [2022-12-06 05:00:33,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:00:33,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 05:00:33,473 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 266 transitions, 4857 flow [2022-12-06 05:00:33,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:33,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:33,473 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:33,478 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-12-06 05:00:33,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 05:00:33,678 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:33,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:33,678 INFO L85 PathProgramCache]: Analyzing trace with hash 859889929, now seen corresponding path program 1 times [2022-12-06 05:00:33,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:33,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367689129] [2022-12-06 05:00:33,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:33,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:00:33,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367689129] [2022-12-06 05:00:33,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367689129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385454607] [2022-12-06 05:00:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:33,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:33,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:33,741 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-12-06 05:00:33,759 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-12-06 05:00:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:33,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:00:33,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:00:33,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:00:33,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385454607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:00:33,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:00:33,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 05:00:33,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464070316] [2022-12-06 05:00:33,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:00:33,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:00:33,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:33,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:00:33,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:00:33,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:00:33,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 266 transitions, 4857 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:33,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:33,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:00:33,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:34,356 INFO L130 PetriNetUnfolder]: 1616/3016 cut-off events. [2022-12-06 05:00:34,356 INFO L131 PetriNetUnfolder]: For 59816/59816 co-relation queries the response was YES. [2022-12-06 05:00:34,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24507 conditions, 3016 events. 1616/3016 cut-off events. For 59816/59816 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20011 event pairs, 854 based on Foata normal form. 22/3037 useless extension candidates. Maximal degree in co-relation 24445. Up to 2858 conditions per place. [2022-12-06 05:00:34,384 INFO L137 encePairwiseOnDemand]: 32/39 looper letters, 249 selfloop transitions, 0 changer transitions 35/284 dead transitions. [2022-12-06 05:00:34,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 284 transitions, 5576 flow [2022-12-06 05:00:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:00:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:00:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 05:00:34,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2022-12-06 05:00:34,386 INFO L175 Difference]: Start difference. First operand has 149 places, 266 transitions, 4857 flow. Second operand 4 states and 62 transitions. [2022-12-06 05:00:34,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 284 transitions, 5576 flow [2022-12-06 05:00:34,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 284 transitions, 5462 flow, removed 45 selfloop flow, removed 5 redundant places. [2022-12-06 05:00:34,522 INFO L231 Difference]: Finished difference. Result has 149 places, 249 transitions, 4370 flow [2022-12-06 05:00:34,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4608, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4370, PETRI_PLACES=149, PETRI_TRANSITIONS=249} [2022-12-06 05:00:34,522 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 128 predicate places. [2022-12-06 05:00:34,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:34,522 INFO L89 Accepts]: Start accepts. Operand has 149 places, 249 transitions, 4370 flow [2022-12-06 05:00:34,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:34,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:34,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 249 transitions, 4370 flow [2022-12-06 05:00:34,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 249 transitions, 4370 flow [2022-12-06 05:00:34,654 INFO L130 PetriNetUnfolder]: 613/1600 cut-off events. [2022-12-06 05:00:34,654 INFO L131 PetriNetUnfolder]: For 28103/28240 co-relation queries the response was YES. [2022-12-06 05:00:34,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11217 conditions, 1600 events. 613/1600 cut-off events. For 28103/28240 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 13310 event pairs, 258 based on Foata normal form. 24/1495 useless extension candidates. Maximal degree in co-relation 10851. Up to 615 conditions per place. [2022-12-06 05:00:34,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 249 transitions, 4370 flow [2022-12-06 05:00:34,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-06 05:00:34,672 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:00:34,673 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 05:00:34,673 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 249 transitions, 4370 flow [2022-12-06 05:00:34,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:34,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:34,673 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:34,680 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-12-06 05:00:34,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:34,878 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash 310533709, now seen corresponding path program 1 times [2022-12-06 05:00:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:34,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563824194] [2022-12-06 05:00:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:35,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:35,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563824194] [2022-12-06 05:00:35,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563824194] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:35,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260422800] [2022-12-06 05:00:35,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:35,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:35,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:35,199 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-12-06 05:00:35,201 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-12-06 05:00:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:35,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:00:35,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:35,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:35,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:35,341 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-06 05:00:35,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 104 [2022-12-06 05:00:35,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:35,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:00:35,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:35,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:00:35,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:35,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 28 [2022-12-06 05:00:35,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:35,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:00:35,400 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:35,400 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2022-12-06 05:00:35,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:35,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:35,575 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-06 05:00:35,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 160 treesize of output 150 [2022-12-06 05:00:35,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:35,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-12-06 05:00:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:35,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:35,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260422800] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:35,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:35,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:00:35,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34103753] [2022-12-06 05:00:35,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:35,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:00:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:35,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:00:35,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:00:35,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:00:35,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 249 transitions, 4370 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:35,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:35,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:00:35,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:36,554 INFO L130 PetriNetUnfolder]: 1599/2945 cut-off events. [2022-12-06 05:00:36,554 INFO L131 PetriNetUnfolder]: For 57213/57213 co-relation queries the response was YES. [2022-12-06 05:00:36,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23866 conditions, 2945 events. 1599/2945 cut-off events. For 57213/57213 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 19261 event pairs, 796 based on Foata normal form. 4/2948 useless extension candidates. Maximal degree in co-relation 23299. Up to 2793 conditions per place. [2022-12-06 05:00:36,575 INFO L137 encePairwiseOnDemand]: 18/38 looper letters, 237 selfloop transitions, 45 changer transitions 12/294 dead transitions. [2022-12-06 05:00:36,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 294 transitions, 5468 flow [2022-12-06 05:00:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:00:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:00:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2022-12-06 05:00:36,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21052631578947367 [2022-12-06 05:00:36,576 INFO L175 Difference]: Start difference. First operand has 146 places, 249 transitions, 4370 flow. Second operand 11 states and 88 transitions. [2022-12-06 05:00:36,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 294 transitions, 5468 flow [2022-12-06 05:00:36,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 294 transitions, 5396 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-12-06 05:00:36,706 INFO L231 Difference]: Finished difference. Result has 157 places, 264 transitions, 4722 flow [2022-12-06 05:00:36,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=4314, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4722, PETRI_PLACES=157, PETRI_TRANSITIONS=264} [2022-12-06 05:00:36,706 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 136 predicate places. [2022-12-06 05:00:36,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:36,707 INFO L89 Accepts]: Start accepts. Operand has 157 places, 264 transitions, 4722 flow [2022-12-06 05:00:36,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:36,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:36,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 264 transitions, 4722 flow [2022-12-06 05:00:36,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 264 transitions, 4722 flow [2022-12-06 05:00:36,852 INFO L130 PetriNetUnfolder]: 626/1612 cut-off events. [2022-12-06 05:00:36,852 INFO L131 PetriNetUnfolder]: For 27075/27222 co-relation queries the response was YES. [2022-12-06 05:00:36,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11318 conditions, 1612 events. 626/1612 cut-off events. For 27075/27222 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 13379 event pairs, 275 based on Foata normal form. 27/1520 useless extension candidates. Maximal degree in co-relation 11180. Up to 627 conditions per place. [2022-12-06 05:00:36,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 264 transitions, 4722 flow [2022-12-06 05:00:36,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 818 [2022-12-06 05:00:44,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [586] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_163| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)) (select (select |v_#memory_int_163| v_~B~0.base_71) (+ .cse0 v_~B~0.offset_71)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_71, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_163|, ~B~0.offset=v_~B~0.offset_71, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_71, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_63|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_49|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_163|, ~B~0.offset=v_~B~0.offset_71, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:00:44,421 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:00:44,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7715 [2022-12-06 05:00:44,422 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 263 transitions, 4812 flow [2022-12-06 05:00:44,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:44,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:44,422 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:44,432 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-12-06 05:00:44,622 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,SelfDestructingSolverStorable30 [2022-12-06 05:00:44,622 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1696295570, now seen corresponding path program 1 times [2022-12-06 05:00:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:44,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327561431] [2022-12-06 05:00:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:00:44,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:44,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327561431] [2022-12-06 05:00:44,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327561431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:44,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845329089] [2022-12-06 05:00:44,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:44,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:44,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:44,680 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-12-06 05:00:44,696 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-12-06 05:00:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:44,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:00:44,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:00:44,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:00:44,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845329089] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:44,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:44,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 05:00:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536200117] [2022-12-06 05:00:44,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:44,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:00:44,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:44,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:00:44,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:00:44,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:00:44,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 263 transitions, 4812 flow. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:44,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:44,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:00:44,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:45,540 INFO L130 PetriNetUnfolder]: 1928/3521 cut-off events. [2022-12-06 05:00:45,541 INFO L131 PetriNetUnfolder]: For 68847/68847 co-relation queries the response was YES. [2022-12-06 05:00:45,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28980 conditions, 3521 events. 1928/3521 cut-off events. For 68847/68847 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 23694 event pairs, 605 based on Foata normal form. 50/3569 useless extension candidates. Maximal degree in co-relation 28807. Up to 1597 conditions per place. [2022-12-06 05:00:45,564 INFO L137 encePairwiseOnDemand]: 22/44 looper letters, 259 selfloop transitions, 146 changer transitions 2/407 dead transitions. [2022-12-06 05:00:45,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 407 transitions, 7785 flow [2022-12-06 05:00:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:00:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:00:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2022-12-06 05:00:45,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2022-12-06 05:00:45,565 INFO L175 Difference]: Start difference. First operand has 154 places, 263 transitions, 4812 flow. Second operand 8 states and 129 transitions. [2022-12-06 05:00:45,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 407 transitions, 7785 flow [2022-12-06 05:00:45,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 407 transitions, 7680 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-12-06 05:00:45,703 INFO L231 Difference]: Finished difference. Result has 162 places, 309 transitions, 6117 flow [2022-12-06 05:00:45,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4695, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6117, PETRI_PLACES=162, PETRI_TRANSITIONS=309} [2022-12-06 05:00:45,704 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 141 predicate places. [2022-12-06 05:00:45,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:45,704 INFO L89 Accepts]: Start accepts. Operand has 162 places, 309 transitions, 6117 flow [2022-12-06 05:00:45,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:45,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:45,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 309 transitions, 6117 flow [2022-12-06 05:00:45,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 309 transitions, 6117 flow [2022-12-06 05:00:45,885 INFO L130 PetriNetUnfolder]: 799/2005 cut-off events. [2022-12-06 05:00:45,885 INFO L131 PetriNetUnfolder]: For 37105/37353 co-relation queries the response was YES. [2022-12-06 05:00:45,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14897 conditions, 2005 events. 799/2005 cut-off events. For 37105/37353 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 17110 event pairs, 367 based on Foata normal form. 49/1883 useless extension candidates. Maximal degree in co-relation 14833. Up to 802 conditions per place. [2022-12-06 05:00:45,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 309 transitions, 6117 flow [2022-12-06 05:00:45,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 928 [2022-12-06 05:00:45,908 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:00:45,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 05:00:45,909 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 309 transitions, 6117 flow [2022-12-06 05:00:45,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:45,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:45,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:45,917 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-12-06 05:00:46,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:46,112 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash 731702830, now seen corresponding path program 1 times [2022-12-06 05:00:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:46,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661391691] [2022-12-06 05:00:46,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:46,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:46,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:46,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661391691] [2022-12-06 05:00:46,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661391691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:46,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830323885] [2022-12-06 05:00:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:46,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:46,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:46,373 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-12-06 05:00:46,412 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-12-06 05:00:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:46,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 05:00:46,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:46,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:46,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:46,541 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-06 05:00:46,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 104 [2022-12-06 05:00:46,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:46,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:00:46,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:46,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:00:46,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:46,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:46,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 33 [2022-12-06 05:00:46,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:46,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:00:46,585 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:46,586 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2022-12-06 05:00:46,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:46,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:46,709 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 05:00:46,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2022-12-06 05:00:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:46,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:46,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830323885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:46,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:46,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 05:00:46,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331663644] [2022-12-06 05:00:46,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:46,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:00:46,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:46,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:00:46,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=113, Unknown=3, NotChecked=0, Total=156 [2022-12-06 05:00:46,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:00:46,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 309 transitions, 6117 flow. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:46,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:46,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:00:46,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:47,606 INFO L130 PetriNetUnfolder]: 1964/3584 cut-off events. [2022-12-06 05:00:47,606 INFO L131 PetriNetUnfolder]: For 74515/74515 co-relation queries the response was YES. [2022-12-06 05:00:47,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30345 conditions, 3584 events. 1964/3584 cut-off events. For 74515/74515 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 23992 event pairs, 1001 based on Foata normal form. 12/3595 useless extension candidates. Maximal degree in co-relation 30279. Up to 3415 conditions per place. [2022-12-06 05:00:47,630 INFO L137 encePairwiseOnDemand]: 26/43 looper letters, 309 selfloop transitions, 32 changer transitions 0/341 dead transitions. [2022-12-06 05:00:47,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 341 transitions, 7121 flow [2022-12-06 05:00:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:00:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:00:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-06 05:00:47,631 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32170542635658916 [2022-12-06 05:00:47,631 INFO L175 Difference]: Start difference. First operand has 161 places, 309 transitions, 6117 flow. Second operand 6 states and 83 transitions. [2022-12-06 05:00:47,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 341 transitions, 7121 flow [2022-12-06 05:00:47,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 341 transitions, 7113 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:00:47,822 INFO L231 Difference]: Finished difference. Result has 168 places, 313 transitions, 6262 flow [2022-12-06 05:00:47,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6109, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6262, PETRI_PLACES=168, PETRI_TRANSITIONS=313} [2022-12-06 05:00:47,822 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 147 predicate places. [2022-12-06 05:00:47,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:47,822 INFO L89 Accepts]: Start accepts. Operand has 168 places, 313 transitions, 6262 flow [2022-12-06 05:00:47,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:47,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:47,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 313 transitions, 6262 flow [2022-12-06 05:00:47,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 313 transitions, 6262 flow [2022-12-06 05:00:48,025 INFO L130 PetriNetUnfolder]: 817/2045 cut-off events. [2022-12-06 05:00:48,025 INFO L131 PetriNetUnfolder]: For 40721/40943 co-relation queries the response was YES. [2022-12-06 05:00:48,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15621 conditions, 2045 events. 817/2045 cut-off events. For 40721/40943 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 17470 event pairs, 370 based on Foata normal form. 51/1929 useless extension candidates. Maximal degree in co-relation 15265. Up to 809 conditions per place. [2022-12-06 05:00:48,062 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 313 transitions, 6262 flow [2022-12-06 05:00:48,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 948 [2022-12-06 05:00:48,065 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:00:48,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 05:00:48,066 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 313 transitions, 6262 flow [2022-12-06 05:00:48,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:48,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:48,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:48,072 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-12-06 05:00:48,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:48,271 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:48,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:48,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1853187307, now seen corresponding path program 1 times [2022-12-06 05:00:48,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:48,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598890819] [2022-12-06 05:00:48,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:48,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:48,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598890819] [2022-12-06 05:00:48,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598890819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:48,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674068188] [2022-12-06 05:00:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:48,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:48,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:48,389 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-12-06 05:00:48,390 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-12-06 05:00:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:48,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:00:48,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:48,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:00:48,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674068188] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:48,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:48,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2022-12-06 05:00:48,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570256996] [2022-12-06 05:00:48,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:48,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:00:48,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:48,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:00:48,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:00:48,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:00:48,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 313 transitions, 6262 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:48,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:48,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:00:48,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:49,496 INFO L130 PetriNetUnfolder]: 2424/4440 cut-off events. [2022-12-06 05:00:49,496 INFO L131 PetriNetUnfolder]: For 94070/94070 co-relation queries the response was YES. [2022-12-06 05:00:49,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37813 conditions, 4440 events. 2424/4440 cut-off events. For 94070/94070 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 31152 event pairs, 398 based on Foata normal form. 4/4443 useless extension candidates. Maximal degree in co-relation 37218. Up to 2106 conditions per place. [2022-12-06 05:00:49,526 INFO L137 encePairwiseOnDemand]: 20/43 looper letters, 215 selfloop transitions, 182 changer transitions 2/399 dead transitions. [2022-12-06 05:00:49,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 399 transitions, 8124 flow [2022-12-06 05:00:49,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:00:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:00:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2022-12-06 05:00:49,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28604651162790695 [2022-12-06 05:00:49,528 INFO L175 Difference]: Start difference. First operand has 168 places, 313 transitions, 6262 flow. Second operand 10 states and 123 transitions. [2022-12-06 05:00:49,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 399 transitions, 8124 flow [2022-12-06 05:00:49,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 399 transitions, 8062 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-06 05:00:49,721 INFO L231 Difference]: Finished difference. Result has 179 places, 337 transitions, 7143 flow [2022-12-06 05:00:49,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6224, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7143, PETRI_PLACES=179, PETRI_TRANSITIONS=337} [2022-12-06 05:00:49,722 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 158 predicate places. [2022-12-06 05:00:49,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:49,722 INFO L89 Accepts]: Start accepts. Operand has 179 places, 337 transitions, 7143 flow [2022-12-06 05:00:49,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:49,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:49,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 337 transitions, 7143 flow [2022-12-06 05:00:49,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 337 transitions, 7143 flow [2022-12-06 05:00:49,972 INFO L130 PetriNetUnfolder]: 961/2484 cut-off events. [2022-12-06 05:00:49,973 INFO L131 PetriNetUnfolder]: For 51867/52139 co-relation queries the response was YES. [2022-12-06 05:00:49,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19355 conditions, 2484 events. 961/2484 cut-off events. For 51867/52139 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 22444 event pairs, 437 based on Foata normal form. 69/2363 useless extension candidates. Maximal degree in co-relation 18974. Up to 937 conditions per place. [2022-12-06 05:00:50,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 337 transitions, 7143 flow [2022-12-06 05:00:50,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 1164 [2022-12-06 05:00:50,005 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:00:50,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-06 05:00:50,006 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 337 transitions, 7143 flow [2022-12-06 05:00:50,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:50,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:50,006 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:50,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-06 05:00:50,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:50,208 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:50,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1070626275, now seen corresponding path program 1 times [2022-12-06 05:00:50,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:50,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605327421] [2022-12-06 05:00:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:50,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:50,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605327421] [2022-12-06 05:00:50,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605327421] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:50,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83345019] [2022-12-06 05:00:50,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:50,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:50,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:50,682 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-12-06 05:00:50,710 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-12-06 05:00:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:50,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 05:00:50,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:50,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:50,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:00:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:50,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:51,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:51,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 181 [2022-12-06 05:00:51,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:51,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 90 [2022-12-06 05:00:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:51,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83345019] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:51,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:51,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-12-06 05:00:51,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126850361] [2022-12-06 05:00:51,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:51,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:00:51,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:00:51,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:00:51,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:00:51,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 337 transitions, 7143 flow. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:51,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:51,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:00:51,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:52,497 INFO L130 PetriNetUnfolder]: 2452/4515 cut-off events. [2022-12-06 05:00:52,497 INFO L131 PetriNetUnfolder]: For 110414/110414 co-relation queries the response was YES. [2022-12-06 05:00:52,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39828 conditions, 4515 events. 2452/4515 cut-off events. For 110414/110414 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 31934 event pairs, 1157 based on Foata normal form. 28/4542 useless extension candidates. Maximal degree in co-relation 39196. Up to 4041 conditions per place. [2022-12-06 05:00:52,534 INFO L137 encePairwiseOnDemand]: 18/43 looper letters, 280 selfloop transitions, 107 changer transitions 3/390 dead transitions. [2022-12-06 05:00:52,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 390 transitions, 8602 flow [2022-12-06 05:00:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:00:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:00:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-12-06 05:00:52,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21141649048625794 [2022-12-06 05:00:52,535 INFO L175 Difference]: Start difference. First operand has 179 places, 337 transitions, 7143 flow. Second operand 11 states and 100 transitions. [2022-12-06 05:00:52,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 390 transitions, 8602 flow [2022-12-06 05:00:52,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 390 transitions, 8246 flow, removed 84 selfloop flow, removed 4 redundant places. [2022-12-06 05:00:52,773 INFO L231 Difference]: Finished difference. Result has 191 places, 355 transitions, 7537 flow [2022-12-06 05:00:52,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6790, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7537, PETRI_PLACES=191, PETRI_TRANSITIONS=355} [2022-12-06 05:00:52,773 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 170 predicate places. [2022-12-06 05:00:52,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:52,773 INFO L89 Accepts]: Start accepts. Operand has 191 places, 355 transitions, 7537 flow [2022-12-06 05:00:52,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:52,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:52,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 355 transitions, 7537 flow [2022-12-06 05:00:52,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 355 transitions, 7537 flow [2022-12-06 05:00:53,063 INFO L130 PetriNetUnfolder]: 975/2527 cut-off events. [2022-12-06 05:00:53,064 INFO L131 PetriNetUnfolder]: For 57776/58033 co-relation queries the response was YES. [2022-12-06 05:00:53,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20197 conditions, 2527 events. 975/2527 cut-off events. For 57776/58033 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 22952 event pairs, 435 based on Foata normal form. 67/2394 useless extension candidates. Maximal degree in co-relation 19790. Up to 969 conditions per place. [2022-12-06 05:00:53,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 355 transitions, 7537 flow [2022-12-06 05:00:53,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 1200 [2022-12-06 05:00:53,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] L47-5-->L80-3: Formula: (let ((.cse0 (select |v_#memory_int_397| v_~A~0.base_180))) (and (< v_~i_AB~0_207 v_~An~0_148) (= (store |v_#memory_int_397| |v_ULTIMATE.start_main_~#t2~0#1.base_109| (store (select |v_#memory_int_397| |v_ULTIMATE.start_main_~#t2~0#1.base_109|) |v_ULTIMATE.start_main_~#t2~0#1.offset_109| |v_ULTIMATE.start_main_#t~pre13#1_143|)) |v_#memory_int_396|) (= |v_ULTIMATE.start_main_#t~pre13#1_143| |v_#pthreadsForks_162|) (= (+ v_~i_AB~0_208 1) v_~i_AB~0_207) (= (+ |v_#pthreadsForks_162| 1) |v_#pthreadsForks_161|) (< v_~i_AB~0_207 v_~Bn~0_168) (= |v_thread1Thread1of1ForFork1_#t~mem1_162| (select .cse0 (+ (* v_~i_AB~0_207 4) v_~A~0.offset_180))) (let ((.cse1 (* v_~i_AB~0_208 4))) (= (select .cse0 (+ .cse1 v_~A~0.offset_180)) (select (select |v_#memory_int_397| v_~B~0.base_170) (+ .cse1 v_~B~0.offset_170)))))) InVars {~A~0.base=v_~A~0.base_180, ~A~0.offset=v_~A~0.offset_180, ~B~0.base=v_~B~0.base_170, #pthreadsForks=|v_#pthreadsForks_162|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_109|, ~i_AB~0=v_~i_AB~0_208, #memory_int=|v_#memory_int_397|, ~Bn~0=v_~Bn~0_168, ~B~0.offset=v_~B~0.offset_170, ~An~0=v_~An~0_148, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_109|} OutVars{~A~0.base=v_~A~0.base_180, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_143|, ~B~0.base=v_~B~0.base_170, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_157|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_109|, ~i_AB~0=v_~i_AB~0_207, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_76|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_114|, ~An~0=v_~An~0_148, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_162|, ~A~0.offset=v_~A~0.offset_180, #pthreadsForks=|v_#pthreadsForks_161|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_113|, #memory_int=|v_#memory_int_396|, ~Bn~0=v_~Bn~0_168, ~B~0.offset=v_~B~0.offset_170, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_109|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork1_#t~mem1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:00:53,221 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:00:53,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [566] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_17| 0) (not (= (select (select |v_#memory_int_117| v_~B~0.base_51) (+ (* v_~i_AB~0_57 4) v_~B~0.offset_51)) |v_thread1Thread1of1ForFork1_#t~mem1_32|)) (= |v_thread1Thread1of1ForFork1_#res.base_17| 0)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_32|, ~B~0.base=v_~B~0.base_51, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, ~B~0.offset=v_~B~0.offset_51} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_17|, ~B~0.base=v_~B~0.base_51, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_33|, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_17|, ~B~0.offset=v_~B~0.offset_51} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:00:53,286 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:00:53,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 514 [2022-12-06 05:00:53,287 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 354 transitions, 7576 flow [2022-12-06 05:00:53,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:53,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:53,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:53,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 05:00:53,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:53,488 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1444516513, now seen corresponding path program 1 times [2022-12-06 05:00:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:53,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745609532] [2022-12-06 05:00:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:53,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:53,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745609532] [2022-12-06 05:00:53,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745609532] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:53,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780024709] [2022-12-06 05:00:53,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:53,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:53,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:53,765 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-12-06 05:00:53,779 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-12-06 05:00:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:53,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 05:00:53,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:53,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:53,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:53,942 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-06 05:00:53,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 104 [2022-12-06 05:00:53,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:53,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:00:53,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:53,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:00:53,971 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:00:53,971 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2022-12-06 05:00:53,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:53,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:53,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 33 [2022-12-06 05:00:53,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:53,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:00:54,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:54,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:00:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:54,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:54,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780024709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:54,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:54,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:00:54,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528988841] [2022-12-06 05:00:54,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:54,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:00:54,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:54,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:00:54,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-12-06 05:00:54,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:00:54,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 354 transitions, 7576 flow. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:54,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:54,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:00:54,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:56,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:00:57,586 INFO L130 PetriNetUnfolder]: 2582/4731 cut-off events. [2022-12-06 05:00:57,586 INFO L131 PetriNetUnfolder]: For 116812/116812 co-relation queries the response was YES. [2022-12-06 05:00:57,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42006 conditions, 4731 events. 2582/4731 cut-off events. For 116812/116812 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 33712 event pairs, 969 based on Foata normal form. 24/4754 useless extension candidates. Maximal degree in co-relation 41365. Up to 4444 conditions per place. [2022-12-06 05:00:57,681 INFO L137 encePairwiseOnDemand]: 18/47 looper letters, 346 selfloop transitions, 84 changer transitions 4/434 dead transitions. [2022-12-06 05:00:57,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 434 transitions, 9370 flow [2022-12-06 05:00:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:00:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:00:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 128 transitions. [2022-12-06 05:00:57,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20949263502454993 [2022-12-06 05:00:57,682 INFO L175 Difference]: Start difference. First operand has 190 places, 354 transitions, 7576 flow. Second operand 13 states and 128 transitions. [2022-12-06 05:00:57,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 434 transitions, 9370 flow [2022-12-06 05:00:57,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 434 transitions, 9256 flow, removed 38 selfloop flow, removed 2 redundant places. [2022-12-06 05:00:57,945 INFO L231 Difference]: Finished difference. Result has 207 places, 387 transitions, 8318 flow [2022-12-06 05:00:57,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7462, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8318, PETRI_PLACES=207, PETRI_TRANSITIONS=387} [2022-12-06 05:00:57,946 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 186 predicate places. [2022-12-06 05:00:57,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:00:57,946 INFO L89 Accepts]: Start accepts. Operand has 207 places, 387 transitions, 8318 flow [2022-12-06 05:00:57,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:00:57,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:00:57,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 387 transitions, 8318 flow [2022-12-06 05:00:57,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 387 transitions, 8318 flow [2022-12-06 05:00:58,246 INFO L130 PetriNetUnfolder]: 1045/2683 cut-off events. [2022-12-06 05:00:58,247 INFO L131 PetriNetUnfolder]: For 73445/73719 co-relation queries the response was YES. [2022-12-06 05:00:58,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22756 conditions, 2683 events. 1045/2683 cut-off events. For 73445/73719 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 24492 event pairs, 421 based on Foata normal form. 63/2554 useless extension candidates. Maximal degree in co-relation 22323. Up to 998 conditions per place. [2022-12-06 05:00:58,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 387 transitions, 8318 flow [2022-12-06 05:00:58,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 1318 [2022-12-06 05:00:58,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L59-5-->L47-5: Formula: (let ((.cse1 (select |v_#memory_int_414| v_~B~0.base_177))) (and (let ((.cse0 (* 4 v_~i_BA~0_192))) (= (select (select |v_#memory_int_414| v_~A~0.base_186) (+ .cse0 v_~A~0.offset_186)) (select .cse1 (+ v_~B~0.offset_177 .cse0)))) (= (+ v_~i_BA~0_192 1) v_~i_BA~0_191) (< v_~i_BA~0_192 v_~Bn~0_174) (= (select .cse1 (+ v_~B~0.offset_177 (* v_~i_AB~0_227 4))) |v_thread1Thread1of1ForFork1_#t~mem1_180|) (= (+ v_~i_AB~0_227 1) v_~i_AB~0_226) (< v_~i_BA~0_192 v_~An~0_154))) InVars {~A~0.base=v_~A~0.base_186, ~B~0.base=v_~B~0.base_177, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_180|, ~A~0.offset=v_~A~0.offset_186, ~i_AB~0=v_~i_AB~0_227, #memory_int=|v_#memory_int_414|, ~i_BA~0=v_~i_BA~0_192, ~B~0.offset=v_~B~0.offset_177, ~Bn~0=v_~Bn~0_174, ~An~0=v_~An~0_154} OutVars{~A~0.base=v_~A~0.base_186, ~B~0.base=v_~B~0.base_177, ~i_AB~0=v_~i_AB~0_226, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_91|, ~An~0=v_~An~0_154, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_79|, ~A~0.offset=v_~A~0.offset_186, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_129|, #memory_int=|v_#memory_int_414|, ~i_BA~0=v_~i_BA~0_191, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_124|, ~B~0.offset=v_~B~0.offset_177, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_126|, ~Bn~0=v_~Bn~0_174} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 05:00:58,353 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:00:58,386 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:00:58,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 440 [2022-12-06 05:00:58,386 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 387 transitions, 8365 flow [2022-12-06 05:00:58,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:58,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:00:58,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:00:58,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 05:00:58,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 05:00:58,587 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:00:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:00:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1988909452, now seen corresponding path program 1 times [2022-12-06 05:00:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:00:58,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405289951] [2022-12-06 05:00:58,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:00:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:58,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:00:58,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405289951] [2022-12-06 05:00:58,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405289951] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:00:58,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058870250] [2022-12-06 05:00:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:00:58,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:00:58,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:00:58,871 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-12-06 05:00:58,874 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-12-06 05:00:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:59,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 05:00:59,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:59,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:59,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:59,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:59,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:59,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-06 05:00:59,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:59,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:00:59,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:59,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:59,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-06 05:00:59,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:00:59,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:00:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:59,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:59,180 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1905 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1905))) (let ((.cse0 (select .cse3 c_~B~0.base))) (or (let ((.cse1 (* c_~i_AB~0 4))) (= (select .cse0 (+ 4 c_~B~0.offset .cse1)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset 4 .cse1)))) (not (let ((.cse2 (* c_~i_BA~0 4))) (= (select .cse0 (+ .cse2 4 c_~B~0.offset)) (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse2 4))))))))) is different from false [2022-12-06 05:00:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:59,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058870250] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:59,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:59,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:00:59,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714372099] [2022-12-06 05:00:59,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:59,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:00:59,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:59,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:00:59,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2022-12-06 05:00:59,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:00:59,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 387 transitions, 8365 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:00:59,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:59,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:00:59,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:00,278 INFO L130 PetriNetUnfolder]: 2576/4729 cut-off events. [2022-12-06 05:01:00,278 INFO L131 PetriNetUnfolder]: For 135997/135997 co-relation queries the response was YES. [2022-12-06 05:01:00,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44120 conditions, 4729 events. 2576/4729 cut-off events. For 135997/135997 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 33795 event pairs, 1277 based on Foata normal form. 4/4732 useless extension candidates. Maximal degree in co-relation 43441. Up to 4674 conditions per place. [2022-12-06 05:01:00,318 INFO L137 encePairwiseOnDemand]: 26/49 looper letters, 363 selfloop transitions, 35 changer transitions 6/404 dead transitions. [2022-12-06 05:01:00,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 404 transitions, 9321 flow [2022-12-06 05:01:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:01:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:01:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-06 05:01:00,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21574344023323616 [2022-12-06 05:01:00,319 INFO L175 Difference]: Start difference. First operand has 207 places, 387 transitions, 8365 flow. Second operand 7 states and 74 transitions. [2022-12-06 05:01:00,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 404 transitions, 9321 flow [2022-12-06 05:01:00,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 404 transitions, 9089 flow, removed 94 selfloop flow, removed 3 redundant places. [2022-12-06 05:01:00,683 INFO L231 Difference]: Finished difference. Result has 211 places, 388 transitions, 8227 flow [2022-12-06 05:01:00,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8116, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8227, PETRI_PLACES=211, PETRI_TRANSITIONS=388} [2022-12-06 05:01:00,684 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 190 predicate places. [2022-12-06 05:01:00,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:00,684 INFO L89 Accepts]: Start accepts. Operand has 211 places, 388 transitions, 8227 flow [2022-12-06 05:01:00,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:00,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:00,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 388 transitions, 8227 flow [2022-12-06 05:01:00,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 388 transitions, 8227 flow [2022-12-06 05:01:01,013 INFO L130 PetriNetUnfolder]: 1027/2663 cut-off events. [2022-12-06 05:01:01,013 INFO L131 PetriNetUnfolder]: For 66546/66800 co-relation queries the response was YES. [2022-12-06 05:01:01,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22093 conditions, 2663 events. 1027/2663 cut-off events. For 66546/66800 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 24445 event pairs, 424 based on Foata normal form. 61/2532 useless extension candidates. Maximal degree in co-relation 21663. Up to 999 conditions per place. [2022-12-06 05:01:01,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 388 transitions, 8227 flow [2022-12-06 05:01:01,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 1312 [2022-12-06 05:01:01,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L59-5-->L59-5: Formula: (let ((.cse0 (select |v_#memory_int_412| v_~A~0.base_184)) (.cse2 (select |v_#memory_int_412| v_~B~0.base_175))) (and (< v_~i_BA~0_185 (+ v_~Bn~0_172 1)) (let ((.cse1 (* 4 v_~i_BA~0_187))) (= (select .cse0 (+ v_~A~0.offset_184 .cse1)) (select .cse2 (+ v_~B~0.offset_175 .cse1)))) (< v_~i_BA~0_185 (+ v_~An~0_152 1)) (= (+ 2 v_~i_BA~0_187) v_~i_BA~0_185) (let ((.cse3 (* 4 v_~i_BA~0_185))) (= (select .cse0 (+ v_~A~0.offset_184 (- 4) .cse3)) (select .cse2 (+ v_~B~0.offset_175 (- 4) .cse3)))))) InVars {~A~0.base=v_~A~0.base_184, ~A~0.offset=v_~A~0.offset_184, ~B~0.base=v_~B~0.base_175, #memory_int=|v_#memory_int_412|, ~i_BA~0=v_~i_BA~0_187, ~B~0.offset=v_~B~0.offset_175, ~Bn~0=v_~Bn~0_172, ~An~0=v_~An~0_152} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_75|, ~A~0.base=v_~A~0.base_184, ~A~0.offset=v_~A~0.offset_184, ~B~0.base=v_~B~0.base_175, #memory_int=|v_#memory_int_412|, ~i_BA~0=v_~i_BA~0_185, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_120|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_122|, ~B~0.offset=v_~B~0.offset_175, ~Bn~0=v_~Bn~0_172, ~An~0=v_~An~0_152} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:01:01,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:01:01,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 401 [2022-12-06 05:01:01,085 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 388 transitions, 8242 flow [2022-12-06 05:01:01,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:01,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:01,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:01,092 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-12-06 05:01:01,290 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,SelfDestructingSolverStorable36 [2022-12-06 05:01:01,290 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1867485893, now seen corresponding path program 1 times [2022-12-06 05:01:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:01,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889617187] [2022-12-06 05:01:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:01,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:01,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889617187] [2022-12-06 05:01:01,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889617187] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:01,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432822745] [2022-12-06 05:01:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:01,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:01,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:01,333 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-12-06 05:01:01,337 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-12-06 05:01:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:01,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:01:01,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:01,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:01:01,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432822745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:01,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:01:01,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 05:01:01,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806641718] [2022-12-06 05:01:01,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:01,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:01,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:01,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:01:01,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:01:01,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 388 transitions, 8242 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:01,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:01,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:01:01,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:02,798 INFO L130 PetriNetUnfolder]: 3286/6171 cut-off events. [2022-12-06 05:01:02,799 INFO L131 PetriNetUnfolder]: For 170667/170667 co-relation queries the response was YES. [2022-12-06 05:01:02,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55765 conditions, 6171 events. 3286/6171 cut-off events. For 170667/170667 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 47118 event pairs, 1767 based on Foata normal form. 70/6240 useless extension candidates. Maximal degree in co-relation 54075. Up to 3774 conditions per place. [2022-12-06 05:01:02,859 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 454 selfloop transitions, 9 changer transitions 3/466 dead transitions. [2022-12-06 05:01:02,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 466 transitions, 10372 flow [2022-12-06 05:01:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:01:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:01:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-06 05:01:02,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2022-12-06 05:01:02,860 INFO L175 Difference]: Start difference. First operand has 210 places, 388 transitions, 8242 flow. Second operand 4 states and 82 transitions. [2022-12-06 05:01:02,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 466 transitions, 10372 flow [2022-12-06 05:01:03,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 466 transitions, 10281 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-06 05:01:03,284 INFO L231 Difference]: Finished difference. Result has 210 places, 384 transitions, 8099 flow [2022-12-06 05:01:03,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8100, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8099, PETRI_PLACES=210, PETRI_TRANSITIONS=384} [2022-12-06 05:01:03,285 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 189 predicate places. [2022-12-06 05:01:03,285 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:03,285 INFO L89 Accepts]: Start accepts. Operand has 210 places, 384 transitions, 8099 flow [2022-12-06 05:01:03,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:03,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:03,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 384 transitions, 8099 flow [2022-12-06 05:01:03,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 384 transitions, 8099 flow [2022-12-06 05:01:03,914 INFO L130 PetriNetUnfolder]: 1316/3551 cut-off events. [2022-12-06 05:01:03,915 INFO L131 PetriNetUnfolder]: For 89676/90019 co-relation queries the response was YES. [2022-12-06 05:01:03,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28746 conditions, 3551 events. 1316/3551 cut-off events. For 89676/90019 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 35165 event pairs, 603 based on Foata normal form. 78/3351 useless extension candidates. Maximal degree in co-relation 27713. Up to 1362 conditions per place. [2022-12-06 05:01:03,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 384 transitions, 8099 flow [2022-12-06 05:01:03,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 1296 [2022-12-06 05:01:04,090 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:01:04,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 806 [2022-12-06 05:01:04,091 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 383 transitions, 8089 flow [2022-12-06 05:01:04,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:04,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:04,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:04,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-06 05:01:04,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 05:01:04,300 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1589734423, now seen corresponding path program 1 times [2022-12-06 05:01:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:04,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436504819] [2022-12-06 05:01:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:04,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:04,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436504819] [2022-12-06 05:01:04,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436504819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:04,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091159382] [2022-12-06 05:01:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:04,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:04,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:04,392 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-12-06 05:01:04,395 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-12-06 05:01:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:04,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:01:04,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:04,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:01:04,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091159382] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:04,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:04,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 6 [2022-12-06 05:01:04,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114520455] [2022-12-06 05:01:04,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:04,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:01:04,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:01:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:01:04,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:01:04,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 383 transitions, 8089 flow. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:04,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:04,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:01:04,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:05,918 INFO L130 PetriNetUnfolder]: 3422/6463 cut-off events. [2022-12-06 05:01:05,918 INFO L131 PetriNetUnfolder]: For 179177/179177 co-relation queries the response was YES. [2022-12-06 05:01:05,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58528 conditions, 6463 events. 3422/6463 cut-off events. For 179177/179177 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 50130 event pairs, 1040 based on Foata normal form. 2/6464 useless extension candidates. Maximal degree in co-relation 58273. Up to 4186 conditions per place. [2022-12-06 05:01:05,981 INFO L137 encePairwiseOnDemand]: 23/49 looper letters, 243 selfloop transitions, 183 changer transitions 6/432 dead transitions. [2022-12-06 05:01:05,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 432 transitions, 9597 flow [2022-12-06 05:01:05,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:01:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:01:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-06 05:01:05,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2627551020408163 [2022-12-06 05:01:05,982 INFO L175 Difference]: Start difference. First operand has 208 places, 383 transitions, 8089 flow. Second operand 8 states and 103 transitions. [2022-12-06 05:01:05,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 432 transitions, 9597 flow [2022-12-06 05:01:06,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 432 transitions, 9550 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-06 05:01:06,657 INFO L231 Difference]: Finished difference. Result has 213 places, 390 transitions, 8704 flow [2022-12-06 05:01:06,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8054, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8704, PETRI_PLACES=213, PETRI_TRANSITIONS=390} [2022-12-06 05:01:06,659 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 192 predicate places. [2022-12-06 05:01:06,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:06,659 INFO L89 Accepts]: Start accepts. Operand has 213 places, 390 transitions, 8704 flow [2022-12-06 05:01:06,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:06,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:06,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 390 transitions, 8704 flow [2022-12-06 05:01:06,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 390 transitions, 8704 flow [2022-12-06 05:01:07,021 INFO L130 PetriNetUnfolder]: 1122/2989 cut-off events. [2022-12-06 05:01:07,021 INFO L131 PetriNetUnfolder]: For 76853/77117 co-relation queries the response was YES. [2022-12-06 05:01:07,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24965 conditions, 2989 events. 1122/2989 cut-off events. For 76853/77117 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 28492 event pairs, 496 based on Foata normal form. 58/2833 useless extension candidates. Maximal degree in co-relation 24632. Up to 1132 conditions per place. [2022-12-06 05:01:07,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 390 transitions, 8704 flow [2022-12-06 05:01:07,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-06 05:01:07,065 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:07,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 408 [2022-12-06 05:01:07,067 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 390 transitions, 8704 flow [2022-12-06 05:01:07,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:07,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:07,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:07,075 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-12-06 05:01:07,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 05:01:07,273 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:07,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:07,273 INFO L85 PathProgramCache]: Analyzing trace with hash 372100181, now seen corresponding path program 1 times [2022-12-06 05:01:07,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:07,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071187630] [2022-12-06 05:01:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:07,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:07,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071187630] [2022-12-06 05:01:07,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071187630] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:07,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670463833] [2022-12-06 05:01:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:07,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:07,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:07,398 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-12-06 05:01:07,401 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-12-06 05:01:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:07,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:01:07,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:07,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:01:07,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670463833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:07,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:01:07,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-06 05:01:07,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805736079] [2022-12-06 05:01:07,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:07,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:01:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:07,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:01:07,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:01:07,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:01:07,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 390 transitions, 8704 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:07,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:07,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:01:07,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:08,704 INFO L130 PetriNetUnfolder]: 2643/4973 cut-off events. [2022-12-06 05:01:08,704 INFO L131 PetriNetUnfolder]: For 144834/144834 co-relation queries the response was YES. [2022-12-06 05:01:08,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46262 conditions, 4973 events. 2643/4973 cut-off events. For 144834/144834 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 36498 event pairs, 1367 based on Foata normal form. 84/5056 useless extension candidates. Maximal degree in co-relation 45488. Up to 3831 conditions per place. [2022-12-06 05:01:08,754 INFO L137 encePairwiseOnDemand]: 32/49 looper letters, 377 selfloop transitions, 39 changer transitions 8/424 dead transitions. [2022-12-06 05:01:08,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 424 transitions, 9999 flow [2022-12-06 05:01:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:01:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:01:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 05:01:08,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.363265306122449 [2022-12-06 05:01:08,755 INFO L175 Difference]: Start difference. First operand has 213 places, 390 transitions, 8704 flow. Second operand 5 states and 89 transitions. [2022-12-06 05:01:08,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 424 transitions, 9999 flow [2022-12-06 05:01:09,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 424 transitions, 9785 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-12-06 05:01:09,221 INFO L231 Difference]: Finished difference. Result has 212 places, 360 transitions, 8087 flow [2022-12-06 05:01:09,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8109, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8087, PETRI_PLACES=212, PETRI_TRANSITIONS=360} [2022-12-06 05:01:09,221 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 191 predicate places. [2022-12-06 05:01:09,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:09,222 INFO L89 Accepts]: Start accepts. Operand has 212 places, 360 transitions, 8087 flow [2022-12-06 05:01:09,223 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:09,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:09,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 360 transitions, 8087 flow [2022-12-06 05:01:09,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 360 transitions, 8087 flow [2022-12-06 05:01:09,552 INFO L130 PetriNetUnfolder]: 982/2670 cut-off events. [2022-12-06 05:01:09,552 INFO L131 PetriNetUnfolder]: For 65755/66043 co-relation queries the response was YES. [2022-12-06 05:01:09,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22173 conditions, 2670 events. 982/2670 cut-off events. For 65755/66043 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 24935 event pairs, 466 based on Foata normal form. 79/2560 useless extension candidates. Maximal degree in co-relation 21821. Up to 1009 conditions per place. [2022-12-06 05:01:09,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 360 transitions, 8087 flow [2022-12-06 05:01:09,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 1180 [2022-12-06 05:01:09,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] L47-5-->L47-5: Formula: (let ((.cse3 (+ v_~i_AB~0_199 1)) (.cse2 (select |v_#memory_int_390| v_~A~0.base_176)) (.cse0 (select |v_#memory_int_390| v_~B~0.base_166)) (.cse1 (* v_~i_AB~0_199 4))) (and (= (select .cse0 (+ v_~B~0.offset_166 .cse1 4)) (select .cse2 (+ .cse1 v_~A~0.offset_176 4))) (< .cse3 v_~An~0_144) (= v_~i_AB~0_197 (+ 2 v_~i_AB~0_199)) (< .cse3 v_~Bn~0_164) (= (select .cse2 (+ .cse1 v_~A~0.offset_176)) (select .cse0 (+ v_~B~0.offset_166 .cse1))))) InVars {~A~0.base=v_~A~0.base_176, ~B~0.base=v_~B~0.base_166, ~A~0.offset=v_~A~0.offset_176, ~i_AB~0=v_~i_AB~0_199, #memory_int=|v_#memory_int_390|, ~B~0.offset=v_~B~0.offset_166, ~Bn~0=v_~Bn~0_164, ~An~0=v_~An~0_144} OutVars{~A~0.base=v_~A~0.base_176, ~B~0.base=v_~B~0.base_166, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_156|, ~A~0.offset=v_~A~0.offset_176, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_107|, ~i_AB~0=v_~i_AB~0_197, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_70|, #memory_int=|v_#memory_int_390|, ~B~0.offset=v_~B~0.offset_166, ~Bn~0=v_~Bn~0_164, ~An~0=v_~An~0_144} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:01:09,752 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:01:09,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 532 [2022-12-06 05:01:09,753 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 357 transitions, 8073 flow [2022-12-06 05:01:09,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:09,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:09,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:09,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:09,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 05:01:09,954 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash 168378614, now seen corresponding path program 1 times [2022-12-06 05:01:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:09,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195971333] [2022-12-06 05:01:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:10,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195971333] [2022-12-06 05:01:10,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195971333] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:10,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797584677] [2022-12-06 05:01:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:10,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:10,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:10,008 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:10,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 05:01:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:10,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:01:10,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:10,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:01:10,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797584677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:10,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:01:10,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 05:01:10,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109055474] [2022-12-06 05:01:10,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:10,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:10,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:10,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:01:10,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:01:10,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 357 transitions, 8073 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:10,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:10,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:01:10,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:11,039 INFO L130 PetriNetUnfolder]: 2535/4773 cut-off events. [2022-12-06 05:01:11,040 INFO L131 PetriNetUnfolder]: For 128177/128177 co-relation queries the response was YES. [2022-12-06 05:01:11,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43923 conditions, 4773 events. 2535/4773 cut-off events. For 128177/128177 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 34708 event pairs, 1472 based on Foata normal form. 22/4795 useless extension candidates. Maximal degree in co-relation 43508. Up to 4615 conditions per place. [2022-12-06 05:01:11,086 INFO L137 encePairwiseOnDemand]: 37/44 looper letters, 329 selfloop transitions, 0 changer transitions 35/364 dead transitions. [2022-12-06 05:01:11,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 364 transitions, 8774 flow [2022-12-06 05:01:11,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:01:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:01:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 05:01:11,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2022-12-06 05:01:11,087 INFO L175 Difference]: Start difference. First operand has 204 places, 357 transitions, 8073 flow. Second operand 4 states and 67 transitions. [2022-12-06 05:01:11,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 364 transitions, 8774 flow [2022-12-06 05:01:11,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 364 transitions, 8591 flow, removed 34 selfloop flow, removed 12 redundant places. [2022-12-06 05:01:11,557 INFO L231 Difference]: Finished difference. Result has 196 places, 329 transitions, 7238 flow [2022-12-06 05:01:11,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7728, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7238, PETRI_PLACES=196, PETRI_TRANSITIONS=329} [2022-12-06 05:01:11,558 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 175 predicate places. [2022-12-06 05:01:11,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:11,558 INFO L89 Accepts]: Start accepts. Operand has 196 places, 329 transitions, 7238 flow [2022-12-06 05:01:11,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:11,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:11,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 329 transitions, 7238 flow [2022-12-06 05:01:11,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 329 transitions, 7238 flow [2022-12-06 05:01:11,839 INFO L130 PetriNetUnfolder]: 939/2534 cut-off events. [2022-12-06 05:01:11,839 INFO L131 PetriNetUnfolder]: For 54849/55098 co-relation queries the response was YES. [2022-12-06 05:01:11,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19740 conditions, 2534 events. 939/2534 cut-off events. For 54849/55098 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 23428 event pairs, 458 based on Foata normal form. 66/2392 useless extension candidates. Maximal degree in co-relation 19385. Up to 970 conditions per place. [2022-12-06 05:01:11,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 329 transitions, 7238 flow [2022-12-06 05:01:11,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 1084 [2022-12-06 05:01:11,899 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:11,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 341 [2022-12-06 05:01:11,899 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 329 transitions, 7238 flow [2022-12-06 05:01:11,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:11,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:11,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:11,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-06 05:01:12,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-12-06 05:01:12,104 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash -543487025, now seen corresponding path program 1 times [2022-12-06 05:01:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:12,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6783746] [2022-12-06 05:01:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:01:12,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:12,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6783746] [2022-12-06 05:01:12,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6783746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:12,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417264218] [2022-12-06 05:01:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:12,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:12,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:12,137 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:12,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 05:01:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:12,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:01:12,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:01:12,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:01:12,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417264218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:12,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:01:12,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 05:01:12,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728346120] [2022-12-06 05:01:12,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:12,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:12,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:12,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:12,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:01:12,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:01:12,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 329 transitions, 7238 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:12,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:12,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:01:12,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:13,178 INFO L130 PetriNetUnfolder]: 2731/5142 cut-off events. [2022-12-06 05:01:13,179 INFO L131 PetriNetUnfolder]: For 117963/117963 co-relation queries the response was YES. [2022-12-06 05:01:13,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44541 conditions, 5142 events. 2731/5142 cut-off events. For 117963/117963 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 38009 event pairs, 1617 based on Foata normal form. 22/5163 useless extension candidates. Maximal degree in co-relation 44275. Up to 4392 conditions per place. [2022-12-06 05:01:13,309 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 365 selfloop transitions, 2 changer transitions 5/372 dead transitions. [2022-12-06 05:01:13,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 372 transitions, 8657 flow [2022-12-06 05:01:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:01:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:01:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 05:01:13,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42441860465116277 [2022-12-06 05:01:13,310 INFO L175 Difference]: Start difference. First operand has 191 places, 329 transitions, 7238 flow. Second operand 4 states and 73 transitions. [2022-12-06 05:01:13,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 372 transitions, 8657 flow [2022-12-06 05:01:13,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 372 transitions, 8600 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-06 05:01:13,621 INFO L231 Difference]: Finished difference. Result has 188 places, 324 transitions, 7062 flow [2022-12-06 05:01:13,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7181, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7062, PETRI_PLACES=188, PETRI_TRANSITIONS=324} [2022-12-06 05:01:13,621 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 167 predicate places. [2022-12-06 05:01:13,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:13,621 INFO L89 Accepts]: Start accepts. Operand has 188 places, 324 transitions, 7062 flow [2022-12-06 05:01:13,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:13,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:13,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 324 transitions, 7062 flow [2022-12-06 05:01:13,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 324 transitions, 7062 flow [2022-12-06 05:01:13,924 INFO L130 PetriNetUnfolder]: 996/2751 cut-off events. [2022-12-06 05:01:13,924 INFO L131 PetriNetUnfolder]: For 57820/58116 co-relation queries the response was YES. [2022-12-06 05:01:13,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21174 conditions, 2751 events. 996/2751 cut-off events. For 57820/58116 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 26264 event pairs, 502 based on Foata normal form. 73/2604 useless extension candidates. Maximal degree in co-relation 21008. Up to 1044 conditions per place. [2022-12-06 05:01:13,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 324 transitions, 7062 flow [2022-12-06 05:01:13,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 1062 [2022-12-06 05:01:13,963 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:13,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 344 [2022-12-06 05:01:13,965 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 324 transitions, 7062 flow [2022-12-06 05:01:13,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:13,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:13,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:13,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:14,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:14,170 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1098375250, now seen corresponding path program 1 times [2022-12-06 05:01:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:14,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285363756] [2022-12-06 05:01:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:14,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:14,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285363756] [2022-12-06 05:01:14,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285363756] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:14,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516387138] [2022-12-06 05:01:14,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:14,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:14,478 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:14,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 05:01:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:14,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 05:01:14,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:14,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:14,667 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-06 05:01:14,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-06 05:01:14,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:14,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:01:14,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:14,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:01:14,695 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:01:14,696 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2022-12-06 05:01:14,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:14,715 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-06 05:01:14,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 33 [2022-12-06 05:01:14,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:14,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:01:14,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:01:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:14,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:15,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516387138] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:15,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:15,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 05:01:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703025699] [2022-12-06 05:01:15,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:15,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:01:15,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:01:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=121, Unknown=1, NotChecked=0, Total=156 [2022-12-06 05:01:15,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:01:15,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 324 transitions, 7062 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:15,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:15,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:01:15,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:16,563 INFO L130 PetriNetUnfolder]: 3061/5773 cut-off events. [2022-12-06 05:01:16,564 INFO L131 PetriNetUnfolder]: For 131777/131777 co-relation queries the response was YES. [2022-12-06 05:01:16,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49397 conditions, 5773 events. 3061/5773 cut-off events. For 131777/131777 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 43740 event pairs, 1462 based on Foata normal form. 60/5832 useless extension candidates. Maximal degree in co-relation 49064. Up to 5178 conditions per place. [2022-12-06 05:01:16,629 INFO L137 encePairwiseOnDemand]: 20/39 looper letters, 343 selfloop transitions, 105 changer transitions 4/452 dead transitions. [2022-12-06 05:01:16,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 452 transitions, 9653 flow [2022-12-06 05:01:16,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:01:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:01:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 137 transitions. [2022-12-06 05:01:16,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2066365007541478 [2022-12-06 05:01:16,630 INFO L175 Difference]: Start difference. First operand has 186 places, 324 transitions, 7062 flow. Second operand 17 states and 137 transitions. [2022-12-06 05:01:16,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 452 transitions, 9653 flow [2022-12-06 05:01:17,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 452 transitions, 9605 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 05:01:17,019 INFO L231 Difference]: Finished difference. Result has 204 places, 378 transitions, 8440 flow [2022-12-06 05:01:17,019 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7015, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8440, PETRI_PLACES=204, PETRI_TRANSITIONS=378} [2022-12-06 05:01:17,019 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 183 predicate places. [2022-12-06 05:01:17,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:17,019 INFO L89 Accepts]: Start accepts. Operand has 204 places, 378 transitions, 8440 flow [2022-12-06 05:01:17,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:17,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:17,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 378 transitions, 8440 flow [2022-12-06 05:01:17,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 378 transitions, 8440 flow [2022-12-06 05:01:17,417 INFO L130 PetriNetUnfolder]: 1094/2985 cut-off events. [2022-12-06 05:01:17,417 INFO L131 PetriNetUnfolder]: For 80993/81308 co-relation queries the response was YES. [2022-12-06 05:01:17,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25354 conditions, 2985 events. 1094/2985 cut-off events. For 80993/81308 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 28572 event pairs, 474 based on Foata normal form. 77/2852 useless extension candidates. Maximal degree in co-relation 24907. Up to 1065 conditions per place. [2022-12-06 05:01:17,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 378 transitions, 8440 flow [2022-12-06 05:01:17,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 1276 [2022-12-06 05:01:17,463 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [586] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_163| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)) (select (select |v_#memory_int_163| v_~B~0.base_71) (+ .cse0 v_~B~0.offset_71)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_71, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_163|, ~B~0.offset=v_~B~0.offset_71, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_71, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_63|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_49|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_163|, ~B~0.offset=v_~B~0.offset_71, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 05:01:17,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 05:01:17,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 05:01:17,636 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:01:17,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 618 [2022-12-06 05:01:17,637 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 377 transitions, 8486 flow [2022-12-06 05:01:17,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:17,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:17,642 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:17,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:17,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:17,847 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash -854103126, now seen corresponding path program 1 times [2022-12-06 05:01:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:17,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884478394] [2022-12-06 05:01:17,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:17,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:18,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:18,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884478394] [2022-12-06 05:01:18,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884478394] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:18,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501179620] [2022-12-06 05:01:18,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:18,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:18,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:18,030 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:18,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 05:01:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:18,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:01:18,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:18,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:18,370 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-06 05:01:18,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-06 05:01:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:18,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501179620] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:18,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:18,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 05:01:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920560859] [2022-12-06 05:01:18,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:18,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:01:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:01:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:01:18,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:01:18,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 377 transitions, 8486 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:18,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:18,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:01:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:19,825 INFO L130 PetriNetUnfolder]: 2902/5431 cut-off events. [2022-12-06 05:01:19,825 INFO L131 PetriNetUnfolder]: For 157469/157469 co-relation queries the response was YES. [2022-12-06 05:01:19,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51009 conditions, 5431 events. 2902/5431 cut-off events. For 157469/157469 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 40367 event pairs, 562 based on Foata normal form. 28/5458 useless extension candidates. Maximal degree in co-relation 50552. Up to 3304 conditions per place. [2022-12-06 05:01:19,872 INFO L137 encePairwiseOnDemand]: 18/43 looper letters, 201 selfloop transitions, 255 changer transitions 3/459 dead transitions. [2022-12-06 05:01:19,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 459 transitions, 10771 flow [2022-12-06 05:01:19,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:01:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:01:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2022-12-06 05:01:19,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2039355992844365 [2022-12-06 05:01:19,873 INFO L175 Difference]: Start difference. First operand has 203 places, 377 transitions, 8486 flow. Second operand 13 states and 114 transitions. [2022-12-06 05:01:19,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 459 transitions, 10771 flow [2022-12-06 05:01:20,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 459 transitions, 10300 flow, removed 218 selfloop flow, removed 4 redundant places. [2022-12-06 05:01:20,302 INFO L231 Difference]: Finished difference. Result has 216 places, 414 transitions, 9726 flow [2022-12-06 05:01:20,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8129, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9726, PETRI_PLACES=216, PETRI_TRANSITIONS=414} [2022-12-06 05:01:20,303 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 195 predicate places. [2022-12-06 05:01:20,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:20,303 INFO L89 Accepts]: Start accepts. Operand has 216 places, 414 transitions, 9726 flow [2022-12-06 05:01:20,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:20,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:20,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 414 transitions, 9726 flow [2022-12-06 05:01:20,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 414 transitions, 9726 flow [2022-12-06 05:01:20,687 INFO L130 PetriNetUnfolder]: 1134/3059 cut-off events. [2022-12-06 05:01:20,687 INFO L131 PetriNetUnfolder]: For 88785/89121 co-relation queries the response was YES. [2022-12-06 05:01:20,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26802 conditions, 3059 events. 1134/3059 cut-off events. For 88785/89121 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 29237 event pairs, 465 based on Foata normal form. 103/2956 useless extension candidates. Maximal degree in co-relation 26289. Up to 1109 conditions per place. [2022-12-06 05:01:20,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 414 transitions, 9726 flow [2022-12-06 05:01:20,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 1326 [2022-12-06 05:01:20,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:01:20,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] L47-5-->L59-5: Formula: (let ((.cse2 (select |v_#memory_int_432| v_~B~0.base_185)) (.cse0 (select |v_#memory_int_432| v_~A~0.base_196)) (.cse1 (* 4 v_~i_BA~0_218)) (.cse3 (+ v_~i_BA~0_218 1))) (and (= (select .cse0 (+ v_~A~0.offset_196 (* v_~i_AB~0_247 4))) |v_thread1Thread1of1ForFork1_#t~mem1_203|) (= (select .cse0 (+ v_~A~0.offset_196 .cse1)) (select .cse2 (+ v_~B~0.offset_185 .cse1))) (= (select .cse2 (+ v_~B~0.offset_185 .cse1 4)) (select .cse0 (+ v_~A~0.offset_196 .cse1 4))) (= (+ 2 v_~i_BA~0_218) v_~i_BA~0_216) (< .cse3 v_~Bn~0_184) (< v_~i_AB~0_247 v_~An~0_164) (< v_~i_AB~0_247 v_~Bn~0_184) (< .cse3 v_~An~0_164))) InVars {~A~0.base=v_~A~0.base_196, ~A~0.offset=v_~A~0.offset_196, ~B~0.base=v_~B~0.base_185, #memory_int=|v_#memory_int_432|, ~i_AB~0=v_~i_AB~0_247, ~i_BA~0=v_~i_BA~0_218, ~B~0.offset=v_~B~0.offset_185, ~Bn~0=v_~Bn~0_184, ~An~0=v_~An~0_164} OutVars{~A~0.base=v_~A~0.base_196, ~B~0.base=v_~B~0.base_185, ~i_AB~0=v_~i_AB~0_247, ~An~0=v_~An~0_164, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_94|, ~A~0.offset=v_~A~0.offset_196, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_203|, #memory_int=|v_#memory_int_432|, ~i_BA~0=v_~i_BA~0_216, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_142|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_144|, ~B~0.offset=v_~B~0.offset_185, ~Bn~0=v_~Bn~0_184} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:01:20,826 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:01:20,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 524 [2022-12-06 05:01:20,827 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 413 transitions, 9730 flow [2022-12-06 05:01:20,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:20,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:20,827 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:20,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:21,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-06 05:01:21,033 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:21,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:21,033 INFO L85 PathProgramCache]: Analyzing trace with hash 625899230, now seen corresponding path program 2 times [2022-12-06 05:01:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:21,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663774703] [2022-12-06 05:01:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:21,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:21,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663774703] [2022-12-06 05:01:21,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663774703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:21,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386653058] [2022-12-06 05:01:21,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:01:21,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:21,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:21,443 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:21,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 05:01:21,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:01:21,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:01:21,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:01:21,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:21,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:21,842 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-06 05:01:21,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-06 05:01:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:21,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386653058] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:21,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:21,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 05:01:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166302637] [2022-12-06 05:01:21,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:21,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:01:21,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:01:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:01:21,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:01:21,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 413 transitions, 9730 flow. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:21,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:21,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:01:21,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:23,446 INFO L130 PetriNetUnfolder]: 2828/5355 cut-off events. [2022-12-06 05:01:23,447 INFO L131 PetriNetUnfolder]: For 162716/162716 co-relation queries the response was YES. [2022-12-06 05:01:23,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51108 conditions, 5355 events. 2828/5355 cut-off events. For 162716/162716 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 40171 event pairs, 558 based on Foata normal form. 73/5427 useless extension candidates. Maximal degree in co-relation 49940. Up to 3332 conditions per place. [2022-12-06 05:01:23,505 INFO L137 encePairwiseOnDemand]: 17/44 looper letters, 210 selfloop transitions, 225 changer transitions 19/454 dead transitions. [2022-12-06 05:01:23,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 454 transitions, 10949 flow [2022-12-06 05:01:23,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:01:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:01:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2022-12-06 05:01:23,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2159090909090909 [2022-12-06 05:01:23,507 INFO L175 Difference]: Start difference. First operand has 214 places, 413 transitions, 9730 flow. Second operand 12 states and 114 transitions. [2022-12-06 05:01:23,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 454 transitions, 10949 flow [2022-12-06 05:01:24,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 454 transitions, 10725 flow, removed 83 selfloop flow, removed 6 redundant places. [2022-12-06 05:01:24,105 INFO L231 Difference]: Finished difference. Result has 220 places, 402 transitions, 9864 flow [2022-12-06 05:01:24,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=9403, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9864, PETRI_PLACES=220, PETRI_TRANSITIONS=402} [2022-12-06 05:01:24,106 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 199 predicate places. [2022-12-06 05:01:24,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:24,107 INFO L89 Accepts]: Start accepts. Operand has 220 places, 402 transitions, 9864 flow [2022-12-06 05:01:24,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:24,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:24,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 402 transitions, 9864 flow [2022-12-06 05:01:24,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 402 transitions, 9864 flow [2022-12-06 05:01:24,522 INFO L130 PetriNetUnfolder]: 1060/2868 cut-off events. [2022-12-06 05:01:24,522 INFO L131 PetriNetUnfolder]: For 80369/80624 co-relation queries the response was YES. [2022-12-06 05:01:24,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25699 conditions, 2868 events. 1060/2868 cut-off events. For 80369/80624 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 26863 event pairs, 413 based on Foata normal form. 79/2769 useless extension candidates. Maximal degree in co-relation 24993. Up to 1038 conditions per place. [2022-12-06 05:01:24,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 402 transitions, 9864 flow [2022-12-06 05:01:24,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 1278 [2022-12-06 05:01:24,567 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:24,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 460 [2022-12-06 05:01:24,567 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 402 transitions, 9864 flow [2022-12-06 05:01:24,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:24,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:24,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:24,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:24,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:24,773 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:24,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash -523976351, now seen corresponding path program 1 times [2022-12-06 05:01:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:24,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150596072] [2022-12-06 05:01:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:24,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:24,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150596072] [2022-12-06 05:01:24,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150596072] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:24,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019736269] [2022-12-06 05:01:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:24,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:24,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:24,951 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:24,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 05:01:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:25,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 05:01:25,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:25,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:25,229 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 05:01:25,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 60 [2022-12-06 05:01:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:25,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019736269] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:25,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:25,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 05:01:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13198362] [2022-12-06 05:01:25,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:25,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:01:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:25,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:01:25,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:01:25,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:01:25,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 402 transitions, 9864 flow. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:25,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:25,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:01:25,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:26,515 INFO L130 PetriNetUnfolder]: 2744/5114 cut-off events. [2022-12-06 05:01:26,515 INFO L131 PetriNetUnfolder]: For 153034/153034 co-relation queries the response was YES. [2022-12-06 05:01:26,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49696 conditions, 5114 events. 2744/5114 cut-off events. For 153034/153034 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 37152 event pairs, 1076 based on Foata normal form. 8/5121 useless extension candidates. Maximal degree in co-relation 48487. Up to 4210 conditions per place. [2022-12-06 05:01:26,659 INFO L137 encePairwiseOnDemand]: 19/44 looper letters, 304 selfloop transitions, 147 changer transitions 1/452 dead transitions. [2022-12-06 05:01:26,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 452 transitions, 11530 flow [2022-12-06 05:01:26,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:01:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:01:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 99 transitions. [2022-12-06 05:01:26,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20454545454545456 [2022-12-06 05:01:26,660 INFO L175 Difference]: Start difference. First operand has 218 places, 402 transitions, 9864 flow. Second operand 11 states and 99 transitions. [2022-12-06 05:01:26,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 452 transitions, 11530 flow [2022-12-06 05:01:27,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 452 transitions, 11167 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-12-06 05:01:27,053 INFO L231 Difference]: Finished difference. Result has 225 places, 416 transitions, 10299 flow [2022-12-06 05:01:27,053 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=9510, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10299, PETRI_PLACES=225, PETRI_TRANSITIONS=416} [2022-12-06 05:01:27,054 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 204 predicate places. [2022-12-06 05:01:27,054 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:27,054 INFO L89 Accepts]: Start accepts. Operand has 225 places, 416 transitions, 10299 flow [2022-12-06 05:01:27,055 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:27,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:27,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 416 transitions, 10299 flow [2022-12-06 05:01:27,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 416 transitions, 10299 flow [2022-12-06 05:01:27,457 INFO L130 PetriNetUnfolder]: 1073/2907 cut-off events. [2022-12-06 05:01:27,457 INFO L131 PetriNetUnfolder]: For 85181/85404 co-relation queries the response was YES. [2022-12-06 05:01:27,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26184 conditions, 2907 events. 1073/2907 cut-off events. For 85181/85404 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 27303 event pairs, 426 based on Foata normal form. 80/2812 useless extension candidates. Maximal degree in co-relation 25457. Up to 1056 conditions per place. [2022-12-06 05:01:27,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 416 transitions, 10299 flow [2022-12-06 05:01:27,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 1308 [2022-12-06 05:01:37,007 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:01:37,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9953 [2022-12-06 05:01:37,007 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 416 transitions, 10346 flow [2022-12-06 05:01:37,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:37,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:37,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:37,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:37,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-06 05:01:37,213 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:37,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1108747706, now seen corresponding path program 1 times [2022-12-06 05:01:37,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:37,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197345815] [2022-12-06 05:01:37,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:37,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:37,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:37,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197345815] [2022-12-06 05:01:37,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197345815] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:37,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383505034] [2022-12-06 05:01:37,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:37,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:37,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:37,282 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:37,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 05:01:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:37,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:01:37,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:37,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:01:37,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383505034] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:37,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:37,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2022-12-06 05:01:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47756274] [2022-12-06 05:01:37,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:37,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:01:37,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:37,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:01:37,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:01:37,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:01:37,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 416 transitions, 10346 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:37,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:37,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:01:37,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:38,762 INFO L130 PetriNetUnfolder]: 2786/5194 cut-off events. [2022-12-06 05:01:38,762 INFO L131 PetriNetUnfolder]: For 164546/164546 co-relation queries the response was YES. [2022-12-06 05:01:38,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50954 conditions, 5194 events. 2786/5194 cut-off events. For 164546/164546 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 38187 event pairs, 1066 based on Foata normal form. 2/5194 useless extension candidates. Maximal degree in co-relation 49858. Up to 4081 conditions per place. [2022-12-06 05:01:38,816 INFO L137 encePairwiseOnDemand]: 23/47 looper letters, 328 selfloop transitions, 119 changer transitions 13/460 dead transitions. [2022-12-06 05:01:38,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 460 transitions, 11996 flow [2022-12-06 05:01:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:01:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:01:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-06 05:01:38,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2553191489361702 [2022-12-06 05:01:38,818 INFO L175 Difference]: Start difference. First operand has 225 places, 416 transitions, 10346 flow. Second operand 7 states and 84 transitions. [2022-12-06 05:01:38,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 460 transitions, 11996 flow [2022-12-06 05:01:39,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 460 transitions, 11910 flow, removed 43 selfloop flow, removed 0 redundant places. [2022-12-06 05:01:39,401 INFO L231 Difference]: Finished difference. Result has 234 places, 416 transitions, 10674 flow [2022-12-06 05:01:39,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=10272, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10674, PETRI_PLACES=234, PETRI_TRANSITIONS=416} [2022-12-06 05:01:39,402 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 213 predicate places. [2022-12-06 05:01:39,402 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:39,402 INFO L89 Accepts]: Start accepts. Operand has 234 places, 416 transitions, 10674 flow [2022-12-06 05:01:39,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:39,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:39,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 416 transitions, 10674 flow [2022-12-06 05:01:39,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 416 transitions, 10674 flow [2022-12-06 05:01:39,824 INFO L130 PetriNetUnfolder]: 1079/2920 cut-off events. [2022-12-06 05:01:39,824 INFO L131 PetriNetUnfolder]: For 88914/89123 co-relation queries the response was YES. [2022-12-06 05:01:39,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26825 conditions, 2920 events. 1079/2920 cut-off events. For 88914/89123 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 27417 event pairs, 430 based on Foata normal form. 82/2827 useless extension candidates. Maximal degree in co-relation 26728. Up to 1059 conditions per place. [2022-12-06 05:01:39,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 416 transitions, 10674 flow [2022-12-06 05:01:39,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 1326 [2022-12-06 05:01:39,865 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:39,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 464 [2022-12-06 05:01:39,866 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 416 transitions, 10674 flow [2022-12-06 05:01:39,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:39,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:39,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:39,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:40,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:40,068 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:40,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:40,069 INFO L85 PathProgramCache]: Analyzing trace with hash -221435176, now seen corresponding path program 2 times [2022-12-06 05:01:40,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:40,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078424074] [2022-12-06 05:01:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:40,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:40,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:40,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078424074] [2022-12-06 05:01:40,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078424074] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:40,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452517016] [2022-12-06 05:01:40,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:01:40,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:40,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:40,448 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:40,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 05:01:40,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:01:40,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:01:40,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:01:40,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:40,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:40,882 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 05:01:40,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-06 05:01:40,897 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:01:40,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:01:40,905 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:01:40,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:01:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:40,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452517016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:40,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:40,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 05:01:40,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521896464] [2022-12-06 05:01:40,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:40,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:01:40,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:40,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:01:40,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:01:40,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 05:01:40,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 416 transitions, 10674 flow. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:40,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:40,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 05:01:40,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:42,747 INFO L130 PetriNetUnfolder]: 2882/5387 cut-off events. [2022-12-06 05:01:42,748 INFO L131 PetriNetUnfolder]: For 184667/184667 co-relation queries the response was YES. [2022-12-06 05:01:42,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54306 conditions, 5387 events. 2882/5387 cut-off events. For 184667/184667 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 39899 event pairs, 1134 based on Foata normal form. 43/5429 useless extension candidates. Maximal degree in co-relation 54207. Up to 4621 conditions per place. [2022-12-06 05:01:42,809 INFO L137 encePairwiseOnDemand]: 20/45 looper letters, 308 selfloop transitions, 179 changer transitions 5/492 dead transitions. [2022-12-06 05:01:42,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 492 transitions, 13133 flow [2022-12-06 05:01:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:01:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:01:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-12-06 05:01:42,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2074074074074074 [2022-12-06 05:01:42,811 INFO L175 Difference]: Start difference. First operand has 228 places, 416 transitions, 10674 flow. Second operand 12 states and 112 transitions. [2022-12-06 05:01:42,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 492 transitions, 13133 flow [2022-12-06 05:01:43,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 492 transitions, 12976 flow, removed 32 selfloop flow, removed 6 redundant places. [2022-12-06 05:01:43,396 INFO L231 Difference]: Finished difference. Result has 240 places, 451 transitions, 12214 flow [2022-12-06 05:01:43,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=10533, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12214, PETRI_PLACES=240, PETRI_TRANSITIONS=451} [2022-12-06 05:01:43,398 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 219 predicate places. [2022-12-06 05:01:43,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:43,398 INFO L89 Accepts]: Start accepts. Operand has 240 places, 451 transitions, 12214 flow [2022-12-06 05:01:43,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:43,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:43,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 451 transitions, 12214 flow [2022-12-06 05:01:43,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 451 transitions, 12214 flow [2022-12-06 05:01:43,910 INFO L130 PetriNetUnfolder]: 1145/3066 cut-off events. [2022-12-06 05:01:43,910 INFO L131 PetriNetUnfolder]: For 103820/104087 co-relation queries the response was YES. [2022-12-06 05:01:43,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30054 conditions, 3066 events. 1145/3066 cut-off events. For 103820/104087 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 28796 event pairs, 444 based on Foata normal form. 71/2961 useless extension candidates. Maximal degree in co-relation 29336. Up to 1093 conditions per place. [2022-12-06 05:01:43,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 451 transitions, 12214 flow [2022-12-06 05:01:43,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 1382 [2022-12-06 05:01:43,959 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:43,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 561 [2022-12-06 05:01:43,959 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 451 transitions, 12214 flow [2022-12-06 05:01:43,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:43,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:43,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:43,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:44,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 05:01:44,165 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:44,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:44,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1882939143, now seen corresponding path program 1 times [2022-12-06 05:01:44,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:44,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310222661] [2022-12-06 05:01:44,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:44,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310222661] [2022-12-06 05:01:44,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310222661] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:44,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550062497] [2022-12-06 05:01:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:44,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:44,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:44,288 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:44,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 05:01:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:44,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:01:44,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:44,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:01:44,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550062497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:44,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:01:44,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 05:01:44,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853097783] [2022-12-06 05:01:44,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:44,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:44,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:44,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:44,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:01:44,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 05:01:44,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 451 transitions, 12214 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:44,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:44,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 05:01:44,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:46,157 INFO L130 PetriNetUnfolder]: 2923/5485 cut-off events. [2022-12-06 05:01:46,157 INFO L131 PetriNetUnfolder]: For 198668/198668 co-relation queries the response was YES. [2022-12-06 05:01:46,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57679 conditions, 5485 events. 2923/5485 cut-off events. For 198668/198668 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 40636 event pairs, 1529 based on Foata normal form. 22/5506 useless extension candidates. Maximal degree in co-relation 56525. Up to 5327 conditions per place. [2022-12-06 05:01:46,220 INFO L137 encePairwiseOnDemand]: 38/45 looper letters, 444 selfloop transitions, 0 changer transitions 35/479 dead transitions. [2022-12-06 05:01:46,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 479 transitions, 13641 flow [2022-12-06 05:01:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:01:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:01:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 05:01:46,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2022-12-06 05:01:46,221 INFO L175 Difference]: Start difference. First operand has 238 places, 451 transitions, 12214 flow. Second operand 4 states and 68 transitions. [2022-12-06 05:01:46,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 479 transitions, 13641 flow [2022-12-06 05:01:46,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 479 transitions, 13517 flow, removed 58 selfloop flow, removed 2 redundant places. [2022-12-06 05:01:46,908 INFO L231 Difference]: Finished difference. Result has 241 places, 444 transitions, 11857 flow [2022-12-06 05:01:46,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=12090, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=11857, PETRI_PLACES=241, PETRI_TRANSITIONS=444} [2022-12-06 05:01:46,911 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 220 predicate places. [2022-12-06 05:01:46,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:46,911 INFO L89 Accepts]: Start accepts. Operand has 241 places, 444 transitions, 11857 flow [2022-12-06 05:01:46,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:46,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:46,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 444 transitions, 11857 flow [2022-12-06 05:01:46,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 444 transitions, 11857 flow [2022-12-06 05:01:47,539 INFO L130 PetriNetUnfolder]: 1148/3062 cut-off events. [2022-12-06 05:01:47,540 INFO L131 PetriNetUnfolder]: For 103402/103635 co-relation queries the response was YES. [2022-12-06 05:01:47,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30000 conditions, 3062 events. 1148/3062 cut-off events. For 103402/103635 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 28787 event pairs, 438 based on Foata normal form. 61/2936 useless extension candidates. Maximal degree in co-relation 29191. Up to 1097 conditions per place. [2022-12-06 05:01:47,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 444 transitions, 11857 flow [2022-12-06 05:01:47,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 1376 [2022-12-06 05:01:47,714 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:47,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 804 [2022-12-06 05:01:47,715 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 444 transitions, 11857 flow [2022-12-06 05:01:47,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:47,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:47,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:47,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:47,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 05:01:47,921 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:47,921 INFO L85 PathProgramCache]: Analyzing trace with hash 758859419, now seen corresponding path program 1 times [2022-12-06 05:01:47,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:47,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317120466] [2022-12-06 05:01:47,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:47,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:47,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:47,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317120466] [2022-12-06 05:01:47,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317120466] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:47,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641482224] [2022-12-06 05:01:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:47,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:47,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:47,989 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:48,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 05:01:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:48,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:01:48,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:48,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:48,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641482224] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:48,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:48,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-06 05:01:48,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723847173] [2022-12-06 05:01:48,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:48,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:01:48,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:48,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:01:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:01:48,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:01:48,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 444 transitions, 11857 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:48,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:48,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:01:48,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:49,928 INFO L130 PetriNetUnfolder]: 3053/5667 cut-off events. [2022-12-06 05:01:49,929 INFO L131 PetriNetUnfolder]: For 211726/211726 co-relation queries the response was YES. [2022-12-06 05:01:49,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60036 conditions, 5667 events. 3053/5667 cut-off events. For 211726/211726 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 42001 event pairs, 1136 based on Foata normal form. 20/5686 useless extension candidates. Maximal degree in co-relation 58875. Up to 2604 conditions per place. [2022-12-06 05:01:49,990 INFO L137 encePairwiseOnDemand]: 21/44 looper letters, 364 selfloop transitions, 208 changer transitions 2/574 dead transitions. [2022-12-06 05:01:49,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 574 transitions, 15257 flow [2022-12-06 05:01:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:01:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:01:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-12-06 05:01:49,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37337662337662336 [2022-12-06 05:01:49,995 INFO L175 Difference]: Start difference. First operand has 238 places, 444 transitions, 11857 flow. Second operand 7 states and 115 transitions. [2022-12-06 05:01:49,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 574 transitions, 15257 flow [2022-12-06 05:01:50,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 574 transitions, 15195 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-06 05:01:50,655 INFO L231 Difference]: Finished difference. Result has 244 places, 468 transitions, 13049 flow [2022-12-06 05:01:50,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=11801, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13049, PETRI_PLACES=244, PETRI_TRANSITIONS=468} [2022-12-06 05:01:50,656 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 223 predicate places. [2022-12-06 05:01:50,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:50,656 INFO L89 Accepts]: Start accepts. Operand has 244 places, 468 transitions, 13049 flow [2022-12-06 05:01:50,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:50,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:50,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 468 transitions, 13049 flow [2022-12-06 05:01:50,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 468 transitions, 13049 flow [2022-12-06 05:01:51,184 INFO L130 PetriNetUnfolder]: 1210/3220 cut-off events. [2022-12-06 05:01:51,185 INFO L131 PetriNetUnfolder]: For 115871/116153 co-relation queries the response was YES. [2022-12-06 05:01:51,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32503 conditions, 3220 events. 1210/3220 cut-off events. For 115871/116153 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 30791 event pairs, 484 based on Foata normal form. 94/3100 useless extension candidates. Maximal degree in co-relation 31673. Up to 1195 conditions per place. [2022-12-06 05:01:51,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 468 transitions, 13049 flow [2022-12-06 05:01:51,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-06 05:01:51,247 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:51,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 591 [2022-12-06 05:01:51,247 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 468 transitions, 13049 flow [2022-12-06 05:01:51,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:51,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:51,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:51,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:51,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 05:01:51,451 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:51,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1390120272, now seen corresponding path program 3 times [2022-12-06 05:01:51,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:51,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469817647] [2022-12-06 05:01:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:51,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:51,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469817647] [2022-12-06 05:01:51,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469817647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:51,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515456082] [2022-12-06 05:01:51,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:01:51,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:51,853 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:51,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 05:01:52,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 05:01:52,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:01:52,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:01:52,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:52,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:52,270 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-06 05:01:52,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 88 [2022-12-06 05:01:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:52,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515456082] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:52,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:52,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 05:01:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346913064] [2022-12-06 05:01:52,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:52,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:01:52,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:01:52,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:01:52,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:01:52,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 468 transitions, 13049 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:52,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:52,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:01:52,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:54,127 INFO L130 PetriNetUnfolder]: 3025/5639 cut-off events. [2022-12-06 05:01:54,127 INFO L131 PetriNetUnfolder]: For 219642/219642 co-relation queries the response was YES. [2022-12-06 05:01:54,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60715 conditions, 5639 events. 3025/5639 cut-off events. For 219642/219642 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 41910 event pairs, 894 based on Foata normal form. 28/5666 useless extension candidates. Maximal degree in co-relation 59520. Up to 4923 conditions per place. [2022-12-06 05:01:54,192 INFO L137 encePairwiseOnDemand]: 22/44 looper letters, 328 selfloop transitions, 174 changer transitions 15/517 dead transitions. [2022-12-06 05:01:54,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 517 transitions, 14810 flow [2022-12-06 05:01:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:01:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:01:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2022-12-06 05:01:54,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19507575757575757 [2022-12-06 05:01:54,193 INFO L175 Difference]: Start difference. First operand has 244 places, 468 transitions, 13049 flow. Second operand 12 states and 103 transitions. [2022-12-06 05:01:54,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 517 transitions, 14810 flow [2022-12-06 05:01:54,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 517 transitions, 14782 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-12-06 05:01:54,930 INFO L231 Difference]: Finished difference. Result has 259 places, 476 transitions, 13765 flow [2022-12-06 05:01:54,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13021, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13765, PETRI_PLACES=259, PETRI_TRANSITIONS=476} [2022-12-06 05:01:54,930 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 238 predicate places. [2022-12-06 05:01:54,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:54,931 INFO L89 Accepts]: Start accepts. Operand has 259 places, 476 transitions, 13765 flow [2022-12-06 05:01:54,933 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:54,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:54,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 476 transitions, 13765 flow [2022-12-06 05:01:54,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 476 transitions, 13765 flow [2022-12-06 05:01:55,377 INFO L130 PetriNetUnfolder]: 1168/3127 cut-off events. [2022-12-06 05:01:55,378 INFO L131 PetriNetUnfolder]: For 126019/126327 co-relation queries the response was YES. [2022-12-06 05:01:55,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32486 conditions, 3127 events. 1168/3127 cut-off events. For 126019/126327 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 29768 event pairs, 458 based on Foata normal form. 116/3029 useless extension candidates. Maximal degree in co-relation 31631. Up to 1143 conditions per place. [2022-12-06 05:01:55,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 476 transitions, 13765 flow [2022-12-06 05:01:55,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 1472 [2022-12-06 05:01:55,436 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:55,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 506 [2022-12-06 05:01:55,437 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 476 transitions, 13765 flow [2022-12-06 05:01:55,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:55,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:55,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:55,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:55,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-12-06 05:01:55,643 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:55,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1669562126, now seen corresponding path program 4 times [2022-12-06 05:01:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:55,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853529094] [2022-12-06 05:01:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:55,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:56,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:56,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853529094] [2022-12-06 05:01:56,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853529094] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:56,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697810462] [2022-12-06 05:01:56,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 05:01:56,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:56,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:56,092 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:01:56,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 05:01:56,350 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 05:01:56,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:01:56,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 05:01:56,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:56,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:56,391 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-06 05:01:56,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-06 05:01:56,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:56,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:01:56,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:56,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:01:56,425 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:01:56,426 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 143 [2022-12-06 05:01:56,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:56,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 28 [2022-12-06 05:01:56,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:56,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:01:56,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:56,723 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-12-06 05:01:56,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 208 treesize of output 202 [2022-12-06 05:01:56,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:01:56,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-12-06 05:01:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:56,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:57,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697810462] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:57,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:57,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2022-12-06 05:01:57,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494704430] [2022-12-06 05:01:57,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:57,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:01:57,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:57,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:01:57,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=187, Unknown=2, NotChecked=0, Total=240 [2022-12-06 05:01:57,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:01:57,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 476 transitions, 13765 flow. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:57,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:57,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:01:57,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:59,506 INFO L130 PetriNetUnfolder]: 3252/6119 cut-off events. [2022-12-06 05:01:59,506 INFO L131 PetriNetUnfolder]: For 271504/271504 co-relation queries the response was YES. [2022-12-06 05:01:59,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67612 conditions, 6119 events. 3252/6119 cut-off events. For 271504/271504 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 46359 event pairs, 1268 based on Foata normal form. 102/6220 useless extension candidates. Maximal degree in co-relation 66353. Up to 5510 conditions per place. [2022-12-06 05:01:59,576 INFO L137 encePairwiseOnDemand]: 14/44 looper letters, 444 selfloop transitions, 142 changer transitions 5/591 dead transitions. [2022-12-06 05:01:59,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 591 transitions, 16994 flow [2022-12-06 05:01:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:01:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:01:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 133 transitions. [2022-12-06 05:01:59,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17780748663101603 [2022-12-06 05:01:59,577 INFO L175 Difference]: Start difference. First operand has 256 places, 476 transitions, 13765 flow. Second operand 17 states and 133 transitions. [2022-12-06 05:01:59,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 591 transitions, 16994 flow [2022-12-06 05:02:00,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 591 transitions, 16583 flow, removed 64 selfloop flow, removed 7 redundant places. [2022-12-06 05:02:00,522 INFO L231 Difference]: Finished difference. Result has 273 places, 533 transitions, 15276 flow [2022-12-06 05:02:00,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13418, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=15276, PETRI_PLACES=273, PETRI_TRANSITIONS=533} [2022-12-06 05:02:00,523 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 252 predicate places. [2022-12-06 05:02:00,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:00,523 INFO L89 Accepts]: Start accepts. Operand has 273 places, 533 transitions, 15276 flow [2022-12-06 05:02:00,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:00,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:00,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 533 transitions, 15276 flow [2022-12-06 05:02:00,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 533 transitions, 15276 flow [2022-12-06 05:02:01,293 INFO L130 PetriNetUnfolder]: 1377/3637 cut-off events. [2022-12-06 05:02:01,294 INFO L131 PetriNetUnfolder]: For 162018/162304 co-relation queries the response was YES. [2022-12-06 05:02:01,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38797 conditions, 3637 events. 1377/3637 cut-off events. For 162018/162304 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 35450 event pairs, 580 based on Foata normal form. 121/3451 useless extension candidates. Maximal degree in co-relation 37835. Up to 1364 conditions per place. [2022-12-06 05:02:01,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 533 transitions, 15276 flow [2022-12-06 05:02:01,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 1628 [2022-12-06 05:02:12,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] L47-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_Out_10| 0) (or (not (< v_~i_AB~0_In_6 v_~An~0_In_6)) (not (< v_~i_AB~0_In_6 v_~Bn~0_In_7))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_10| 0)) InVars {~i_AB~0=v_~i_AB~0_In_6, ~Bn~0=v_~Bn~0_In_7, ~An~0=v_~An~0_In_6} OutVars{~i_AB~0=v_~i_AB~0_In_6, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_10|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_10|, ~Bn~0=v_~Bn~0_In_7, ~An~0=v_~An~0_In_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 05:02:12,944 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] L47-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_Out_10| 0) (or (not (< v_~i_AB~0_In_6 v_~An~0_In_6)) (not (< v_~i_AB~0_In_6 v_~Bn~0_In_7))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_10| 0)) InVars {~i_AB~0=v_~i_AB~0_In_6, ~Bn~0=v_~Bn~0_In_7, ~An~0=v_~An~0_In_6} OutVars{~i_AB~0=v_~i_AB~0_In_6, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_10|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_10|, ~Bn~0=v_~Bn~0_In_7, ~An~0=v_~An~0_In_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 05:02:13,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] L47-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_Out_10| 0) (or (not (< v_~i_AB~0_In_6 v_~An~0_In_6)) (not (< v_~i_AB~0_In_6 v_~Bn~0_In_7))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_10| 0)) InVars {~i_AB~0=v_~i_AB~0_In_6, ~Bn~0=v_~Bn~0_In_7, ~An~0=v_~An~0_In_6} OutVars{~i_AB~0=v_~i_AB~0_In_6, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_10|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_10|, ~Bn~0=v_~Bn~0_In_7, ~An~0=v_~An~0_In_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 05:02:13,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] L47-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_Out_10| 0) (or (not (< v_~i_AB~0_In_6 v_~An~0_In_6)) (not (< v_~i_AB~0_In_6 v_~Bn~0_In_7))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_10| 0)) InVars {~i_AB~0=v_~i_AB~0_In_6, ~Bn~0=v_~Bn~0_In_7, ~An~0=v_~An~0_In_6} OutVars{~i_AB~0=v_~i_AB~0_In_6, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_10|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_10|, ~Bn~0=v_~Bn~0_In_7, ~An~0=v_~An~0_In_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 05:02:13,134 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:02:13,134 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12611 [2022-12-06 05:02:13,134 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 533 transitions, 15406 flow [2022-12-06 05:02:13,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:02:13,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:13,135 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:13,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-06 05:02:13,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:13,335 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:02:13,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1850374575, now seen corresponding path program 2 times [2022-12-06 05:02:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:13,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240997105] [2022-12-06 05:02:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:02:13,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:13,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240997105] [2022-12-06 05:02:13,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240997105] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:13,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190504944] [2022-12-06 05:02:13,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:02:13,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:13,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:13,528 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:02:13,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-06 05:02:13,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:02:13,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:02:13,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:02:13,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:02:13,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:13,901 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 05:02:13,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-06 05:02:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:02:13,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190504944] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:13,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:13,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 13 [2022-12-06 05:02:13,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358240531] [2022-12-06 05:02:13,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:13,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:02:13,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:13,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:02:13,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:02:13,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:02:13,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 533 transitions, 15406 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:02:13,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:13,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:02:13,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:16,310 INFO L130 PetriNetUnfolder]: 3582/6746 cut-off events. [2022-12-06 05:02:16,310 INFO L131 PetriNetUnfolder]: For 327176/327176 co-relation queries the response was YES. [2022-12-06 05:02:16,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77152 conditions, 6746 events. 3582/6746 cut-off events. For 327176/327176 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 52358 event pairs, 631 based on Foata normal form. 24/6769 useless extension candidates. Maximal degree in co-relation 75858. Up to 2993 conditions per place. [2022-12-06 05:02:16,385 INFO L137 encePairwiseOnDemand]: 17/51 looper letters, 246 selfloop transitions, 403 changer transitions 15/664 dead transitions. [2022-12-06 05:02:16,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 664 transitions, 19333 flow [2022-12-06 05:02:16,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:02:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:02:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2022-12-06 05:02:16,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20915032679738563 [2022-12-06 05:02:16,386 INFO L175 Difference]: Start difference. First operand has 273 places, 533 transitions, 15406 flow. Second operand 15 states and 160 transitions. [2022-12-06 05:02:16,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 664 transitions, 19333 flow [2022-12-06 05:02:17,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 664 transitions, 19061 flow, removed 100 selfloop flow, removed 7 redundant places. [2022-12-06 05:02:17,491 INFO L231 Difference]: Finished difference. Result has 284 places, 576 transitions, 17468 flow [2022-12-06 05:02:17,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=15172, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=17468, PETRI_PLACES=284, PETRI_TRANSITIONS=576} [2022-12-06 05:02:17,492 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 263 predicate places. [2022-12-06 05:02:17,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:17,492 INFO L89 Accepts]: Start accepts. Operand has 284 places, 576 transitions, 17468 flow [2022-12-06 05:02:17,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:17,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:17,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 284 places, 576 transitions, 17468 flow [2022-12-06 05:02:17,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 283 places, 576 transitions, 17468 flow [2022-12-06 05:02:18,208 INFO L130 PetriNetUnfolder]: 1534/4046 cut-off events. [2022-12-06 05:02:18,208 INFO L131 PetriNetUnfolder]: For 187668/188006 co-relation queries the response was YES. [2022-12-06 05:02:18,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43994 conditions, 4046 events. 1534/4046 cut-off events. For 187668/188006 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 40345 event pairs, 656 based on Foata normal form. 125/3824 useless extension candidates. Maximal degree in co-relation 43018. Up to 1549 conditions per place. [2022-12-06 05:02:18,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 283 places, 576 transitions, 17468 flow [2022-12-06 05:02:18,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 1724 [2022-12-06 05:02:25,698 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 236 DAG size of output: 231 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:02:42,582 WARN L233 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 250 DAG size of output: 244 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:02:43,136 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:02:43,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25644 [2022-12-06 05:02:43,136 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 576 transitions, 17521 flow [2022-12-06 05:02:43,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:02:43,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:43,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:43,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-06 05:02:43,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:43,342 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:02:43,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash -302668079, now seen corresponding path program 1 times [2022-12-06 05:02:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:43,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349587592] [2022-12-06 05:02:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:02:43,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:43,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349587592] [2022-12-06 05:02:43,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349587592] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:43,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352304624] [2022-12-06 05:02:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:43,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:43,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:43,407 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:02:43,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-06 05:02:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:43,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:43,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:02:43,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:02:43,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352304624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:43,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:02:43,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 05:02:43,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958460360] [2022-12-06 05:02:43,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:43,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:43,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:43,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:02:43,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:02:43,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 576 transitions, 17521 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:02:43,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:43,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:02:43,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:45,706 INFO L130 PetriNetUnfolder]: 3542/6661 cut-off events. [2022-12-06 05:02:45,707 INFO L131 PetriNetUnfolder]: For 324249/324249 co-relation queries the response was YES. [2022-12-06 05:02:45,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77671 conditions, 6661 events. 3542/6661 cut-off events. For 324249/324249 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 51107 event pairs, 1867 based on Foata normal form. 44/6704 useless extension candidates. Maximal degree in co-relation 76367. Up to 6344 conditions per place. [2022-12-06 05:02:45,791 INFO L137 encePairwiseOnDemand]: 45/53 looper letters, 541 selfloop transitions, 0 changer transitions 57/598 dead transitions. [2022-12-06 05:02:45,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 598 transitions, 19083 flow [2022-12-06 05:02:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:02:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:02:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 05:02:45,792 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3584905660377358 [2022-12-06 05:02:45,792 INFO L175 Difference]: Start difference. First operand has 283 places, 576 transitions, 17521 flow. Second operand 4 states and 76 transitions. [2022-12-06 05:02:45,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 598 transitions, 19083 flow [2022-12-06 05:02:46,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 598 transitions, 18598 flow, removed 76 selfloop flow, removed 3 redundant places. [2022-12-06 05:02:46,980 INFO L231 Difference]: Finished difference. Result has 285 places, 541 transitions, 16014 flow [2022-12-06 05:02:46,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=16661, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=16014, PETRI_PLACES=285, PETRI_TRANSITIONS=541} [2022-12-06 05:02:46,981 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 264 predicate places. [2022-12-06 05:02:46,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:46,981 INFO L89 Accepts]: Start accepts. Operand has 285 places, 541 transitions, 16014 flow [2022-12-06 05:02:46,983 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:46,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:46,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 541 transitions, 16014 flow [2022-12-06 05:02:46,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 541 transitions, 16014 flow [2022-12-06 05:02:47,625 INFO L130 PetriNetUnfolder]: 1446/3746 cut-off events. [2022-12-06 05:02:47,625 INFO L131 PetriNetUnfolder]: For 173870/174152 co-relation queries the response was YES. [2022-12-06 05:02:47,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40911 conditions, 3746 events. 1446/3746 cut-off events. For 173870/174152 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 36478 event pairs, 615 based on Foata normal form. 123/3543 useless extension candidates. Maximal degree in co-relation 39928. Up to 1423 conditions per place. [2022-12-06 05:02:47,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 541 transitions, 16014 flow [2022-12-06 05:02:47,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 1652 [2022-12-06 05:02:47,699 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:47,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 718 [2022-12-06 05:02:47,699 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 541 transitions, 16014 flow [2022-12-06 05:02:47,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:02:47,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:47,699 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:47,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-06 05:02:47,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-06 05:02:47,904 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:02:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash 567313160, now seen corresponding path program 1 times [2022-12-06 05:02:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:47,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657759036] [2022-12-06 05:02:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:02:47,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:47,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657759036] [2022-12-06 05:02:47,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657759036] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:47,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219627725] [2022-12-06 05:02:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:47,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:47,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:47,967 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:02:47,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-06 05:02:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:48,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:48,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:02:48,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:02:48,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219627725] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:48,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:48,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 05:02:48,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904941122] [2022-12-06 05:02:48,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:48,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:02:48,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:02:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:02:48,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 05:02:48,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 541 transitions, 16014 flow. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:02:48,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:48,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 05:02:48,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:50,586 INFO L130 PetriNetUnfolder]: 3794/6987 cut-off events. [2022-12-06 05:02:50,586 INFO L131 PetriNetUnfolder]: For 349417/349417 co-relation queries the response was YES. [2022-12-06 05:02:50,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82502 conditions, 6987 events. 3794/6987 cut-off events. For 349417/349417 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 52853 event pairs, 1161 based on Foata normal form. 78/7064 useless extension candidates. Maximal degree in co-relation 81191. Up to 3407 conditions per place. [2022-12-06 05:02:50,729 INFO L137 encePairwiseOnDemand]: 25/50 looper letters, 425 selfloop transitions, 276 changer transitions 2/703 dead transitions. [2022-12-06 05:02:50,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 703 transitions, 20965 flow [2022-12-06 05:02:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:02:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:02:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2022-12-06 05:02:50,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3485714285714286 [2022-12-06 05:02:50,730 INFO L175 Difference]: Start difference. First operand has 280 places, 541 transitions, 16014 flow. Second operand 7 states and 122 transitions. [2022-12-06 05:02:50,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 703 transitions, 20965 flow [2022-12-06 05:02:51,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 703 transitions, 20707 flow, removed 31 selfloop flow, removed 7 redundant places. [2022-12-06 05:02:51,879 INFO L231 Difference]: Finished difference. Result has 282 places, 581 transitions, 18164 flow [2022-12-06 05:02:51,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=15799, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=18164, PETRI_PLACES=282, PETRI_TRANSITIONS=581} [2022-12-06 05:02:51,879 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 261 predicate places. [2022-12-06 05:02:51,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:51,880 INFO L89 Accepts]: Start accepts. Operand has 282 places, 581 transitions, 18164 flow [2022-12-06 05:02:51,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:51,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:51,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 282 places, 581 transitions, 18164 flow [2022-12-06 05:02:51,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 581 transitions, 18164 flow [2022-12-06 05:02:52,607 INFO L130 PetriNetUnfolder]: 1634/4137 cut-off events. [2022-12-06 05:02:52,608 INFO L131 PetriNetUnfolder]: For 199426/199878 co-relation queries the response was YES. [2022-12-06 05:02:52,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46667 conditions, 4137 events. 1634/4137 cut-off events. For 199426/199878 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 40342 event pairs, 691 based on Foata normal form. 200/3960 useless extension candidates. Maximal degree in co-relation 45634. Up to 1626 conditions per place. [2022-12-06 05:02:52,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 581 transitions, 18164 flow [2022-12-06 05:02:52,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 1766 [2022-12-06 05:02:52,768 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:52,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 889 [2022-12-06 05:02:52,769 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 581 transitions, 18164 flow [2022-12-06 05:02:52,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:02:52,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:52,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:52,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-06 05:02:52,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:52,974 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:02:52,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:52,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1811262962, now seen corresponding path program 1 times [2022-12-06 05:02:52,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:52,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959925512] [2022-12-06 05:02:52,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:52,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:02:53,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:53,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959925512] [2022-12-06 05:02:53,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959925512] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:53,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51027660] [2022-12-06 05:02:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:53,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:53,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:53,291 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:02:53,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-06 05:02:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:53,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:02:53,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:02:53,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:53,762 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:02:53,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:02:53,767 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:02:53,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:02:53,813 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 05:02:53,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-06 05:02:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:02:53,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51027660] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:53,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:53,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 14 [2022-12-06 05:02:53,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612650625] [2022-12-06 05:02:53,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:53,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:02:53,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:53,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:02:53,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:02:53,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 05:02:53,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 581 transitions, 18164 flow. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:02:53,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:53,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 05:02:53,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:56,620 INFO L130 PetriNetUnfolder]: 4046/7477 cut-off events. [2022-12-06 05:02:56,621 INFO L131 PetriNetUnfolder]: For 379334/379334 co-relation queries the response was YES. [2022-12-06 05:02:56,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89161 conditions, 7477 events. 4046/7477 cut-off events. For 379334/379334 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 57251 event pairs, 1510 based on Foata normal form. 90/7566 useless extension candidates. Maximal degree in co-relation 87769. Up to 6726 conditions per place. [2022-12-06 05:02:56,710 INFO L137 encePairwiseOnDemand]: 26/50 looper letters, 546 selfloop transitions, 135 changer transitions 2/683 dead transitions. [2022-12-06 05:02:56,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 683 transitions, 21586 flow [2022-12-06 05:02:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:02:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:02:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2022-12-06 05:02:56,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.205 [2022-12-06 05:02:56,711 INFO L175 Difference]: Start difference. First operand has 282 places, 581 transitions, 18164 flow. Second operand 12 states and 123 transitions. [2022-12-06 05:02:56,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 683 transitions, 21586 flow [2022-12-06 05:02:58,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 683 transitions, 21382 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-06 05:02:58,095 INFO L231 Difference]: Finished difference. Result has 297 places, 612 transitions, 19161 flow [2022-12-06 05:02:58,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=17970, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=19161, PETRI_PLACES=297, PETRI_TRANSITIONS=612} [2022-12-06 05:02:58,095 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 276 predicate places. [2022-12-06 05:02:58,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:58,095 INFO L89 Accepts]: Start accepts. Operand has 297 places, 612 transitions, 19161 flow [2022-12-06 05:02:58,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:58,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:58,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 612 transitions, 19161 flow [2022-12-06 05:02:58,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 612 transitions, 19161 flow [2022-12-06 05:02:58,951 INFO L130 PetriNetUnfolder]: 1708/4410 cut-off events. [2022-12-06 05:02:58,951 INFO L131 PetriNetUnfolder]: For 229645/230105 co-relation queries the response was YES. [2022-12-06 05:02:58,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51084 conditions, 4410 events. 1708/4410 cut-off events. For 229645/230105 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 43761 event pairs, 696 based on Foata normal form. 208/4240 useless extension candidates. Maximal degree in co-relation 50041. Up to 1669 conditions per place. [2022-12-06 05:02:59,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 612 transitions, 19161 flow [2022-12-06 05:02:59,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-06 05:03:01,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:03:01,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3265 [2022-12-06 05:03:01,360 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 612 transitions, 19191 flow [2022-12-06 05:03:01,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:03:01,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:03:01,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:03:01,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-06 05:03:01,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-06 05:03:01,561 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:03:01,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:03:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash 261450193, now seen corresponding path program 1 times [2022-12-06 05:03:01,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:03:01,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874945481] [2022-12-06 05:03:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:03:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:01,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:03:01,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874945481] [2022-12-06 05:03:01,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874945481] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:03:01,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817476531] [2022-12-06 05:03:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:01,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:01,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:03:01,883 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:03:01,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-06 05:03:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:02,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:03:02,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:03:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:02,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:03:02,439 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-06 05:03:02,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-06 05:03:02,451 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:03:02,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:03:02,455 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:03:02,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:03:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:02,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817476531] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:03:02,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:03:02,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 05:03:02,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475910442] [2022-12-06 05:03:02,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:03:02,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:03:02,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:03:02,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:03:02,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:03:02,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:03:02,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 612 transitions, 19191 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:03:02,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:03:02,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:03:02,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:03:05,768 INFO L130 PetriNetUnfolder]: 4254/7848 cut-off events. [2022-12-06 05:03:05,768 INFO L131 PetriNetUnfolder]: For 412294/412294 co-relation queries the response was YES. [2022-12-06 05:03:05,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95450 conditions, 7848 events. 4254/7848 cut-off events. For 412294/412294 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 60703 event pairs, 904 based on Foata normal form. 52/7899 useless extension candidates. Maximal degree in co-relation 94094. Up to 6445 conditions per place. [2022-12-06 05:03:05,913 INFO L137 encePairwiseOnDemand]: 25/51 looper letters, 531 selfloop transitions, 203 changer transitions 3/737 dead transitions. [2022-12-06 05:03:05,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 737 transitions, 22746 flow [2022-12-06 05:03:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:03:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:03:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 180 transitions. [2022-12-06 05:03:05,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19607843137254902 [2022-12-06 05:03:05,915 INFO L175 Difference]: Start difference. First operand has 297 places, 612 transitions, 19191 flow. Second operand 18 states and 180 transitions. [2022-12-06 05:03:05,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 737 transitions, 22746 flow [2022-12-06 05:03:07,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 737 transitions, 22521 flow, removed 111 selfloop flow, removed 1 redundant places. [2022-12-06 05:03:07,664 INFO L231 Difference]: Finished difference. Result has 319 places, 638 transitions, 20205 flow [2022-12-06 05:03:07,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=18900, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=20205, PETRI_PLACES=319, PETRI_TRANSITIONS=638} [2022-12-06 05:03:07,664 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 298 predicate places. [2022-12-06 05:03:07,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:03:07,664 INFO L89 Accepts]: Start accepts. Operand has 319 places, 638 transitions, 20205 flow [2022-12-06 05:03:07,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:03:07,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:03:07,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 319 places, 638 transitions, 20205 flow [2022-12-06 05:03:07,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 319 places, 638 transitions, 20205 flow [2022-12-06 05:03:08,582 INFO L130 PetriNetUnfolder]: 1730/4528 cut-off events. [2022-12-06 05:03:08,582 INFO L131 PetriNetUnfolder]: For 246653/247173 co-relation queries the response was YES. [2022-12-06 05:03:08,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53242 conditions, 4528 events. 1730/4528 cut-off events. For 246653/247173 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 45662 event pairs, 702 based on Foata normal form. 224/4372 useless extension candidates. Maximal degree in co-relation 52250. Up to 1689 conditions per place. [2022-12-06 05:03:08,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 319 places, 638 transitions, 20205 flow [2022-12-06 05:03:08,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 2064 [2022-12-06 05:03:08,668 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:03:08,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1005 [2022-12-06 05:03:08,669 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 638 transitions, 20205 flow [2022-12-06 05:03:08,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:03:08,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:03:08,669 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:03:08,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-06 05:03:08,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:08,874 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:03:08,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:03:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1119107258, now seen corresponding path program 1 times [2022-12-06 05:03:08,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:03:08,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251698231] [2022-12-06 05:03:08,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:08,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:03:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:09,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:03:09,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251698231] [2022-12-06 05:03:09,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251698231] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:03:09,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254488886] [2022-12-06 05:03:09,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:09,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:09,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:03:09,345 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:03:09,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-06 05:03:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:09,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:03:09,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:03:09,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:09,589 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-06 05:03:09,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-06 05:03:09,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:09,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:03:09,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:09,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:03:09,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:09,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 28 [2022-12-06 05:03:09,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:09,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:03:09,627 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:03:09,627 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2022-12-06 05:03:09,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:09,730 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-06 05:03:09,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 297 treesize of output 275 [2022-12-06 05:03:09,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:09,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-12-06 05:03:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:09,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:03:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:10,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254488886] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:03:10,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:03:10,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 05:03:10,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698698872] [2022-12-06 05:03:10,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:03:10,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:03:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:03:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:03:10,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=161, Unknown=1, NotChecked=0, Total=210 [2022-12-06 05:03:10,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:03:10,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 638 transitions, 20205 flow. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:03:10,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:03:10,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:03:10,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:03:13,067 INFO L130 PetriNetUnfolder]: 4381/8108 cut-off events. [2022-12-06 05:03:13,067 INFO L131 PetriNetUnfolder]: For 449698/449698 co-relation queries the response was YES. [2022-12-06 05:03:13,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100813 conditions, 8108 events. 4381/8108 cut-off events. For 449698/449698 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 63476 event pairs, 1422 based on Foata normal form. 24/8131 useless extension candidates. Maximal degree in co-relation 99422. Up to 7647 conditions per place. [2022-12-06 05:03:13,276 INFO L137 encePairwiseOnDemand]: 19/51 looper letters, 558 selfloop transitions, 161 changer transitions 33/752 dead transitions. [2022-12-06 05:03:13,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 752 transitions, 24265 flow [2022-12-06 05:03:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:03:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:03:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 140 transitions. [2022-12-06 05:03:13,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19607843137254902 [2022-12-06 05:03:13,278 INFO L175 Difference]: Start difference. First operand has 319 places, 638 transitions, 20205 flow. Second operand 14 states and 140 transitions. [2022-12-06 05:03:13,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 752 transitions, 24265 flow [2022-12-06 05:03:15,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 752 transitions, 23739 flow, removed 242 selfloop flow, removed 2 redundant places. [2022-12-06 05:03:15,342 INFO L231 Difference]: Finished difference. Result has 340 places, 695 transitions, 22242 flow [2022-12-06 05:03:15,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=19811, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=22242, PETRI_PLACES=340, PETRI_TRANSITIONS=695} [2022-12-06 05:03:15,343 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 319 predicate places. [2022-12-06 05:03:15,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:03:15,343 INFO L89 Accepts]: Start accepts. Operand has 340 places, 695 transitions, 22242 flow [2022-12-06 05:03:15,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:03:15,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:03:15,347 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 340 places, 695 transitions, 22242 flow [2022-12-06 05:03:15,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 337 places, 695 transitions, 22242 flow [2022-12-06 05:03:16,368 INFO L130 PetriNetUnfolder]: 1798/4669 cut-off events. [2022-12-06 05:03:16,368 INFO L131 PetriNetUnfolder]: For 256948/257436 co-relation queries the response was YES. [2022-12-06 05:03:16,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55214 conditions, 4669 events. 1798/4669 cut-off events. For 256948/257436 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 47027 event pairs, 698 based on Foata normal form. 218/4500 useless extension candidates. Maximal degree in co-relation 54506. Up to 1733 conditions per place. [2022-12-06 05:03:16,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 337 places, 695 transitions, 22242 flow [2022-12-06 05:03:16,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 2154 [2022-12-06 05:03:33,984 WARN L233 SmtUtils]: Spent 9.22s on a formula simplification. DAG size of input: 242 DAG size of output: 237 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:03:47,137 WARN L233 SmtUtils]: Spent 10.97s on a formula simplification. DAG size of input: 256 DAG size of output: 250 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:03:48,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [566] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_17| 0) (not (= (select (select |v_#memory_int_117| v_~B~0.base_51) (+ (* v_~i_AB~0_57 4) v_~B~0.offset_51)) |v_thread1Thread1of1ForFork1_#t~mem1_32|)) (= |v_thread1Thread1of1ForFork1_#res.base_17| 0)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_32|, ~B~0.base=v_~B~0.base_51, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, ~B~0.offset=v_~B~0.offset_51} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_17|, ~B~0.base=v_~B~0.base_51, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_33|, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_17|, ~B~0.offset=v_~B~0.offset_51} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#res.offset] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:03:48,129 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:03:48,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32787 [2022-12-06 05:03:48,130 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 694 transitions, 22296 flow [2022-12-06 05:03:48,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:03:48,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:03:48,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:03:48,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-06 05:03:48,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:48,331 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:03:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:03:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash 289852127, now seen corresponding path program 1 times [2022-12-06 05:03:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:03:48,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920528191] [2022-12-06 05:03:48,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:48,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:03:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:48,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:03:48,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920528191] [2022-12-06 05:03:48,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920528191] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:03:48,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767450513] [2022-12-06 05:03:48,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:48,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:48,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:03:48,654 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:03:48,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-06 05:03:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:48,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 05:03:48,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:03:48,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:48,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:48,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:48,934 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:03:48,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2022-12-06 05:03:48,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:48,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:03:48,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:48,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 05:03:48,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:03:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:49,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:03:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:49,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767450513] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:03:49,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:03:49,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 05:03:49,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575099577] [2022-12-06 05:03:49,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:03:49,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:03:49,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:03:49,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:03:49,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=215, Unknown=1, NotChecked=0, Total=272 [2022-12-06 05:03:49,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:03:49,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 694 transitions, 22296 flow. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:03:49,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:03:49,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:03:49,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:03:52,707 INFO L130 PetriNetUnfolder]: 4675/8577 cut-off events. [2022-12-06 05:03:52,707 INFO L131 PetriNetUnfolder]: For 471547/471547 co-relation queries the response was YES. [2022-12-06 05:03:52,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106271 conditions, 8577 events. 4675/8577 cut-off events. For 471547/471547 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 66972 event pairs, 1857 based on Foata normal form. 16/8592 useless extension candidates. Maximal degree in co-relation 105185. Up to 7874 conditions per place. [2022-12-06 05:03:52,829 INFO L137 encePairwiseOnDemand]: 27/55 looper letters, 655 selfloop transitions, 140 changer transitions 6/801 dead transitions. [2022-12-06 05:03:52,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 801 transitions, 25739 flow [2022-12-06 05:03:52,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:03:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:03:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 134 transitions. [2022-12-06 05:03:52,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1874125874125874 [2022-12-06 05:03:52,830 INFO L175 Difference]: Start difference. First operand has 336 places, 694 transitions, 22296 flow. Second operand 13 states and 134 transitions. [2022-12-06 05:03:52,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 801 transitions, 25739 flow [2022-12-06 05:03:55,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 801 transitions, 25609 flow, removed 65 selfloop flow, removed 3 redundant places. [2022-12-06 05:03:55,300 INFO L231 Difference]: Finished difference. Result has 353 places, 750 transitions, 23943 flow [2022-12-06 05:03:55,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=21985, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=23943, PETRI_PLACES=353, PETRI_TRANSITIONS=750} [2022-12-06 05:03:55,301 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 332 predicate places. [2022-12-06 05:03:55,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:03:55,301 INFO L89 Accepts]: Start accepts. Operand has 353 places, 750 transitions, 23943 flow [2022-12-06 05:03:55,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:03:55,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:03:55,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 353 places, 750 transitions, 23943 flow [2022-12-06 05:03:55,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 351 places, 750 transitions, 23943 flow [2022-12-06 05:03:56,486 INFO L130 PetriNetUnfolder]: 1966/5015 cut-off events. [2022-12-06 05:03:56,486 INFO L131 PetriNetUnfolder]: For 298832/299450 co-relation queries the response was YES. [2022-12-06 05:03:56,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61513 conditions, 5015 events. 1966/5015 cut-off events. For 298832/299450 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 50601 event pairs, 747 based on Foata normal form. 215/4832 useless extension candidates. Maximal degree in co-relation 61365. Up to 1843 conditions per place. [2022-12-06 05:03:56,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 750 transitions, 23943 flow [2022-12-06 05:03:56,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 2400 [2022-12-06 05:03:56,606 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:03:56,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1305 [2022-12-06 05:03:56,607 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 750 transitions, 23943 flow [2022-12-06 05:03:56,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:03:56,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:03:56,607 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:03:56,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-06 05:03:56,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-06 05:03:56,813 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:03:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:03:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1508831009, now seen corresponding path program 1 times [2022-12-06 05:03:56,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:03:56,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093463880] [2022-12-06 05:03:56,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:56,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:03:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:03:57,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093463880] [2022-12-06 05:03:57,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093463880] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:03:57,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406200302] [2022-12-06 05:03:57,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:57,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:57,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:03:57,304 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:03:57,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-06 05:03:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:57,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 05:03:57,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:03:57,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:57,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:57,573 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-06 05:03:57,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 104 [2022-12-06 05:03:57,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:57,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:03:57,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:57,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:03:57,600 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:03:57,600 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2022-12-06 05:03:57,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:57,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 28 [2022-12-06 05:03:57,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:57,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:03:57,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:57,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:57,835 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-06 05:03:57,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 224 treesize of output 202 [2022-12-06 05:03:57,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:03:57,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-12-06 05:03:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:57,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:03:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:57,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406200302] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:03:57,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:03:57,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 05:03:57,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113528838] [2022-12-06 05:03:57,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:03:57,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:03:57,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:03:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:03:57,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=218, Unknown=3, NotChecked=0, Total=272 [2022-12-06 05:03:57,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 05:03:57,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 750 transitions, 23943 flow. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:03:57,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:03:57,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 05:03:57,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:03:58,665 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~i_AB~0 4))) (let ((.cse0 (forall ((v_ArrVal_3811 (Array Int Int))) (not (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811)) (.cse4 (* c_~i_BA~0 4))) (= (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4 4)) (select (select .cse3 c_~B~0.base) (+ .cse4 4 c_~B~0.offset))))))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse2)))) (and (or .cse0 (= |c_thread1Thread1of1ForFork1_#t~mem1| .cse1)) (or .cse0 (= .cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2))))))) is different from false [2022-12-06 05:04:02,152 INFO L130 PetriNetUnfolder]: 4934/9070 cut-off events. [2022-12-06 05:04:02,153 INFO L131 PetriNetUnfolder]: For 538229/538229 co-relation queries the response was YES. [2022-12-06 05:04:02,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115795 conditions, 9070 events. 4934/9070 cut-off events. For 538229/538229 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 71565 event pairs, 1820 based on Foata normal form. 4/9073 useless extension candidates. Maximal degree in co-relation 115611. Up to 8438 conditions per place. [2022-12-06 05:04:02,322 INFO L137 encePairwiseOnDemand]: 15/54 looper letters, 676 selfloop transitions, 167 changer transitions 25/868 dead transitions. [2022-12-06 05:04:02,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 868 transitions, 28375 flow [2022-12-06 05:04:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:04:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:04:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 132 transitions. [2022-12-06 05:04:02,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1746031746031746 [2022-12-06 05:04:02,323 INFO L175 Difference]: Start difference. First operand has 351 places, 750 transitions, 23943 flow. Second operand 14 states and 132 transitions. [2022-12-06 05:04:02,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 868 transitions, 28375 flow [2022-12-06 05:04:05,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 868 transitions, 27809 flow, removed 249 selfloop flow, removed 5 redundant places. [2022-12-06 05:04:05,460 INFO L231 Difference]: Finished difference. Result has 367 places, 813 transitions, 26012 flow [2022-12-06 05:04:05,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=23436, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=26012, PETRI_PLACES=367, PETRI_TRANSITIONS=813} [2022-12-06 05:04:05,462 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 346 predicate places. [2022-12-06 05:04:05,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:05,462 INFO L89 Accepts]: Start accepts. Operand has 367 places, 813 transitions, 26012 flow [2022-12-06 05:04:05,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:05,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:05,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 367 places, 813 transitions, 26012 flow [2022-12-06 05:04:05,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 365 places, 813 transitions, 26012 flow [2022-12-06 05:04:07,178 INFO L130 PetriNetUnfolder]: 2180/5460 cut-off events. [2022-12-06 05:04:07,179 INFO L131 PetriNetUnfolder]: For 337191/338250 co-relation queries the response was YES. [2022-12-06 05:04:07,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68138 conditions, 5460 events. 2180/5460 cut-off events. For 337191/338250 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 55056 event pairs, 758 based on Foata normal form. 205/5268 useless extension candidates. Maximal degree in co-relation 67890. Up to 2000 conditions per place. [2022-12-06 05:04:07,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 365 places, 813 transitions, 26012 flow [2022-12-06 05:04:07,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 2456 [2022-12-06 05:04:07,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:04:21,129 WARN L233 SmtUtils]: Spent 9.39s on a formula simplification. DAG size of input: 235 DAG size of output: 230 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:04:27,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [586] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_163| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)) (select (select |v_#memory_int_163| v_~B~0.base_71) (+ .cse0 v_~B~0.offset_71)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_71, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_163|, ~B~0.offset=v_~B~0.offset_71, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_71, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_63|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_49|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_163|, ~B~0.offset=v_~B~0.offset_71, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:04:27,939 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [586] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_163| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)) (select (select |v_#memory_int_163| v_~B~0.base_71) (+ .cse0 v_~B~0.offset_71)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_71, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_163|, ~B~0.offset=v_~B~0.offset_71, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_71, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_63|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_49|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_163|, ~B~0.offset=v_~B~0.offset_71, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 05:04:28,030 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:04:28,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22568 [2022-12-06 05:04:28,031 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 811 transitions, 26239 flow [2022-12-06 05:04:28,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:28,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:28,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:28,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-06 05:04:28,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-06 05:04:28,231 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash -415411716, now seen corresponding path program 1 times [2022-12-06 05:04:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:28,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853170468] [2022-12-06 05:04:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:04:28,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:28,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853170468] [2022-12-06 05:04:28,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853170468] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:28,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899265635] [2022-12-06 05:04:28,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:28,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:28,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:28,321 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:04:28,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-06 05:04:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:28,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:04:28,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:04:28,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:04:28,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899265635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:28,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:04:28,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 05:04:28,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245247729] [2022-12-06 05:04:28,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:28,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:28,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:28,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:04:28,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:04:28,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 811 transitions, 26239 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:28,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:28,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:04:28,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:31,995 INFO L130 PetriNetUnfolder]: 4883/9006 cut-off events. [2022-12-06 05:04:31,995 INFO L131 PetriNetUnfolder]: For 555741/555741 co-relation queries the response was YES. [2022-12-06 05:04:32,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117019 conditions, 9006 events. 4883/9006 cut-off events. For 555741/555741 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 71201 event pairs, 2342 based on Foata normal form. 40/9045 useless extension candidates. Maximal degree in co-relation 116484. Up to 8711 conditions per place. [2022-12-06 05:04:32,250 INFO L137 encePairwiseOnDemand]: 53/61 looper letters, 778 selfloop transitions, 0 changer transitions 57/835 dead transitions. [2022-12-06 05:04:32,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 835 transitions, 28367 flow [2022-12-06 05:04:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-06 05:04:32,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3442622950819672 [2022-12-06 05:04:32,251 INFO L175 Difference]: Start difference. First operand has 363 places, 811 transitions, 26239 flow. Second operand 4 states and 84 transitions. [2022-12-06 05:04:32,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 835 transitions, 28367 flow [2022-12-06 05:04:35,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 835 transitions, 28131 flow, removed 118 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:35,242 INFO L231 Difference]: Finished difference. Result has 367 places, 778 transitions, 24823 flow [2022-12-06 05:04:35,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=25600, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=24823, PETRI_PLACES=367, PETRI_TRANSITIONS=778} [2022-12-06 05:04:35,243 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 346 predicate places. [2022-12-06 05:04:35,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:35,243 INFO L89 Accepts]: Start accepts. Operand has 367 places, 778 transitions, 24823 flow [2022-12-06 05:04:35,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:35,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:35,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 367 places, 778 transitions, 24823 flow [2022-12-06 05:04:35,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 362 places, 778 transitions, 24823 flow [2022-12-06 05:04:36,455 INFO L130 PetriNetUnfolder]: 2077/5221 cut-off events. [2022-12-06 05:04:36,455 INFO L131 PetriNetUnfolder]: For 323266/324351 co-relation queries the response was YES. [2022-12-06 05:04:36,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64916 conditions, 5221 events. 2077/5221 cut-off events. For 323266/324351 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 52541 event pairs, 780 based on Foata normal form. 236/5043 useless extension candidates. Maximal degree in co-relation 64761. Up to 1902 conditions per place. [2022-12-06 05:04:36,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 362 places, 778 transitions, 24823 flow [2022-12-06 05:04:36,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 2390 [2022-12-06 05:04:36,565 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:36,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1322 [2022-12-06 05:04:36,565 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 778 transitions, 24823 flow [2022-12-06 05:04:36,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:36,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:36,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:36,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-06 05:04:36,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-12-06 05:04:36,771 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1453995, now seen corresponding path program 1 times [2022-12-06 05:04:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:36,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759573752] [2022-12-06 05:04:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:37,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:37,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759573752] [2022-12-06 05:04:37,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759573752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:37,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993022883] [2022-12-06 05:04:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:37,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:37,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:37,126 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:04:37,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-06 05:04:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:37,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 05:04:37,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:37,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:04:37,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:04:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:37,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:37,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:04:37,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 37 [2022-12-06 05:04:37,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-12-06 05:04:37,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:04:37,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 37 [2022-12-06 05:04:37,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-12-06 05:04:37,690 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-06 05:04:37,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 164 [2022-12-06 05:04:37,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:04:37,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 96 [2022-12-06 05:04:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:37,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993022883] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:04:37,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:04:37,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:04:37,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208635523] [2022-12-06 05:04:37,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:04:37,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:04:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:37,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:04:37,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:04:37,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:04:37,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 778 transitions, 24823 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:37,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:37,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:04:37,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:42,131 INFO L130 PetriNetUnfolder]: 5004/9142 cut-off events. [2022-12-06 05:04:42,131 INFO L131 PetriNetUnfolder]: For 562259/562259 co-relation queries the response was YES. [2022-12-06 05:04:42,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118191 conditions, 9142 events. 5004/9142 cut-off events. For 562259/562259 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 72092 event pairs, 1684 based on Foata normal form. 36/9177 useless extension candidates. Maximal degree in co-relation 118034. Up to 7907 conditions per place. [2022-12-06 05:04:42,276 INFO L137 encePairwiseOnDemand]: 27/58 looper letters, 667 selfloop transitions, 195 changer transitions 0/862 dead transitions. [2022-12-06 05:04:42,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 862 transitions, 28190 flow [2022-12-06 05:04:42,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:04:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:04:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2022-12-06 05:04:42,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1867816091954023 [2022-12-06 05:04:42,277 INFO L175 Difference]: Start difference. First operand has 362 places, 778 transitions, 24823 flow. Second operand 12 states and 130 transitions. [2022-12-06 05:04:42,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 862 transitions, 28190 flow [2022-12-06 05:04:45,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 862 transitions, 28075 flow, removed 36 selfloop flow, removed 5 redundant places. [2022-12-06 05:04:45,295 INFO L231 Difference]: Finished difference. Result has 373 places, 803 transitions, 26013 flow [2022-12-06 05:04:45,296 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=24718, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26013, PETRI_PLACES=373, PETRI_TRANSITIONS=803} [2022-12-06 05:04:45,296 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 352 predicate places. [2022-12-06 05:04:45,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:45,296 INFO L89 Accepts]: Start accepts. Operand has 373 places, 803 transitions, 26013 flow [2022-12-06 05:04:45,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:45,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:45,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 373 places, 803 transitions, 26013 flow [2022-12-06 05:04:45,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 373 places, 803 transitions, 26013 flow [2022-12-06 05:04:46,610 INFO L130 PetriNetUnfolder]: 2155/5432 cut-off events. [2022-12-06 05:04:46,610 INFO L131 PetriNetUnfolder]: For 349413/350582 co-relation queries the response was YES. [2022-12-06 05:04:46,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68354 conditions, 5432 events. 2155/5432 cut-off events. For 349413/350582 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 55175 event pairs, 800 based on Foata normal form. 247/5258 useless extension candidates. Maximal degree in co-relation 67511. Up to 1945 conditions per place. [2022-12-06 05:04:46,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 373 places, 803 transitions, 26013 flow [2022-12-06 05:04:46,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 2532 [2022-12-06 05:04:46,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L47-5-->L80-3: Formula: (let ((.cse0 (select |v_#memory_int_604| v_~A~0.base_282))) (and (= (+ |v_#pthreadsForks_242| 1) |v_#pthreadsForks_241|) (= (+ v_~i_AB~0_380 1) v_~i_AB~0_379) (< v_~i_AB~0_379 v_~An~0_230) (let ((.cse1 (* v_~i_AB~0_380 4))) (= (select .cse0 (+ v_~A~0.offset_282 .cse1)) (select (select |v_#memory_int_604| v_~B~0.base_267) (+ v_~B~0.offset_267 .cse1)))) (= (store |v_#memory_int_604| |v_ULTIMATE.start_main_~#t2~0#1.base_155| (store (select |v_#memory_int_604| |v_ULTIMATE.start_main_~#t2~0#1.base_155|) |v_ULTIMATE.start_main_~#t2~0#1.offset_155| |v_ULTIMATE.start_main_#t~pre13#1_235|)) |v_#memory_int_603|) (= |v_ULTIMATE.start_main_#t~pre13#1_235| |v_#pthreadsForks_242|) (< v_~i_AB~0_379 v_~Bn~0_250) (= |v_thread1Thread1of1ForFork1_#t~mem1_302| (select .cse0 (+ (* v_~i_AB~0_379 4) v_~A~0.offset_282))))) InVars {~A~0.base=v_~A~0.base_282, ~A~0.offset=v_~A~0.offset_282, ~B~0.base=v_~B~0.base_267, #pthreadsForks=|v_#pthreadsForks_242|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_155|, ~i_AB~0=v_~i_AB~0_380, #memory_int=|v_#memory_int_604|, ~Bn~0=v_~Bn~0_250, ~B~0.offset=v_~B~0.offset_267, ~An~0=v_~An~0_230, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_155|} OutVars{~A~0.base=v_~A~0.base_282, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_235|, ~B~0.base=v_~B~0.base_267, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_243|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_155|, ~i_AB~0=v_~i_AB~0_379, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_163|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_183|, ~An~0=v_~An~0_230, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_302|, ~A~0.offset=v_~A~0.offset_282, #pthreadsForks=|v_#pthreadsForks_241|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_212|, #memory_int=|v_#memory_int_603|, ~Bn~0=v_~Bn~0_250, ~B~0.offset=v_~B~0.offset_267, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_155|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork1_#t~mem1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:04:46,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:04:46,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1503 [2022-12-06 05:04:46,799 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 803 transitions, 26056 flow [2022-12-06 05:04:46,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:46,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:46,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:46,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-06 05:04:47,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:47,005 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1823697813, now seen corresponding path program 2 times [2022-12-06 05:04:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:47,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351324677] [2022-12-06 05:04:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:47,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:47,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351324677] [2022-12-06 05:04:47,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351324677] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:47,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607942628] [2022-12-06 05:04:47,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:04:47,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:47,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:47,422 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:04:47,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-06 05:04:47,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:04:47,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:04:47,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 05:04:47,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:47,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:04:47,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:04:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:47,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:47,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:04:47,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 37 [2022-12-06 05:04:47,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-12-06 05:04:47,981 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-06 05:04:47,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 164 [2022-12-06 05:04:47,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:04:47,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 96 [2022-12-06 05:04:48,194 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:04:48,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 25 [2022-12-06 05:04:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:48,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607942628] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:04:48,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:04:48,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:04:48,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171106681] [2022-12-06 05:04:48,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:04:48,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:04:48,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:48,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:04:48,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:04:48,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 05:04:48,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 803 transitions, 26056 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:48,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:48,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 05:04:48,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:52,386 INFO L130 PetriNetUnfolder]: 5079/9313 cut-off events. [2022-12-06 05:04:52,386 INFO L131 PetriNetUnfolder]: For 606581/606581 co-relation queries the response was YES. [2022-12-06 05:04:52,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122473 conditions, 9313 events. 5079/9313 cut-off events. For 606581/606581 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 74158 event pairs, 1995 based on Foata normal form. 43/9355 useless extension candidates. Maximal degree in co-relation 121320. Up to 8161 conditions per place. [2022-12-06 05:04:52,530 INFO L137 encePairwiseOnDemand]: 24/59 looper letters, 661 selfloop transitions, 208 changer transitions 0/869 dead transitions. [2022-12-06 05:04:52,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 869 transitions, 29008 flow [2022-12-06 05:04:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:04:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:04:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 127 transitions. [2022-12-06 05:04:52,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16558018252933507 [2022-12-06 05:04:52,531 INFO L175 Difference]: Start difference. First operand has 373 places, 803 transitions, 26056 flow. Second operand 13 states and 127 transitions. [2022-12-06 05:04:52,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 869 transitions, 29008 flow [2022-12-06 05:04:55,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 869 transitions, 28745 flow, removed 45 selfloop flow, removed 4 redundant places. [2022-12-06 05:04:55,521 INFO L231 Difference]: Finished difference. Result has 385 places, 816 transitions, 26750 flow [2022-12-06 05:04:55,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=25793, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=26750, PETRI_PLACES=385, PETRI_TRANSITIONS=816} [2022-12-06 05:04:55,522 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 364 predicate places. [2022-12-06 05:04:55,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:55,522 INFO L89 Accepts]: Start accepts. Operand has 385 places, 816 transitions, 26750 flow [2022-12-06 05:04:55,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:55,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:55,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 385 places, 816 transitions, 26750 flow [2022-12-06 05:04:55,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 816 transitions, 26750 flow [2022-12-06 05:04:56,973 INFO L130 PetriNetUnfolder]: 2238/5596 cut-off events. [2022-12-06 05:04:56,973 INFO L131 PetriNetUnfolder]: For 378193/379474 co-relation queries the response was YES. [2022-12-06 05:04:57,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71361 conditions, 5596 events. 2238/5596 cut-off events. For 378193/379474 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 56799 event pairs, 816 based on Foata normal form. 225/5379 useless extension candidates. Maximal degree in co-relation 70511. Up to 2000 conditions per place. [2022-12-06 05:04:57,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 385 places, 816 transitions, 26750 flow [2022-12-06 05:04:57,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 2578 [2022-12-06 05:04:57,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:04:57,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [641] L47-1-->L59-5: Formula: (let ((.cse0 (select |v_#memory_int_450| v_~B~0.base_197))) (and (= (+ v_~i_BA~0_245 1) v_~i_BA~0_244) (= (select .cse0 (+ (* v_~i_AB~0_272 4) v_~B~0.offset_197)) |v_thread1Thread1of1ForFork1_#t~mem1_220|) (let ((.cse1 (* 4 v_~i_BA~0_245))) (= (select (select |v_#memory_int_450| v_~A~0.base_208) (+ .cse1 v_~A~0.offset_208)) (select .cse0 (+ .cse1 v_~B~0.offset_197)))) (= v_~i_AB~0_271 (+ v_~i_AB~0_272 1)) (< v_~i_BA~0_245 v_~An~0_176) (< v_~i_BA~0_245 v_~Bn~0_196))) InVars {~A~0.base=v_~A~0.base_208, ~A~0.offset=v_~A~0.offset_208, ~B~0.base=v_~B~0.base_197, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_220|, #memory_int=|v_#memory_int_450|, ~i_AB~0=v_~i_AB~0_272, ~i_BA~0=v_~i_BA~0_245, ~B~0.offset=v_~B~0.offset_197, ~Bn~0=v_~Bn~0_196, ~An~0=v_~An~0_176} OutVars{~A~0.base=v_~A~0.base_208, ~B~0.base=v_~B~0.base_197, ~i_AB~0=v_~i_AB~0_271, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_114|, ~An~0=v_~An~0_176, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_112|, ~A~0.offset=v_~A~0.offset_208, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_155|, #memory_int=|v_#memory_int_450|, ~i_BA~0=v_~i_BA~0_244, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_163|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_165|, ~B~0.offset=v_~B~0.offset_197, ~Bn~0=v_~Bn~0_196} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-06 05:04:57,277 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:04:57,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1756 [2022-12-06 05:04:57,278 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 815 transitions, 26777 flow [2022-12-06 05:04:57,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:57,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:57,278 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:57,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-06 05:04:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-12-06 05:04:57,484 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -856465940, now seen corresponding path program 1 times [2022-12-06 05:04:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:57,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830396264] [2022-12-06 05:04:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:57,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:57,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830396264] [2022-12-06 05:04:57,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830396264] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:57,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808233057] [2022-12-06 05:04:57,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:57,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:57,988 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:04:57,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-06 05:04:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:58,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 05:04:58,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:58,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:04:58,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:04:58,350 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 05:04:58,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2022-12-06 05:04:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:58,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:58,561 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-06 05:04:58,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 159 [2022-12-06 05:04:58,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:04:58,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 62 [2022-12-06 05:04:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:58,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808233057] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:04:58,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:04:58,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 05:04:58,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272196010] [2022-12-06 05:04:58,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:04:58,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:04:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:04:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=166, Unknown=3, NotChecked=0, Total=210 [2022-12-06 05:04:58,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:04:58,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 815 transitions, 26777 flow. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:58,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:58,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:04:58,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:03,179 INFO L130 PetriNetUnfolder]: 5133/9411 cut-off events. [2022-12-06 05:05:03,179 INFO L131 PetriNetUnfolder]: For 638840/638840 co-relation queries the response was YES. [2022-12-06 05:05:03,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124815 conditions, 9411 events. 5133/9411 cut-off events. For 638840/638840 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 74636 event pairs, 1895 based on Foata normal form. 43/9453 useless extension candidates. Maximal degree in co-relation 123651. Up to 8988 conditions per place. [2022-12-06 05:05:03,323 INFO L137 encePairwiseOnDemand]: 29/61 looper letters, 752 selfloop transitions, 125 changer transitions 0/877 dead transitions. [2022-12-06 05:05:03,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 877 transitions, 29511 flow [2022-12-06 05:05:03,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:05:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:05:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2022-12-06 05:05:03,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17528373266078184 [2022-12-06 05:05:03,325 INFO L175 Difference]: Start difference. First operand has 384 places, 815 transitions, 26777 flow. Second operand 13 states and 139 transitions. [2022-12-06 05:05:03,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 877 transitions, 29511 flow [2022-12-06 05:05:06,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 877 transitions, 29014 flow, removed 67 selfloop flow, removed 7 redundant places. [2022-12-06 05:05:06,344 INFO L231 Difference]: Finished difference. Result has 394 places, 831 transitions, 27077 flow [2022-12-06 05:05:06,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=26264, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=27077, PETRI_PLACES=394, PETRI_TRANSITIONS=831} [2022-12-06 05:05:06,345 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 373 predicate places. [2022-12-06 05:05:06,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:06,345 INFO L89 Accepts]: Start accepts. Operand has 394 places, 831 transitions, 27077 flow [2022-12-06 05:05:06,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:06,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:06,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 394 places, 831 transitions, 27077 flow [2022-12-06 05:05:06,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 394 places, 831 transitions, 27077 flow [2022-12-06 05:05:07,793 INFO L130 PetriNetUnfolder]: 2210/5619 cut-off events. [2022-12-06 05:05:07,793 INFO L131 PetriNetUnfolder]: For 414169/415439 co-relation queries the response was YES. [2022-12-06 05:05:07,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73009 conditions, 5619 events. 2210/5619 cut-off events. For 414169/415439 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 57505 event pairs, 802 based on Foata normal form. 224/5431 useless extension candidates. Maximal degree in co-relation 72137. Up to 1965 conditions per place. [2022-12-06 05:05:07,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 394 places, 831 transitions, 27077 flow [2022-12-06 05:05:07,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 2644 [2022-12-06 05:05:07,940 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:07,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1595 [2022-12-06 05:05:07,940 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 831 transitions, 27077 flow [2022-12-06 05:05:07,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:07,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:07,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:07,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-12-06 05:05:08,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:08,146 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:08,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash 49942847, now seen corresponding path program 3 times [2022-12-06 05:05:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:08,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681809467] [2022-12-06 05:05:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:08,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:08,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681809467] [2022-12-06 05:05:08,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681809467] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:08,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869811048] [2022-12-06 05:05:08,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:05:08,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:08,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:08,602 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:08,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-06 05:05:08,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 05:05:08,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:05:08,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 05:05:08,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:08,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:08,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:08,907 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-06 05:05:08,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 104 [2022-12-06 05:05:08,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:08,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:05:08,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:08,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:05:08,951 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:08,955 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2022-12-06 05:05:08,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:08,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:08,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 33 [2022-12-06 05:05:08,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:08,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:05:09,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:09,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:05:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:09,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:09,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869811048] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:09,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:09,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:05:09,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622958646] [2022-12-06 05:05:09,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:09,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:05:09,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:09,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:05:09,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=138, Unknown=3, NotChecked=0, Total=182 [2022-12-06 05:05:09,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:05:09,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 831 transitions, 27077 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:09,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:09,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:05:09,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:09,551 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~A~0.base)) (.cse14 (* c_~i_AB~0 4))) (let ((.cse0 (select .cse6 (+ c_~A~0.offset 4 .cse14))) (.cse2 (+ 4 c_~B~0.offset .cse14)) (.cse13 (+ c_~i_BA~0 1)) (.cse8 (select |c_#memory_int| c_~B~0.base)) (.cse7 (* c_~i_BA~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse7 4)) (.cse3 (+ .cse7 4 c_~B~0.offset)) (.cse9 (not (= |c_thread1Thread1of1ForFork1_#t~mem1| (select .cse8 (+ c_~B~0.offset .cse14))))) (.cse10 (< .cse13 c_~An~0)) (.cse11 (< .cse13 c_~Bn~0)) (.cse12 (forall ((v_ArrVal_4369 (Array Int Int))) (not (= .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) c_~B~0.base) .cse2)))))) (and (forall ((v_ArrVal_4369 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369))) (let ((.cse1 (select .cse4 c_~B~0.base))) (or (not (= .cse0 (select .cse1 .cse2))) (= (select .cse1 .cse3) (select (select .cse4 c_~A~0.base) .cse5)))))) (or (and (< c_~i_BA~0 c_~An~0) (< c_~i_BA~0 c_~Bn~0) (= (select .cse6 (+ c_~A~0.offset .cse7)) (select .cse8 (+ .cse7 c_~B~0.offset)))) .cse9) (or (and .cse10 .cse11 (= (select .cse6 .cse5) (select .cse8 .cse3))) .cse9) (or .cse10 .cse12) (or .cse11 .cse12))))) is different from false [2022-12-06 05:05:13,532 INFO L130 PetriNetUnfolder]: 5118/9347 cut-off events. [2022-12-06 05:05:13,533 INFO L131 PetriNetUnfolder]: For 666697/666697 co-relation queries the response was YES. [2022-12-06 05:05:13,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126558 conditions, 9347 events. 5118/9347 cut-off events. For 666697/666697 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 73482 event pairs, 2368 based on Foata normal form. 2/9348 useless extension candidates. Maximal degree in co-relation 125364. Up to 9277 conditions per place. [2022-12-06 05:05:13,680 INFO L137 encePairwiseOnDemand]: 31/61 looper letters, 774 selfloop transitions, 80 changer transitions 3/857 dead transitions. [2022-12-06 05:05:13,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 857 transitions, 29141 flow [2022-12-06 05:05:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:05:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:05:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-12-06 05:05:13,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13524590163934427 [2022-12-06 05:05:13,682 INFO L175 Difference]: Start difference. First operand has 394 places, 831 transitions, 27077 flow. Second operand 12 states and 99 transitions. [2022-12-06 05:05:13,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 857 transitions, 29141 flow [2022-12-06 05:05:17,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 857 transitions, 28880 flow, removed 108 selfloop flow, removed 4 redundant places. [2022-12-06 05:05:17,086 INFO L231 Difference]: Finished difference. Result has 406 places, 842 transitions, 27312 flow [2022-12-06 05:05:17,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=26782, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=27312, PETRI_PLACES=406, PETRI_TRANSITIONS=842} [2022-12-06 05:05:17,087 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 385 predicate places. [2022-12-06 05:05:17,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:17,087 INFO L89 Accepts]: Start accepts. Operand has 406 places, 842 transitions, 27312 flow [2022-12-06 05:05:17,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:17,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:17,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 406 places, 842 transitions, 27312 flow [2022-12-06 05:05:17,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 842 transitions, 27312 flow [2022-12-06 05:05:18,528 INFO L130 PetriNetUnfolder]: 2242/5629 cut-off events. [2022-12-06 05:05:18,528 INFO L131 PetriNetUnfolder]: For 420439/421602 co-relation queries the response was YES. [2022-12-06 05:05:18,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74067 conditions, 5629 events. 2242/5629 cut-off events. For 420439/421602 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 56929 event pairs, 810 based on Foata normal form. 198/5427 useless extension candidates. Maximal degree in co-relation 73180. Up to 1960 conditions per place. [2022-12-06 05:05:18,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 405 places, 842 transitions, 27312 flow [2022-12-06 05:05:18,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 2644 [2022-12-06 05:05:18,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [566] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_17| 0) (not (= (select (select |v_#memory_int_117| v_~B~0.base_51) (+ (* v_~i_AB~0_57 4) v_~B~0.offset_51)) |v_thread1Thread1of1ForFork1_#t~mem1_32|)) (= |v_thread1Thread1of1ForFork1_#res.base_17| 0)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_32|, ~B~0.base=v_~B~0.base_51, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, ~B~0.offset=v_~B~0.offset_51} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_17|, ~B~0.base=v_~B~0.base_51, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_33|, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_17|, ~B~0.offset=v_~B~0.offset_51} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:05:18,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:05:19,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:05:19,057 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:05:19,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1971 [2022-12-06 05:05:19,058 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 841 transitions, 27394 flow [2022-12-06 05:05:19,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:19,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:19,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:19,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:19,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:19,265 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:19,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash 909367432, now seen corresponding path program 1 times [2022-12-06 05:05:19,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:19,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058718975] [2022-12-06 05:05:19,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:19,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:19,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:19,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058718975] [2022-12-06 05:05:19,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058718975] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:19,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606525375] [2022-12-06 05:05:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:19,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:19,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:19,328 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:19,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-06 05:05:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:19,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:05:19,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:19,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:05:19,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606525375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:19,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:19,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2022-12-06 05:05:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125780298] [2022-12-06 05:05:19,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:19,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:05:19,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:19,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:05:19,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:05:19,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 05:05:19,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 841 transitions, 27394 flow. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:19,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:19,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 05:05:19,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:23,509 INFO L130 PetriNetUnfolder]: 5138/9389 cut-off events. [2022-12-06 05:05:23,510 INFO L131 PetriNetUnfolder]: For 677534/677534 co-relation queries the response was YES. [2022-12-06 05:05:23,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127692 conditions, 9389 events. 5138/9389 cut-off events. For 677534/677534 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 73919 event pairs, 830 based on Foata normal form. 1/9388 useless extension candidates. Maximal degree in co-relation 126483. Up to 6679 conditions per place. [2022-12-06 05:05:23,664 INFO L137 encePairwiseOnDemand]: 27/66 looper letters, 502 selfloop transitions, 373 changer transitions 5/880 dead transitions. [2022-12-06 05:05:23,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 880 transitions, 29831 flow [2022-12-06 05:05:23,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:05:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:05:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-06 05:05:23,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23593073593073594 [2022-12-06 05:05:23,665 INFO L175 Difference]: Start difference. First operand has 404 places, 841 transitions, 27394 flow. Second operand 7 states and 109 transitions. [2022-12-06 05:05:23,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 880 transitions, 29831 flow [2022-12-06 05:05:27,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 880 transitions, 29582 flow, removed 111 selfloop flow, removed 4 redundant places. [2022-12-06 05:05:27,246 INFO L231 Difference]: Finished difference. Result has 407 places, 842 transitions, 27926 flow [2022-12-06 05:05:27,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=27159, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=371, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=27926, PETRI_PLACES=407, PETRI_TRANSITIONS=842} [2022-12-06 05:05:27,247 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 386 predicate places. [2022-12-06 05:05:27,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:27,247 INFO L89 Accepts]: Start accepts. Operand has 407 places, 842 transitions, 27926 flow [2022-12-06 05:05:27,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:27,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:27,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 407 places, 842 transitions, 27926 flow [2022-12-06 05:05:27,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 406 places, 842 transitions, 27926 flow [2022-12-06 05:05:28,712 INFO L130 PetriNetUnfolder]: 2238/5646 cut-off events. [2022-12-06 05:05:28,712 INFO L131 PetriNetUnfolder]: For 432116/433284 co-relation queries the response was YES. [2022-12-06 05:05:28,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75022 conditions, 5646 events. 2238/5646 cut-off events. For 432116/433284 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 57569 event pairs, 808 based on Foata normal form. 208/5457 useless extension candidates. Maximal degree in co-relation 74122. Up to 1976 conditions per place. [2022-12-06 05:05:28,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 406 places, 842 transitions, 27926 flow [2022-12-06 05:05:28,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 2656 [2022-12-06 05:05:28,866 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:28,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1620 [2022-12-06 05:05:28,867 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 842 transitions, 27926 flow [2022-12-06 05:05:28,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:28,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:28,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:28,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:29,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:29,073 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:29,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash -4275642, now seen corresponding path program 1 times [2022-12-06 05:05:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:29,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680896859] [2022-12-06 05:05:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:29,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:29,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680896859] [2022-12-06 05:05:29,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680896859] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:29,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118419933] [2022-12-06 05:05:29,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:29,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:29,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:29,501 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:29,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-06 05:05:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:29,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 05:05:29,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:29,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:29,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:05:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:29,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:29,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:29,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 181 [2022-12-06 05:05:29,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:29,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 90 [2022-12-06 05:05:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:30,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118419933] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:30,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:30,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 05:05:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800837843] [2022-12-06 05:05:30,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:30,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:05:30,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:30,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:05:30,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:05:30,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 05:05:30,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 842 transitions, 27926 flow. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:30,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:30,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 05:05:30,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:34,620 INFO L130 PetriNetUnfolder]: 5182/9470 cut-off events. [2022-12-06 05:05:34,621 INFO L131 PetriNetUnfolder]: For 704878/704878 co-relation queries the response was YES. [2022-12-06 05:05:34,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130351 conditions, 9470 events. 5182/9470 cut-off events. For 704878/704878 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 75004 event pairs, 2066 based on Foata normal form. 8/9476 useless extension candidates. Maximal degree in co-relation 129758. Up to 9043 conditions per place. [2022-12-06 05:05:34,762 INFO L137 encePairwiseOnDemand]: 27/66 looper letters, 727 selfloop transitions, 150 changer transitions 3/880 dead transitions. [2022-12-06 05:05:34,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 880 transitions, 30515 flow [2022-12-06 05:05:34,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:05:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:05:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-12-06 05:05:34,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20075757575757575 [2022-12-06 05:05:34,763 INFO L175 Difference]: Start difference. First operand has 406 places, 842 transitions, 27926 flow. Second operand 8 states and 106 transitions. [2022-12-06 05:05:34,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 880 transitions, 30515 flow [2022-12-06 05:05:38,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 880 transitions, 29972 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-06 05:05:38,523 INFO L231 Difference]: Finished difference. Result has 410 places, 852 transitions, 28217 flow [2022-12-06 05:05:38,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=27390, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=28217, PETRI_PLACES=410, PETRI_TRANSITIONS=852} [2022-12-06 05:05:38,524 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 389 predicate places. [2022-12-06 05:05:38,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:38,524 INFO L89 Accepts]: Start accepts. Operand has 410 places, 852 transitions, 28217 flow [2022-12-06 05:05:38,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:38,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:38,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 410 places, 852 transitions, 28217 flow [2022-12-06 05:05:38,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 852 transitions, 28217 flow [2022-12-06 05:05:39,937 INFO L130 PetriNetUnfolder]: 2262/5705 cut-off events. [2022-12-06 05:05:39,938 INFO L131 PetriNetUnfolder]: For 441943/443143 co-relation queries the response was YES. [2022-12-06 05:05:40,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76093 conditions, 5705 events. 2262/5705 cut-off events. For 441943/443143 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 58187 event pairs, 802 based on Foata normal form. 200/5495 useless extension candidates. Maximal degree in co-relation 75195. Up to 2009 conditions per place. [2022-12-06 05:05:40,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 410 places, 852 transitions, 28217 flow [2022-12-06 05:05:40,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 2686 [2022-12-06 05:05:40,087 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:40,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1644 [2022-12-06 05:05:40,168 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 852 transitions, 28217 flow [2022-12-06 05:05:40,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:40,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:40,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:40,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-12-06 05:05:40,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:40,369 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1176548145, now seen corresponding path program 1 times [2022-12-06 05:05:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:40,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058374994] [2022-12-06 05:05:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:40,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:40,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058374994] [2022-12-06 05:05:40,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058374994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:40,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385475428] [2022-12-06 05:05:40,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:40,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:40,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:40,699 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:40,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-06 05:05:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:40,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 05:05:40,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:41,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:41,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:05:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:41,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:41,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:41,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 181 [2022-12-06 05:05:41,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:41,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 90 [2022-12-06 05:05:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:41,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385475428] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:41,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:41,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:05:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794383068] [2022-12-06 05:05:41,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:41,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:05:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:41,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:05:41,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:05:41,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 05:05:41,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 852 transitions, 28217 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:41,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:41,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 05:05:41,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:45,887 INFO L130 PetriNetUnfolder]: 5178/9466 cut-off events. [2022-12-06 05:05:45,887 INFO L131 PetriNetUnfolder]: For 713783/713783 co-relation queries the response was YES. [2022-12-06 05:05:45,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130572 conditions, 9466 events. 5178/9466 cut-off events. For 713783/713783 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 74864 event pairs, 2291 based on Foata normal form. 4/9468 useless extension candidates. Maximal degree in co-relation 129352. Up to 9132 conditions per place. [2022-12-06 05:05:46,041 INFO L137 encePairwiseOnDemand]: 28/66 looper letters, 727 selfloop transitions, 140 changer transitions 8/875 dead transitions. [2022-12-06 05:05:46,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 875 transitions, 30214 flow [2022-12-06 05:05:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:05:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:05:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-12-06 05:05:46,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22294372294372294 [2022-12-06 05:05:46,042 INFO L175 Difference]: Start difference. First operand has 410 places, 852 transitions, 28217 flow. Second operand 7 states and 103 transitions. [2022-12-06 05:05:46,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 875 transitions, 30214 flow [2022-12-06 05:05:49,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 875 transitions, 30003 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 05:05:49,715 INFO L231 Difference]: Finished difference. Result has 412 places, 850 transitions, 28212 flow [2022-12-06 05:05:49,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=27972, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=28212, PETRI_PLACES=412, PETRI_TRANSITIONS=850} [2022-12-06 05:05:49,716 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 391 predicate places. [2022-12-06 05:05:49,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:49,716 INFO L89 Accepts]: Start accepts. Operand has 412 places, 850 transitions, 28212 flow [2022-12-06 05:05:49,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:49,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:49,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 412 places, 850 transitions, 28212 flow [2022-12-06 05:05:49,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 411 places, 850 transitions, 28212 flow [2022-12-06 05:05:51,293 INFO L130 PetriNetUnfolder]: 2259/5693 cut-off events. [2022-12-06 05:05:51,294 INFO L131 PetriNetUnfolder]: For 443563/444770 co-relation queries the response was YES. [2022-12-06 05:05:51,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75923 conditions, 5693 events. 2259/5693 cut-off events. For 443563/444770 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 58027 event pairs, 815 based on Foata normal form. 207/5490 useless extension candidates. Maximal degree in co-relation 75025. Up to 1997 conditions per place. [2022-12-06 05:05:51,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 411 places, 850 transitions, 28212 flow [2022-12-06 05:05:51,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 2678 [2022-12-06 05:05:51,469 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:51,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1753 [2022-12-06 05:05:51,469 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 850 transitions, 28212 flow [2022-12-06 05:05:51,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:51,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:51,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:51,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:51,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-06 05:05:51,678 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1218735117, now seen corresponding path program 1 times [2022-12-06 05:05:51,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:51,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045260653] [2022-12-06 05:05:51,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:51,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:51,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:51,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045260653] [2022-12-06 05:05:51,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045260653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:51,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8191310] [2022-12-06 05:05:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:51,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:51,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:51,783 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:51,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-06 05:05:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:52,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:05:52,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:52,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:05:52,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8191310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:52,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:52,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2022-12-06 05:05:52,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458131854] [2022-12-06 05:05:52,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:52,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:05:52,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:52,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:05:52,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:05:52,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 05:05:52,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 850 transitions, 28212 flow. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:52,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:52,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 05:05:52,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:56,892 INFO L130 PetriNetUnfolder]: 5626/10296 cut-off events. [2022-12-06 05:05:56,893 INFO L131 PetriNetUnfolder]: For 819395/819395 co-relation queries the response was YES. [2022-12-06 05:05:57,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144388 conditions, 10296 events. 5626/10296 cut-off events. For 819395/819395 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 83179 event pairs, 963 based on Foata normal form. 5/10299 useless extension candidates. Maximal degree in co-relation 143168. Up to 5270 conditions per place. [2022-12-06 05:05:57,071 INFO L137 encePairwiseOnDemand]: 24/65 looper letters, 487 selfloop transitions, 481 changer transitions 8/976 dead transitions. [2022-12-06 05:05:57,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 976 transitions, 33305 flow [2022-12-06 05:05:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:05:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:05:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2022-12-06 05:05:57,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19615384615384615 [2022-12-06 05:05:57,072 INFO L175 Difference]: Start difference. First operand has 411 places, 850 transitions, 28212 flow. Second operand 12 states and 153 transitions. [2022-12-06 05:05:57,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 976 transitions, 33305 flow [2022-12-06 05:06:01,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 976 transitions, 33025 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-06 05:06:01,024 INFO L231 Difference]: Finished difference. Result has 420 places, 881 transitions, 30633 flow [2022-12-06 05:06:01,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=27932, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=850, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=452, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=30633, PETRI_PLACES=420, PETRI_TRANSITIONS=881} [2022-12-06 05:06:01,025 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 399 predicate places. [2022-12-06 05:06:01,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:01,025 INFO L89 Accepts]: Start accepts. Operand has 420 places, 881 transitions, 30633 flow [2022-12-06 05:06:01,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:01,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:01,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 420 places, 881 transitions, 30633 flow [2022-12-06 05:06:01,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 420 places, 881 transitions, 30633 flow [2022-12-06 05:06:02,338 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][192], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), Black: 4596#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), 2317#true, Black: 3256#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 3257#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), Black: 5086#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), 695#true, Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), 4396#true, Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, Black: 4129#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 608#true, Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3905#(and (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (= (+ (* ~i_AB~0 4) ~A~0.offset) 4) (= (+ (* ~i_AB~0 4) ~B~0.offset) 4) (exists ((~A~0.base Int)) (and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) 4)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 (- 4)) 8)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4)))))), Black: 4160#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= ~i_BA~0 1)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 44#thread1EXITtrue, Black: 4056#(and (= ~B~0.offset 0) (<= (+ ~i_BA~0 6) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0)), Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 2122#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2049#true, Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4505#true, Black: 3586#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3677#(and (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), Black: 5197#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4856#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 1290#true, Black: 2945#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (< ~i_BA~0 ~An~0)), Black: 2939#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), 2845#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), 3341#true, Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 5302#true, 4050#true, 1455#true, Black: 1642#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (or (< ~i_BA~0 ~Bn~0) (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))))), Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4465#(not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4427#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), 3555#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), 48#thread2EXITtrue, Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 166#(= ~i_BA~0 0), 1569#true, 4958#true, 1681#true, Black: 3226#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 3242#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 176#(= ~i_AB~0 0), 2956#true, Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4277#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 5030#(or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), 4168#true, Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), 3806#true, 2232#true, Black: 3958#true, Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 1152#true, Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 3793#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_BA~0 1) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 3253#true, 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3053#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 4) (exists ((~A~0.base Int)) (and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) 4)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 (- 4)) 8)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4)))))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), 3686#true, Black: 4840#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), 2415#true, Black: 2035#(or (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1454) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1454) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))), Black: 3492#true]) [2022-12-06 05:06:02,338 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:06:02,338 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:06:02,339 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:06:02,339 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:06:02,815 INFO L130 PetriNetUnfolder]: 2499/6246 cut-off events. [2022-12-06 05:06:02,815 INFO L131 PetriNetUnfolder]: For 517408/518868 co-relation queries the response was YES. [2022-12-06 05:06:02,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86858 conditions, 6246 events. 2499/6246 cut-off events. For 517408/518868 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 64564 event pairs, 943 based on Foata normal form. 236/5986 useless extension candidates. Maximal degree in co-relation 85933. Up to 2275 conditions per place. [2022-12-06 05:06:02,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 420 places, 881 transitions, 30633 flow [2022-12-06 05:06:02,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 2792 [2022-12-06 05:06:02,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:06:03,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:06:03,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2014 [2022-12-06 05:06:03,039 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 881 transitions, 30658 flow [2022-12-06 05:06:03,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:03,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:03,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:03,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-12-06 05:06:03,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-12-06 05:06:03,245 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:06:03,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1220261884, now seen corresponding path program 1 times [2022-12-06 05:06:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:03,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938148022] [2022-12-06 05:06:03,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:03,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:03,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:03,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938148022] [2022-12-06 05:06:03,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938148022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:06:03,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710792556] [2022-12-06 05:06:03,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:03,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:06:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:06:03,290 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:06:03,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-06 05:06:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:03,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:06:03,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:06:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:03,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:06:03,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710792556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:03,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:06:03,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 05:06:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051811535] [2022-12-06 05:06:03,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:03,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:06:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:06:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:06:03,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 05:06:03,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 881 transitions, 30658 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:03,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:03,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 05:06:03,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:09,359 INFO L130 PetriNetUnfolder]: 6685/12286 cut-off events. [2022-12-06 05:06:09,359 INFO L131 PetriNetUnfolder]: For 1025113/1025113 co-relation queries the response was YES. [2022-12-06 05:06:09,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176486 conditions, 12286 events. 6685/12286 cut-off events. For 1025113/1025113 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 102021 event pairs, 3357 based on Foata normal form. 48/12332 useless extension candidates. Maximal degree in co-relation 175239. Up to 8620 conditions per place. [2022-12-06 05:06:09,580 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 990 selfloop transitions, 4 changer transitions 4/998 dead transitions. [2022-12-06 05:06:09,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 998 transitions, 35784 flow [2022-12-06 05:06:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:06:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:06:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-12-06 05:06:09,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 05:06:09,581 INFO L175 Difference]: Start difference. First operand has 420 places, 881 transitions, 30658 flow. Second operand 4 states and 99 transitions. [2022-12-06 05:06:09,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 998 transitions, 35784 flow [2022-12-06 05:06:14,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 998 transitions, 35061 flow, removed 173 selfloop flow, removed 6 redundant places. [2022-12-06 05:06:14,793 INFO L231 Difference]: Finished difference. Result has 418 places, 875 transitions, 29780 flow [2022-12-06 05:06:14,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=29951, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=878, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=29780, PETRI_PLACES=418, PETRI_TRANSITIONS=875} [2022-12-06 05:06:14,794 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 397 predicate places. [2022-12-06 05:06:14,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:14,794 INFO L89 Accepts]: Start accepts. Operand has 418 places, 875 transitions, 29780 flow [2022-12-06 05:06:14,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:14,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:14,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 418 places, 875 transitions, 29780 flow [2022-12-06 05:06:14,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 416 places, 875 transitions, 29780 flow [2022-12-06 05:06:16,220 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][174], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), Black: 4596#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), 2317#true, Black: 3256#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), Black: 5086#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), 695#true, Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), 4396#true, Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, Black: 5418#(and (<= ~Bn~0 2) (<= 2 ~i_BA~0)), Black: 4129#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 608#true, Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 4160#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= ~i_BA~0 1)), Black: 3905#(and (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (= (+ (* ~i_AB~0 4) ~A~0.offset) 4) (= (+ (* ~i_AB~0 4) ~B~0.offset) 4) (exists ((~A~0.base Int)) (and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) 4)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 (- 4)) 8)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4)))))), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4056#(and (= ~B~0.offset 0) (<= (+ ~i_BA~0 6) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0)), Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 44#thread1EXITtrue, Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), 5399#(and (<= ~Bn~0 2) (<= 0 ~i_BA~0)), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 2122#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2049#true, Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4505#true, Black: 3586#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3677#(and (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), Black: 5197#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4856#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2945#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (< ~i_BA~0 ~An~0)), 1290#true, Black: 2939#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), 2845#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), 3341#true, Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 5302#true, 4050#true, 1455#true, Black: 1642#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (or (< ~i_BA~0 ~Bn~0) (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))))), Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4465#(not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 4427#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), 3555#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), 48#thread2EXITtrue, Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 166#(= ~i_BA~0 0), 4958#true, 1569#true, 1681#true, Black: 3226#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 3242#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 176#(= ~i_AB~0 0), 2956#true, Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4277#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 5030#(or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), 4168#true, Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), 3806#true, 2232#true, Black: 3958#true, Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 1152#true, Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 3793#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_BA~0 1) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 3253#true, 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3053#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 4) (exists ((~A~0.base Int)) (and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) 4)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 (- 4)) 8)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4)))))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), 3686#true, Black: 4840#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 2035#(or (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1454) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1454) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))), Black: 3492#true, 2415#true]) [2022-12-06 05:06:16,220 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:06:16,220 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:06:16,220 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:06:16,220 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:06:16,969 INFO L130 PetriNetUnfolder]: 2993/7502 cut-off events. [2022-12-06 05:06:16,969 INFO L131 PetriNetUnfolder]: For 619734/621492 co-relation queries the response was YES. [2022-12-06 05:06:17,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102772 conditions, 7502 events. 2993/7502 cut-off events. For 619734/621492 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 79931 event pairs, 1191 based on Foata normal form. 274/7165 useless extension candidates. Maximal degree in co-relation 101854. Up to 2751 conditions per place. [2022-12-06 05:06:17,256 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 416 places, 875 transitions, 29780 flow [2022-12-06 05:06:17,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 2760 [2022-12-06 05:06:17,261 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:06:17,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2468 [2022-12-06 05:06:17,262 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 875 transitions, 29780 flow [2022-12-06 05:06:17,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:17,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:17,262 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:17,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-12-06 05:06:17,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-12-06 05:06:17,466 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:06:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash -184925728, now seen corresponding path program 1 times [2022-12-06 05:06:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:17,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046930170] [2022-12-06 05:06:17,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:17,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:06:17,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:17,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046930170] [2022-12-06 05:06:17,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046930170] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:06:17,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237584389] [2022-12-06 05:06:17,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:17,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:06:17,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:06:17,525 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:06:17,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-06 05:06:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:17,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:06:17,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:06:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:06:17,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:06:17,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237584389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:17,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:06:17,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-06 05:06:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425364031] [2022-12-06 05:06:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:17,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:06:17,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:06:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:06:17,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:06:17,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 875 transitions, 29780 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:17,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:17,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:06:17,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:23,084 INFO L130 PetriNetUnfolder]: 6205/11592 cut-off events. [2022-12-06 05:06:23,084 INFO L131 PetriNetUnfolder]: For 948210/948210 co-relation queries the response was YES. [2022-12-06 05:06:23,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163037 conditions, 11592 events. 6205/11592 cut-off events. For 948210/948210 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 97060 event pairs, 2654 based on Foata normal form. 258/11848 useless extension candidates. Maximal degree in co-relation 161797. Up to 8620 conditions per place. [2022-12-06 05:06:23,355 INFO L137 encePairwiseOnDemand]: 45/63 looper letters, 803 selfloop transitions, 106 changer transitions 62/971 dead transitions. [2022-12-06 05:06:23,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 971 transitions, 33962 flow [2022-12-06 05:06:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:06:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:06:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-06 05:06:23,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33015873015873015 [2022-12-06 05:06:23,357 INFO L175 Difference]: Start difference. First operand has 416 places, 875 transitions, 29780 flow. Second operand 5 states and 104 transitions. [2022-12-06 05:06:23,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 971 transitions, 33962 flow [2022-12-06 05:06:28,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 971 transitions, 33547 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-12-06 05:06:28,827 INFO L231 Difference]: Finished difference. Result has 416 places, 836 transitions, 28091 flow [2022-12-06 05:06:28,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=28974, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=756, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=28091, PETRI_PLACES=416, PETRI_TRANSITIONS=836} [2022-12-06 05:06:28,829 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 395 predicate places. [2022-12-06 05:06:28,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:28,829 INFO L89 Accepts]: Start accepts. Operand has 416 places, 836 transitions, 28091 flow [2022-12-06 05:06:28,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:28,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:28,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 416 places, 836 transitions, 28091 flow [2022-12-06 05:06:28,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 836 transitions, 28091 flow [2022-12-06 05:06:30,683 INFO L130 PetriNetUnfolder]: 2705/6934 cut-off events. [2022-12-06 05:06:30,683 INFO L131 PetriNetUnfolder]: For 565133/566725 co-relation queries the response was YES. [2022-12-06 05:06:30,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94180 conditions, 6934 events. 2705/6934 cut-off events. For 565133/566725 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 73853 event pairs, 1098 based on Foata normal form. 290/6678 useless extension candidates. Maximal degree in co-relation 93271. Up to 2521 conditions per place. [2022-12-06 05:06:30,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 402 places, 836 transitions, 28091 flow [2022-12-06 05:06:30,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 2722 [2022-12-06 05:06:30,887 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:06:30,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2059 [2022-12-06 05:06:30,888 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 836 transitions, 28091 flow [2022-12-06 05:06:30,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:30,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:30,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:30,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-12-06 05:06:31,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:06:31,094 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:06:31,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -858389882, now seen corresponding path program 1 times [2022-12-06 05:06:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:31,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25624011] [2022-12-06 05:06:31,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:31,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:31,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25624011] [2022-12-06 05:06:31,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25624011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:06:31,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818616067] [2022-12-06 05:06:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:31,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:06:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:06:31,475 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:06:31,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-06 05:06:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:31,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:06:31,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:06:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:31,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:06:31,939 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 05:06:31,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-06 05:06:31,954 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:06:31,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:06:31,959 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:06:31,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:06:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:32,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818616067] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:06:32,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:06:32,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:06:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090098661] [2022-12-06 05:06:32,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:06:32,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:06:32,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:32,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:06:32,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:06:32,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:06:32,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 836 transitions, 28091 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:32,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:32,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:06:32,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:37,767 INFO L130 PetriNetUnfolder]: 6172/11531 cut-off events. [2022-12-06 05:06:37,767 INFO L131 PetriNetUnfolder]: For 944393/944393 co-relation queries the response was YES. [2022-12-06 05:06:37,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162567 conditions, 11531 events. 6172/11531 cut-off events. For 944393/944393 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 96466 event pairs, 2322 based on Foata normal form. 77/11606 useless extension candidates. Maximal degree in co-relation 161336. Up to 10386 conditions per place. [2022-12-06 05:06:38,054 INFO L137 encePairwiseOnDemand]: 24/57 looper letters, 705 selfloop transitions, 195 changer transitions 5/905 dead transitions. [2022-12-06 05:06:38,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 905 transitions, 31508 flow [2022-12-06 05:06:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:06:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:06:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-12-06 05:06:38,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20701754385964913 [2022-12-06 05:06:38,055 INFO L175 Difference]: Start difference. First operand has 402 places, 836 transitions, 28091 flow. Second operand 10 states and 118 transitions. [2022-12-06 05:06:38,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 905 transitions, 31508 flow [2022-12-06 05:06:42,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 905 transitions, 30525 flow, removed 120 selfloop flow, removed 18 redundant places. [2022-12-06 05:06:42,998 INFO L231 Difference]: Finished difference. Result has 397 places, 850 transitions, 28151 flow [2022-12-06 05:06:42,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=27120, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=28151, PETRI_PLACES=397, PETRI_TRANSITIONS=850} [2022-12-06 05:06:42,999 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 376 predicate places. [2022-12-06 05:06:42,999 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:42,999 INFO L89 Accepts]: Start accepts. Operand has 397 places, 850 transitions, 28151 flow [2022-12-06 05:06:43,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:43,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:43,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 397 places, 850 transitions, 28151 flow [2022-12-06 05:06:43,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 850 transitions, 28151 flow [2022-12-06 05:06:44,863 INFO L130 PetriNetUnfolder]: 2772/7140 cut-off events. [2022-12-06 05:06:44,863 INFO L131 PetriNetUnfolder]: For 556034/557706 co-relation queries the response was YES. [2022-12-06 05:06:44,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95433 conditions, 7140 events. 2772/7140 cut-off events. For 556034/557706 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 76590 event pairs, 1134 based on Foata normal form. 299/6882 useless extension candidates. Maximal degree in co-relation 94530. Up to 2572 conditions per place. [2022-12-06 05:06:45,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 397 places, 850 transitions, 28151 flow [2022-12-06 05:06:45,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 2794 [2022-12-06 05:06:45,043 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:06:45,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2044 [2022-12-06 05:06:45,044 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 850 transitions, 28151 flow [2022-12-06 05:06:45,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:45,044 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:45,044 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:45,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-12-06 05:06:45,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:06:45,250 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:06:45,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:45,250 INFO L85 PathProgramCache]: Analyzing trace with hash -698864419, now seen corresponding path program 1 times [2022-12-06 05:06:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:45,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774413381] [2022-12-06 05:06:45,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:06:45,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:45,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774413381] [2022-12-06 05:06:45,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774413381] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:06:45,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436532703] [2022-12-06 05:06:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:45,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:06:45,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:06:45,404 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:06:45,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-12-06 05:06:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:45,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:06:45,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:06:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:06:45,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:06:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:06:45,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436532703] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:06:45,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:06:45,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-06 05:06:45,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003448117] [2022-12-06 05:06:45,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:06:45,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:06:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:45,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:06:45,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:06:45,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:06:45,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 850 transitions, 28151 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:45,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:45,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:06:45,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:51,190 INFO L130 PetriNetUnfolder]: 6546/12172 cut-off events. [2022-12-06 05:06:51,190 INFO L131 PetriNetUnfolder]: For 957397/957397 co-relation queries the response was YES. [2022-12-06 05:06:51,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171227 conditions, 12172 events. 6546/12172 cut-off events. For 957397/957397 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 102441 event pairs, 1880 based on Foata normal form. 84/12254 useless extension candidates. Maximal degree in co-relation 170002. Up to 6117 conditions per place. [2022-12-06 05:06:51,414 INFO L137 encePairwiseOnDemand]: 27/57 looper letters, 707 selfloop transitions, 366 changer transitions 2/1075 dead transitions. [2022-12-06 05:06:51,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 1075 transitions, 35955 flow [2022-12-06 05:06:51,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:06:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:06:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-12-06 05:06:51,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3233082706766917 [2022-12-06 05:06:51,415 INFO L175 Difference]: Start difference. First operand has 397 places, 850 transitions, 28151 flow. Second operand 7 states and 129 transitions. [2022-12-06 05:06:51,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 1075 transitions, 35955 flow [2022-12-06 05:06:56,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 1075 transitions, 35419 flow, removed 123 selfloop flow, removed 4 redundant places. [2022-12-06 05:06:56,313 INFO L231 Difference]: Finished difference. Result has 402 places, 886 transitions, 30443 flow [2022-12-06 05:06:56,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=27759, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=850, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=331, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=30443, PETRI_PLACES=402, PETRI_TRANSITIONS=886} [2022-12-06 05:06:56,314 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 381 predicate places. [2022-12-06 05:06:56,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:56,314 INFO L89 Accepts]: Start accepts. Operand has 402 places, 886 transitions, 30443 flow [2022-12-06 05:06:56,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:56,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:56,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 402 places, 886 transitions, 30443 flow [2022-12-06 05:06:56,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 886 transitions, 30443 flow [2022-12-06 05:06:58,583 INFO L130 PetriNetUnfolder]: 2956/7524 cut-off events. [2022-12-06 05:06:58,583 INFO L131 PetriNetUnfolder]: For 608163/610198 co-relation queries the response was YES. [2022-12-06 05:06:58,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104065 conditions, 7524 events. 2956/7524 cut-off events. For 608163/610198 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 80928 event pairs, 1204 based on Foata normal form. 425/7359 useless extension candidates. Maximal degree in co-relation 103125. Up to 2783 conditions per place. [2022-12-06 05:06:58,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 402 places, 886 transitions, 30443 flow [2022-12-06 05:06:58,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 2902 [2022-12-06 05:06:58,773 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:06:58,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2459 [2022-12-06 05:06:58,773 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 886 transitions, 30443 flow [2022-12-06 05:06:58,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:58,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:58,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:58,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-12-06 05:06:58,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:06:58,979 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:06:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1627187128, now seen corresponding path program 1 times [2022-12-06 05:06:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:58,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454986377] [2022-12-06 05:06:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:59,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:59,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454986377] [2022-12-06 05:06:59,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454986377] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:06:59,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062338328] [2022-12-06 05:06:59,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:59,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:06:59,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:06:59,241 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:06:59,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-12-06 05:06:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:59,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 05:06:59,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:06:59,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:06:59,577 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-06 05:06:59,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-06 05:06:59,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:06:59,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:06:59,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:06:59,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:06:59,609 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:06:59,610 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2022-12-06 05:06:59,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:06:59,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 28 [2022-12-06 05:06:59,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:06:59,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:06:59,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:06:59,852 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-06 05:06:59,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 181 treesize of output 175 [2022-12-06 05:06:59,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:06:59,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-12-06 05:07:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:00,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:07:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:00,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062338328] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:07:00,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:07:00,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 05:07:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507814554] [2022-12-06 05:07:00,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:07:00,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:07:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:00,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:07:00,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=165, Unknown=2, NotChecked=0, Total=210 [2022-12-06 05:07:00,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:07:00,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 886 transitions, 30443 flow. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:00,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:00,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:07:00,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:06,527 INFO L130 PetriNetUnfolder]: 6876/12784 cut-off events. [2022-12-06 05:07:06,527 INFO L131 PetriNetUnfolder]: For 1000985/1000985 co-relation queries the response was YES. [2022-12-06 05:07:06,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181733 conditions, 12784 events. 6876/12784 cut-off events. For 1000985/1000985 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 107731 event pairs, 2985 based on Foata normal form. 91/12873 useless extension candidates. Maximal degree in co-relation 180475. Up to 11399 conditions per place. [2022-12-06 05:07:06,961 INFO L137 encePairwiseOnDemand]: 22/57 looper letters, 800 selfloop transitions, 226 changer transitions 3/1029 dead transitions. [2022-12-06 05:07:06,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1029 transitions, 35681 flow [2022-12-06 05:07:06,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:07:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:07:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 169 transitions. [2022-12-06 05:07:06,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15604801477377656 [2022-12-06 05:07:06,964 INFO L175 Difference]: Start difference. First operand has 402 places, 886 transitions, 30443 flow. Second operand 19 states and 169 transitions. [2022-12-06 05:07:06,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1029 transitions, 35681 flow [2022-12-06 05:07:12,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1029 transitions, 35420 flow, removed 33 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:12,533 INFO L231 Difference]: Finished difference. Result has 424 places, 939 transitions, 32645 flow [2022-12-06 05:07:12,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=30126, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=32645, PETRI_PLACES=424, PETRI_TRANSITIONS=939} [2022-12-06 05:07:12,534 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 403 predicate places. [2022-12-06 05:07:12,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:12,534 INFO L89 Accepts]: Start accepts. Operand has 424 places, 939 transitions, 32645 flow [2022-12-06 05:07:12,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:12,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:12,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 424 places, 939 transitions, 32645 flow [2022-12-06 05:07:12,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 424 places, 939 transitions, 32645 flow [2022-12-06 05:07:14,506 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][155], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), Black: 4596#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), 2317#true, Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), 2049#true, Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 5598#(and (< 10 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), 695#true, Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 5653#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), 4396#true, Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, 608#true, Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4056#(and (= ~B~0.offset 0) (<= (+ ~i_BA~0 6) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0)), Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 44#thread1EXITtrue, 5672#true, Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4505#true, Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3677#(and (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5465#(and (<= ~Bn~0 2) (<= 1 ~i_BA~0)), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5472#(and (<= ~Bn~0 2) (<= 2 ~i_BA~0)), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4856#true, 3958#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), 1152#true, 5581#true, Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 1290#true, Black: 2945#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (< ~i_BA~0 ~An~0)), Black: 2939#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), 2845#true, 3341#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 5302#true, 4050#true, 1455#true, Black: 1642#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (or (< ~i_BA~0 ~Bn~0) (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))))), 2304#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5776#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (< ~i_BA~0 ~An~0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 5743#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 4465#(not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5705#(and (= ~B~0.offset 0) (= (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset) 0) (<= 6 ~An~0) (= (select (select |#memory_int| ~B~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset 4))) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4427#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 5754#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 5770#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 5774#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5733#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 48#thread2EXITtrue, Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), 3492#true, Black: 166#(= ~i_BA~0 0), 4958#true, 1569#true, 1681#true, Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 176#(= ~i_AB~0 0), Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), 2956#true, Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4277#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), 4168#true, Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5492#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 5558#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), 3806#true, Black: 5490#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5550#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), 3686#true, Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), 2415#true]) [2022-12-06 05:07:14,507 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:07:14,507 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:07:14,507 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:07:14,507 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:07:14,683 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][155], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), Black: 4596#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), 2317#true, Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), 2049#true, Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 5598#(and (< 10 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), 695#true, Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 5653#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), 4396#true, Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, 608#true, Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4056#(and (= ~B~0.offset 0) (<= (+ ~i_BA~0 6) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0)), Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 44#thread1EXITtrue, 5672#true, Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4505#true, Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3677#(and (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5465#(and (<= ~Bn~0 2) (<= 1 ~i_BA~0)), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5472#(and (<= ~Bn~0 2) (<= 2 ~i_BA~0)), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4856#true, 3958#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), 1152#true, 5581#true, Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 1290#true, Black: 2945#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (< ~i_BA~0 ~An~0)), Black: 2939#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), 2845#true, 3341#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 5302#true, 4050#true, 1455#true, Black: 1642#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (or (< ~i_BA~0 ~Bn~0) (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))))), Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5776#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (< ~i_BA~0 ~An~0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 5743#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4465#(not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5705#(and (= ~B~0.offset 0) (= (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset) 0) (<= 6 ~An~0) (= (select (select |#memory_int| ~B~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset 4))) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 4427#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 5754#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 5770#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 5774#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5733#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 48#thread2EXITtrue, Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), 3492#true, Black: 166#(= ~i_BA~0 0), 4958#true, 1569#true, 1681#true, Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 176#(= ~i_AB~0 0), Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), 2956#true, Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4277#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), 4168#true, Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5492#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), Black: 5558#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 3806#true, Black: 5490#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5550#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 2232#true, Black: 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), 3686#true, Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), 2415#true]) [2022-12-06 05:07:14,683 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:07:14,683 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:07:14,683 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:07:14,683 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:07:14,760 INFO L130 PetriNetUnfolder]: 3145/8019 cut-off events. [2022-12-06 05:07:14,760 INFO L131 PetriNetUnfolder]: For 732793/734748 co-relation queries the response was YES. [2022-12-06 05:07:14,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116214 conditions, 8019 events. 3145/8019 cut-off events. For 732793/734748 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 86729 event pairs, 1229 based on Foata normal form. 378/7792 useless extension candidates. Maximal degree in co-relation 115244. Up to 2860 conditions per place. [2022-12-06 05:07:14,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 424 places, 939 transitions, 32645 flow [2022-12-06 05:07:14,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 3138 [2022-12-06 05:07:14,972 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:14,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2439 [2022-12-06 05:07:14,973 INFO L495 AbstractCegarLoop]: Abstraction has has 424 places, 939 transitions, 32645 flow [2022-12-06 05:07:14,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:14,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:14,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:14,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-12-06 05:07:15,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-12-06 05:07:15,179 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:07:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash 120549292, now seen corresponding path program 2 times [2022-12-06 05:07:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:15,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888957129] [2022-12-06 05:07:15,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:15,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:15,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:15,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888957129] [2022-12-06 05:07:15,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888957129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:07:15,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231892785] [2022-12-06 05:07:15,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:07:15,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:07:15,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:07:15,664 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:07:15,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-12-06 05:07:15,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:07:15,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:07:15,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:07:15,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:07:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:16,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:07:16,224 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 05:07:16,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-06 05:07:16,242 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:07:16,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:07:16,249 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:07:16,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:07:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:16,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231892785] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:07:16,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:07:16,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 05:07:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996005213] [2022-12-06 05:07:16,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:07:16,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:07:16,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:16,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:07:16,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:07:16,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:07:16,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 939 transitions, 32645 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:16,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:16,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:07:16,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:23,384 INFO L130 PetriNetUnfolder]: 6991/13019 cut-off events. [2022-12-06 05:07:23,384 INFO L131 PetriNetUnfolder]: For 1180930/1180930 co-relation queries the response was YES. [2022-12-06 05:07:23,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193072 conditions, 13019 events. 6991/13019 cut-off events. For 1180930/1180930 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 110434 event pairs, 2407 based on Foata normal form. 91/13108 useless extension candidates. Maximal degree in co-relation 191732. Up to 10732 conditions per place. [2022-12-06 05:07:23,590 INFO L137 encePairwiseOnDemand]: 19/57 looper letters, 641 selfloop transitions, 388 changer transitions 7/1036 dead transitions. [2022-12-06 05:07:23,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 1036 transitions, 37102 flow [2022-12-06 05:07:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:07:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:07:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 150 transitions. [2022-12-06 05:07:23,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18796992481203006 [2022-12-06 05:07:23,591 INFO L175 Difference]: Start difference. First operand has 424 places, 939 transitions, 32645 flow. Second operand 14 states and 150 transitions. [2022-12-06 05:07:23,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 1036 transitions, 37102 flow [2022-12-06 05:07:29,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 1036 transitions, 36286 flow, removed 367 selfloop flow, removed 6 redundant places. [2022-12-06 05:07:29,768 INFO L231 Difference]: Finished difference. Result has 435 places, 960 transitions, 33832 flow [2022-12-06 05:07:29,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=31867, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=369, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=33832, PETRI_PLACES=435, PETRI_TRANSITIONS=960} [2022-12-06 05:07:29,769 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 414 predicate places. [2022-12-06 05:07:29,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:29,774 INFO L89 Accepts]: Start accepts. Operand has 435 places, 960 transitions, 33832 flow [2022-12-06 05:07:29,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:29,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:29,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 435 places, 960 transitions, 33832 flow [2022-12-06 05:07:29,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 435 places, 960 transitions, 33832 flow [2022-12-06 05:07:32,151 INFO L130 PetriNetUnfolder]: 3150/8095 cut-off events. [2022-12-06 05:07:32,152 INFO L131 PetriNetUnfolder]: For 782483/784571 co-relation queries the response was YES. [2022-12-06 05:07:32,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119038 conditions, 8095 events. 3150/8095 cut-off events. For 782483/784571 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 88089 event pairs, 1228 based on Foata normal form. 395/7897 useless extension candidates. Maximal degree in co-relation 118034. Up to 2865 conditions per place. [2022-12-06 05:07:32,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 435 places, 960 transitions, 33832 flow [2022-12-06 05:07:32,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 3226 [2022-12-06 05:07:32,487 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:32,487 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2713 [2022-12-06 05:07:32,487 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 960 transitions, 33832 flow [2022-12-06 05:07:32,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:32,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:32,487 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:32,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-12-06 05:07:32,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:07:32,692 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:07:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1276504212, now seen corresponding path program 1 times [2022-12-06 05:07:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:32,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840571883] [2022-12-06 05:07:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:32,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:32,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840571883] [2022-12-06 05:07:32,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840571883] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:07:32,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921042099] [2022-12-06 05:07:32,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:32,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:07:32,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:07:32,965 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:07:32,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-06 05:07:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:33,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:07:33,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:07:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:33,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:07:33,456 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-06 05:07:33,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 88 [2022-12-06 05:07:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:33,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921042099] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:07:33,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:07:33,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 15 [2022-12-06 05:07:33,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010584452] [2022-12-06 05:07:33,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:07:33,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:07:33,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:33,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:07:33,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:07:33,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:07:33,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 960 transitions, 33832 flow. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:33,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:33,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:07:33,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:40,368 INFO L130 PetriNetUnfolder]: 6973/13002 cut-off events. [2022-12-06 05:07:40,368 INFO L131 PetriNetUnfolder]: For 1216582/1216582 co-relation queries the response was YES. [2022-12-06 05:07:40,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196112 conditions, 13002 events. 6973/13002 cut-off events. For 1216582/1216582 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 110516 event pairs, 2753 based on Foata normal form. 8/13008 useless extension candidates. Maximal degree in co-relation 194747. Up to 12743 conditions per place. [2022-12-06 05:07:40,606 INFO L137 encePairwiseOnDemand]: 31/57 looper letters, 862 selfloop transitions, 116 changer transitions 5/983 dead transitions. [2022-12-06 05:07:40,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 983 transitions, 36269 flow [2022-12-06 05:07:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:07:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:07:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-12-06 05:07:40,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18908382066276802 [2022-12-06 05:07:40,607 INFO L175 Difference]: Start difference. First operand has 435 places, 960 transitions, 33832 flow. Second operand 9 states and 97 transitions. [2022-12-06 05:07:40,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 983 transitions, 36269 flow [2022-12-06 05:07:47,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 983 transitions, 35888 flow, removed 118 selfloop flow, removed 5 redundant places. [2022-12-06 05:07:47,116 INFO L231 Difference]: Finished difference. Result has 441 places, 965 transitions, 34020 flow [2022-12-06 05:07:47,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=33453, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=34020, PETRI_PLACES=441, PETRI_TRANSITIONS=965} [2022-12-06 05:07:47,117 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 420 predicate places. [2022-12-06 05:07:47,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:47,117 INFO L89 Accepts]: Start accepts. Operand has 441 places, 965 transitions, 34020 flow [2022-12-06 05:07:47,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:47,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:47,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 441 places, 965 transitions, 34020 flow [2022-12-06 05:07:47,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 965 transitions, 34020 flow [2022-12-06 05:07:49,450 INFO L130 PetriNetUnfolder]: 3125/8054 cut-off events. [2022-12-06 05:07:49,450 INFO L131 PetriNetUnfolder]: For 778793/780889 co-relation queries the response was YES. [2022-12-06 05:07:49,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118482 conditions, 8054 events. 3125/8054 cut-off events. For 778793/780889 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 87697 event pairs, 1215 based on Foata normal form. 410/7877 useless extension candidates. Maximal degree in co-relation 117474. Up to 2836 conditions per place. [2022-12-06 05:07:49,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 965 transitions, 34020 flow [2022-12-06 05:07:49,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 3234 [2022-12-06 05:07:49,773 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:49,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2656 [2022-12-06 05:07:49,773 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 965 transitions, 34020 flow [2022-12-06 05:07:49,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:49,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:49,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:49,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-12-06 05:07:49,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2022-12-06 05:07:49,980 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:07:49,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash 799302960, now seen corresponding path program 1 times [2022-12-06 05:07:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:49,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530902996] [2022-12-06 05:07:49,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:50,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530902996] [2022-12-06 05:07:50,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530902996] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:07:50,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637420938] [2022-12-06 05:07:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:07:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:07:50,272 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:07:50,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-12-06 05:07:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:50,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:07:50,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:07:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:50,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:07:50,863 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:07:50,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:07:50,898 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-06 05:07:50,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-06 05:07:50,911 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:07:50,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:07:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:50,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637420938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:07:50,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:07:50,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2022-12-06 05:07:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220740594] [2022-12-06 05:07:50,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:07:50,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:07:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:07:50,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:07:50,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:07:50,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 965 transitions, 34020 flow. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:50,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:50,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:07:50,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:58,763 INFO L130 PetriNetUnfolder]: 7034/13093 cut-off events. [2022-12-06 05:07:58,763 INFO L131 PetriNetUnfolder]: For 1227989/1227989 co-relation queries the response was YES. [2022-12-06 05:07:58,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197266 conditions, 13093 events. 7034/13093 cut-off events. For 1227989/1227989 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 111147 event pairs, 1706 based on Foata normal form. 68/13159 useless extension candidates. Maximal degree in co-relation 195897. Up to 10362 conditions per place. [2022-12-06 05:07:59,030 INFO L137 encePairwiseOnDemand]: 22/57 looper letters, 730 selfloop transitions, 344 changer transitions 2/1076 dead transitions. [2022-12-06 05:07:59,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 1076 transitions, 38432 flow [2022-12-06 05:07:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:07:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:07:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 189 transitions. [2022-12-06 05:07:59,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18421052631578946 [2022-12-06 05:07:59,032 INFO L175 Difference]: Start difference. First operand has 439 places, 965 transitions, 34020 flow. Second operand 18 states and 189 transitions. [2022-12-06 05:07:59,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 1076 transitions, 38432 flow [2022-12-06 05:08:05,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 1076 transitions, 38047 flow, removed 100 selfloop flow, removed 3 redundant places. [2022-12-06 05:08:05,716 INFO L231 Difference]: Finished difference. Result has 455 places, 968 transitions, 34541 flow [2022-12-06 05:08:05,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=33517, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=335, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=34541, PETRI_PLACES=455, PETRI_TRANSITIONS=968} [2022-12-06 05:08:05,717 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 434 predicate places. [2022-12-06 05:08:05,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:05,717 INFO L89 Accepts]: Start accepts. Operand has 455 places, 968 transitions, 34541 flow [2022-12-06 05:08:05,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:05,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:05,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 455 places, 968 transitions, 34541 flow [2022-12-06 05:08:05,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 454 places, 968 transitions, 34541 flow [2022-12-06 05:08:07,849 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][222], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), 2317#true, Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), 2049#true, Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 5598#(and (< 10 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), 695#true, Black: 5653#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), 4396#true, Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, 608#true, Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4056#(and (= ~B~0.offset 0) (<= (+ ~i_BA~0 6) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0)), Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 44#thread1EXITtrue, 5672#true, Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 5997#true, Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 4505#true, Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3677#(and (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 5991#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5966#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5890#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 5465#(and (<= ~Bn~0 2) (<= 1 ~i_BA~0)), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5472#(and (<= ~Bn~0 2) (<= 2 ~i_BA~0)), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4856#true, 5786#true, 3958#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), 1152#true, 5581#true, Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 1290#true, Black: 2945#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (< ~i_BA~0 ~An~0)), Black: 2939#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), 2845#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), 3341#true, Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 5302#true, 4050#true, 1455#true, Black: 1642#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (or (< ~i_BA~0 ~Bn~0) (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))))), 2304#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5776#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (< ~i_BA~0 ~An~0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 5743#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4465#(not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 5705#(and (= ~B~0.offset 0) (= (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset) 0) (<= 6 ~An~0) (= (select (select |#memory_int| ~B~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset 4))) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 4427#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 5754#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 5770#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 5774#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5733#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 48#thread2EXITtrue, Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), 3492#true, Black: 166#(= ~i_BA~0 0), 1569#true, 4958#true, 1681#true, Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 176#(= ~i_AB~0 0), Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), 2956#true, Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4277#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), 4168#true, Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5492#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), Black: 5558#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 3806#true, Black: 5490#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5550#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 6117#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 2 ~Bn~0) (< 9 ~An~0) (= ~i_BA~0 1)), Black: 6003#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 10 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 3686#true, Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5792#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 5847#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 5858#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), 2415#true, Black: 5865#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0))]) [2022-12-06 05:08:07,849 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:08:07,849 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:08:07,849 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:08:07,849 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:08:08,273 INFO L130 PetriNetUnfolder]: 3134/8091 cut-off events. [2022-12-06 05:08:08,273 INFO L131 PetriNetUnfolder]: For 808732/810952 co-relation queries the response was YES. [2022-12-06 05:08:08,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120427 conditions, 8091 events. 3134/8091 cut-off events. For 808732/810952 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 88274 event pairs, 1199 based on Foata normal form. 431/7927 useless extension candidates. Maximal degree in co-relation 119422. Up to 2827 conditions per place. [2022-12-06 05:08:08,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 454 places, 968 transitions, 34541 flow [2022-12-06 05:08:08,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 3288 [2022-12-06 05:08:08,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:08:08,569 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:08:08,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2857 [2022-12-06 05:08:08,574 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 968 transitions, 34600 flow [2022-12-06 05:08:08,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:08,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:08,574 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:08,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-12-06 05:08:08,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-12-06 05:08:08,781 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:08:08,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1808592677, now seen corresponding path program 1 times [2022-12-06 05:08:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:08,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794197327] [2022-12-06 05:08:08,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:09,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:09,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794197327] [2022-12-06 05:08:09,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794197327] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:09,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881872918] [2022-12-06 05:08:09,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:09,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:09,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:09,042 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:09,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-12-06 05:08:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:09,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 05:08:09,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:09,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:08:09,542 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-06 05:08:09,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-06 05:08:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:09,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881872918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:08:09,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:08:09,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2022-12-06 05:08:09,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042677249] [2022-12-06 05:08:09,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:08:09,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:08:09,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:09,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:08:09,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:08:09,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 05:08:09,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 968 transitions, 34600 flow. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:09,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:09,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 05:08:09,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:16,920 INFO L130 PetriNetUnfolder]: 7062/13217 cut-off events. [2022-12-06 05:08:16,920 INFO L131 PetriNetUnfolder]: For 1260423/1260423 co-relation queries the response was YES. [2022-12-06 05:08:17,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200895 conditions, 13217 events. 7062/13217 cut-off events. For 1260423/1260423 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 112990 event pairs, 1146 based on Foata normal form. 32/13247 useless extension candidates. Maximal degree in co-relation 199525. Up to 10108 conditions per place. [2022-12-06 05:08:17,160 INFO L137 encePairwiseOnDemand]: 23/60 looper letters, 556 selfloop transitions, 445 changer transitions 43/1044 dead transitions. [2022-12-06 05:08:17,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 1044 transitions, 38296 flow [2022-12-06 05:08:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:08:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:08:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 129 transitions. [2022-12-06 05:08:17,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17916666666666667 [2022-12-06 05:08:17,173 INFO L175 Difference]: Start difference. First operand has 454 places, 968 transitions, 34600 flow. Second operand 12 states and 129 transitions. [2022-12-06 05:08:17,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 1044 transitions, 38296 flow [2022-12-06 05:08:24,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 1044 transitions, 37431 flow, removed 260 selfloop flow, removed 10 redundant places. [2022-12-06 05:08:24,246 INFO L231 Difference]: Finished difference. Result has 456 places, 968 transitions, 34722 flow [2022-12-06 05:08:24,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=33785, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=439, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=34722, PETRI_PLACES=456, PETRI_TRANSITIONS=968} [2022-12-06 05:08:24,247 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 435 predicate places. [2022-12-06 05:08:24,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:24,247 INFO L89 Accepts]: Start accepts. Operand has 456 places, 968 transitions, 34722 flow [2022-12-06 05:08:24,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:24,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:24,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 456 places, 968 transitions, 34722 flow [2022-12-06 05:08:24,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 454 places, 968 transitions, 34722 flow [2022-12-06 05:08:26,333 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][198], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), 2317#true, Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), 2049#true, Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 5598#(and (< 10 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), 695#true, Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 5653#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), 4396#true, Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, 608#true, Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 44#thread1EXITtrue, 5672#true, Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 5997#true, Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 6230#(and (<= (+ ~A~0.offset 4) (+ (* ~i_AB~0 4) ~B~0.offset)) (= ~A~0.offset 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4)))) (< (+ (* ~i_AB~0 4) ~B~0.offset) (+ 5 ~A~0.offset)) (= ~i_BA~0 0) (= ~i_AB~0 1)), 4505#true, Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3677#(and (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 5991#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5966#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5890#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 5465#(and (<= ~Bn~0 2) (<= 1 ~i_BA~0)), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5472#(and (<= ~Bn~0 2) (<= 2 ~i_BA~0)), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4856#true, 5786#true, 3958#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), 1152#true, 5581#true, Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 1290#true, Black: 2945#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (< ~i_BA~0 ~An~0)), Black: 2939#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), 2845#true, 6120#true, 3341#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 5302#true, 4050#true, 1455#true, Black: 1642#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (or (< ~i_BA~0 ~Bn~0) (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))))), 2304#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5776#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (< ~i_BA~0 ~An~0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 5743#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5705#(and (= ~B~0.offset 0) (= (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset) 0) (<= 6 ~An~0) (= (select (select |#memory_int| ~B~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset 4))) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4427#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 5754#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 5770#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 5733#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 48#thread2EXITtrue, Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), 3492#true, Black: 166#(= ~i_BA~0 0), 1569#true, 4958#true, 1681#true, Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 176#(= ~i_AB~0 0), Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), 2956#true, Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4277#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), 4168#true, Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5492#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 5558#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), 3806#true, Black: 5490#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5550#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 6117#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 2 ~Bn~0) (< 9 ~An~0) (= ~i_BA~0 1)), Black: 6003#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 10 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), 3686#true, Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5792#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 5847#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 5858#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 2415#true, Black: 5865#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0))]) [2022-12-06 05:08:26,334 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:08:26,334 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:08:26,334 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:08:26,334 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:08:26,868 INFO L130 PetriNetUnfolder]: 3115/8054 cut-off events. [2022-12-06 05:08:26,869 INFO L131 PetriNetUnfolder]: For 790142/792360 co-relation queries the response was YES. [2022-12-06 05:08:27,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118858 conditions, 8054 events. 3115/8054 cut-off events. For 790142/792360 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 88040 event pairs, 1244 based on Foata normal form. 388/7840 useless extension candidates. Maximal degree in co-relation 117839. Up to 2849 conditions per place. [2022-12-06 05:08:27,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 454 places, 968 transitions, 34722 flow [2022-12-06 05:08:27,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 3238 [2022-12-06 05:08:27,172 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:27,172 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2925 [2022-12-06 05:08:27,172 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 968 transitions, 34722 flow [2022-12-06 05:08:27,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:27,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:27,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:27,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-12-06 05:08:27,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-12-06 05:08:27,376 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:08:27,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1752223773, now seen corresponding path program 2 times [2022-12-06 05:08:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:27,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330012453] [2022-12-06 05:08:27,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:27,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330012453] [2022-12-06 05:08:27,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330012453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:27,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006700037] [2022-12-06 05:08:27,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:08:27,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:27,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:27,814 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:27,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-12-06 05:08:28,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:08:28,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:08:28,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:08:28,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:28,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:08:28,409 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-06 05:08:28,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-06 05:08:28,425 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:08:28,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:08:28,430 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:08:28,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:08:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:28,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006700037] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:08:28,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:08:28,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-12-06 05:08:28,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670959821] [2022-12-06 05:08:28,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:08:28,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:08:28,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:28,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:08:28,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:08:28,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 05:08:28,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 968 transitions, 34722 flow. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:28,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:28,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 05:08:28,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:35,440 INFO L130 PetriNetUnfolder]: 6879/12810 cut-off events. [2022-12-06 05:08:35,440 INFO L131 PetriNetUnfolder]: For 1232579/1232579 co-relation queries the response was YES. [2022-12-06 05:08:35,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195244 conditions, 12810 events. 6879/12810 cut-off events. For 1232579/1232579 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 108621 event pairs, 2012 based on Foata normal form. 16/12824 useless extension candidates. Maximal degree in co-relation 194447. Up to 12130 conditions per place. [2022-12-06 05:08:35,662 INFO L137 encePairwiseOnDemand]: 26/60 looper letters, 742 selfloop transitions, 239 changer transitions 5/986 dead transitions. [2022-12-06 05:08:35,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 986 transitions, 36636 flow [2022-12-06 05:08:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:08:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:08:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2022-12-06 05:08:35,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18333333333333332 [2022-12-06 05:08:35,663 INFO L175 Difference]: Start difference. First operand has 454 places, 968 transitions, 34722 flow. Second operand 11 states and 121 transitions. [2022-12-06 05:08:35,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 986 transitions, 36636 flow [2022-12-06 05:08:41,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 986 transitions, 35494 flow, removed 37 selfloop flow, removed 11 redundant places. [2022-12-06 05:08:41,973 INFO L231 Difference]: Finished difference. Result has 450 places, 957 transitions, 33745 flow [2022-12-06 05:08:41,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=33264, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=33745, PETRI_PLACES=450, PETRI_TRANSITIONS=957} [2022-12-06 05:08:41,977 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 429 predicate places. [2022-12-06 05:08:41,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:41,977 INFO L89 Accepts]: Start accepts. Operand has 450 places, 957 transitions, 33745 flow [2022-12-06 05:08:41,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:41,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:41,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 450 places, 957 transitions, 33745 flow [2022-12-06 05:08:41,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 447 places, 957 transitions, 33745 flow [2022-12-06 05:08:43,756 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][214], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), 2317#true, Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), 2049#true, Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 5598#(and (< 10 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), 695#true, Black: 5653#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), 4396#true, Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, 608#true, Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 44#thread1EXITtrue, Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 5672#true, Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 5997#true, Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 6230#(and (<= (+ ~A~0.offset 4) (+ (* ~i_AB~0 4) ~B~0.offset)) (= ~A~0.offset 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4)))) (< (+ (* ~i_AB~0 4) ~B~0.offset) (+ 5 ~A~0.offset)) (= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4505#true, Black: 3677#(and (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 5991#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5966#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5890#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 5465#(and (<= ~Bn~0 2) (<= 1 ~i_BA~0)), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5472#(and (<= ~Bn~0 2) (<= 2 ~i_BA~0)), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4856#true, 5786#true, 3958#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), 5581#true, 1152#true, Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 1290#true, 2845#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), 3341#true, 5302#true, Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 4050#true, 1455#true, 2304#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 1642#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (or (< ~i_BA~0 ~Bn~0) (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))))), Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 6240#true, Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 5743#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 5705#(and (= ~B~0.offset 0) (= (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset) 0) (<= 6 ~An~0) (= (select (select |#memory_int| ~B~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset 4))) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4427#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 5754#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5733#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 48#thread2EXITtrue, Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), 3492#true, Black: 166#(= ~i_BA~0 0), 1569#true, 4958#true, 1681#true, Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 176#(= ~i_AB~0 0), 2956#true, Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), 4168#true, Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5492#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 6246#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (= (+ (* ~i_AB~0 4) ~A~0.offset) 4) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (not (<= (+ (* ~i_BA~0 4) ~B~0.offset) 3)) (<= (+ ~i_BA~0 1) ~Bn~0)), 3806#true, Black: 5558#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), Black: 5490#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5550#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 6117#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 2 ~Bn~0) (< 9 ~An~0) (= ~i_BA~0 1)), Black: 6003#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 10 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 3686#true, Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5792#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 5847#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 5858#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 5865#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), 2415#true]) [2022-12-06 05:08:43,756 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:08:43,756 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:08:43,756 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:08:43,756 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:08:43,993 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][214], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), 2317#true, Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), 2049#true, Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 5598#(and (< 10 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), 695#true, Black: 5653#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), 4396#true, Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, 608#true, Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 44#thread1EXITtrue, Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 5672#true, Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 5997#true, Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 6230#(and (<= (+ ~A~0.offset 4) (+ (* ~i_AB~0 4) ~B~0.offset)) (= ~A~0.offset 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4)))) (< (+ (* ~i_AB~0 4) ~B~0.offset) (+ 5 ~A~0.offset)) (= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4505#true, Black: 3677#(and (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 5991#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5966#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5890#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 5465#(and (<= ~Bn~0 2) (<= 1 ~i_BA~0)), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5472#(and (<= ~Bn~0 2) (<= 2 ~i_BA~0)), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4856#true, 5786#true, 3958#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), 5581#true, 1152#true, Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 1290#true, 2845#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), 3341#true, 5302#true, Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 4050#true, 1455#true, Black: 1642#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (or (< ~i_BA~0 ~Bn~0) (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))))), Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 6240#true, Black: 5743#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 5705#(and (= ~B~0.offset 0) (= (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset) 0) (<= 6 ~An~0) (= (select (select |#memory_int| ~B~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset 4))) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 4427#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 5754#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5733#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 48#thread2EXITtrue, Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), 3492#true, Black: 166#(= ~i_BA~0 0), 1569#true, 4958#true, 1681#true, Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 176#(= ~i_AB~0 0), 2956#true, Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), 4168#true, Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 6246#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (= (+ (* ~i_AB~0 4) ~A~0.offset) 4) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (not (<= (+ (* ~i_BA~0 4) ~B~0.offset) 3)) (<= (+ ~i_BA~0 1) ~Bn~0)), Black: 5492#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), 3806#true, Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), Black: 5558#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5490#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5550#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 2232#true, Black: 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 6117#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 2 ~Bn~0) (< 9 ~An~0) (= ~i_BA~0 1)), Black: 6003#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 10 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 3686#true, Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5792#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 5847#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 5858#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 5865#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), 2415#true]) [2022-12-06 05:08:43,993 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:08:43,993 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:08:43,993 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:08:43,993 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:08:44,259 INFO L130 PetriNetUnfolder]: 3055/7872 cut-off events. [2022-12-06 05:08:44,259 INFO L131 PetriNetUnfolder]: For 803344/805575 co-relation queries the response was YES. [2022-12-06 05:08:44,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116488 conditions, 7872 events. 3055/7872 cut-off events. For 803344/805575 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 85808 event pairs, 1244 based on Foata normal form. 395/7654 useless extension candidates. Maximal degree in co-relation 114991. Up to 2790 conditions per place. [2022-12-06 05:08:44,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 447 places, 957 transitions, 33745 flow [2022-12-06 05:08:44,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 3222 [2022-12-06 05:08:44,475 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:44,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2499 [2022-12-06 05:08:44,476 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 957 transitions, 33745 flow [2022-12-06 05:08:44,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:44,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:44,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:44,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-12-06 05:08:44,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-12-06 05:08:44,682 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:08:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1170082276, now seen corresponding path program 1 times [2022-12-06 05:08:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:44,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397313525] [2022-12-06 05:08:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:45,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397313525] [2022-12-06 05:08:45,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397313525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:45,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701595182] [2022-12-06 05:08:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:45,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:45,105 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:45,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-12-06 05:08:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:45,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 05:08:45,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:45,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:08:45,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:08:45,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-06 05:08:45,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:08:45,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:08:45,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:08:45,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:08:45,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-12-06 05:08:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:45,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:08:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:08:45,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701595182] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:08:45,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:08:45,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-06 05:08:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786891020] [2022-12-06 05:08:45,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:08:45,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:08:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:08:45,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=316, Unknown=2, NotChecked=0, Total=380 [2022-12-06 05:08:45,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 05:08:45,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 957 transitions, 33745 flow. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:08:45,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:45,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 05:08:45,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:54,117 INFO L130 PetriNetUnfolder]: 7557/14080 cut-off events. [2022-12-06 05:08:54,118 INFO L131 PetriNetUnfolder]: For 1376454/1376454 co-relation queries the response was YES. [2022-12-06 05:08:54,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211170 conditions, 14080 events. 7557/14080 cut-off events. For 1376454/1376454 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 121198 event pairs, 2751 based on Foata normal form. 90/14168 useless extension candidates. Maximal degree in co-relation 207594. Up to 11437 conditions per place. [2022-12-06 05:08:54,388 INFO L137 encePairwiseOnDemand]: 19/60 looper letters, 769 selfloop transitions, 437 changer transitions 4/1210 dead transitions. [2022-12-06 05:08:54,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 1210 transitions, 42763 flow [2022-12-06 05:08:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:08:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:08:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 190 transitions. [2022-12-06 05:08:54,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16666666666666666 [2022-12-06 05:08:54,389 INFO L175 Difference]: Start difference. First operand has 447 places, 957 transitions, 33745 flow. Second operand 19 states and 190 transitions. [2022-12-06 05:08:54,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 1210 transitions, 42763 flow [2022-12-06 05:09:01,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 1210 transitions, 42182 flow, removed 34 selfloop flow, removed 9 redundant places. [2022-12-06 05:09:01,888 INFO L231 Difference]: Finished difference. Result has 470 places, 1117 transitions, 39959 flow [2022-12-06 05:09:01,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=33244, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=39959, PETRI_PLACES=470, PETRI_TRANSITIONS=1117} [2022-12-06 05:09:01,889 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 449 predicate places. [2022-12-06 05:09:01,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:01,889 INFO L89 Accepts]: Start accepts. Operand has 470 places, 1117 transitions, 39959 flow [2022-12-06 05:09:01,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:01,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:01,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 470 places, 1117 transitions, 39959 flow [2022-12-06 05:09:01,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 470 places, 1117 transitions, 39959 flow [2022-12-06 05:09:04,034 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][226], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), 2049#true, Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 5598#(and (< 10 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), 695#true, Black: 5653#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), 4396#true, Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 44#thread1EXITtrue, Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 6230#(and (<= (+ ~A~0.offset 4) (+ (* ~i_AB~0 4) ~B~0.offset)) (= ~A~0.offset 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4)))) (< (+ (* ~i_AB~0 4) ~B~0.offset) (+ 5 ~A~0.offset)) (= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3677#(and (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), 4856#true, 3958#true, Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), 5581#true, Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, 3341#true, 4050#true, 1455#true, Black: 1642#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (or (< ~i_BA~0 ~Bn~0) (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))))), 2304#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 5743#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5705#(and (= ~B~0.offset 0) (= (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset) 0) (<= 6 ~An~0) (= (select (select |#memory_int| ~B~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset 4))) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 5754#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5733#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), 6346#true, Black: 166#(= ~i_BA~0 0), 1569#true, 1681#true, Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 176#(= ~i_AB~0 0), Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6246#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (= (+ (* ~i_AB~0 4) ~A~0.offset) 4) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (not (<= (+ (* ~i_BA~0 4) ~B~0.offset) 3)) (<= (+ ~i_BA~0 1) ~Bn~0)), 3806#true, Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5792#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 5847#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 5858#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5865#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), 2415#true, 2317#true, Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, 608#true, Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 5672#true, Black: 6417#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 6431#(or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 6451#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6424#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 5997#true, Black: 6438#(and (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 6453#(and (forall ((v_ArrVal_5727 (Array Int Int)) (v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5727 (Array Int Int)) (v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_5727 (Array Int Int)) (v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 6379#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 6386#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 6459#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 1)), Black: 6442#(and (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 6461#(and (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (< ~i_BA~0 ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 6469#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 3 ~An~0) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (not (= ~A~0.base ~B~0.base)) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 6457#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 1)), Black: 6465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (< 3 ~An~0) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 4505#true, Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 5991#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5966#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5890#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 5465#(and (<= ~Bn~0 2) (<= 1 ~i_BA~0)), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5472#(and (<= ~Bn~0 2) (<= 2 ~i_BA~0)), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 5786#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), 1152#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 1290#true, 2845#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), 5302#true, Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), 48#thread2EXITtrue, 3492#true, 4958#true, 2956#true, Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), 4168#true, Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5492#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 5558#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), Black: 5490#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5550#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 6117#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 2 ~Bn~0) (< 9 ~An~0) (= ~i_BA~0 1)), Black: 6003#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 10 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 3686#true, Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1))]) [2022-12-06 05:09:04,035 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:09:04,035 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:09:04,035 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:09:04,035 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:09:04,577 INFO L130 PetriNetUnfolder]: 3264/8531 cut-off events. [2022-12-06 05:09:04,577 INFO L131 PetriNetUnfolder]: For 896893/899255 co-relation queries the response was YES. [2022-12-06 05:09:04,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128979 conditions, 8531 events. 3264/8531 cut-off events. For 896893/899255 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 94650 event pairs, 1209 based on Foata normal form. 424/8366 useless extension candidates. Maximal degree in co-relation 126619. Up to 2900 conditions per place. [2022-12-06 05:09:04,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 470 places, 1117 transitions, 39959 flow [2022-12-06 05:09:04,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 3808 [2022-12-06 05:09:04,844 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:09:04,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:09:05,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:09:05,250 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:09:05,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3362 [2022-12-06 05:09:05,251 INFO L495 AbstractCegarLoop]: Abstraction has has 470 places, 1117 transitions, 40037 flow [2022-12-06 05:09:05,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:05,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:05,251 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:05,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-12-06 05:09:05,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:09:05,458 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:09:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1810487723, now seen corresponding path program 1 times [2022-12-06 05:09:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:05,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222872473] [2022-12-06 05:09:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:05,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:09:05,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:05,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222872473] [2022-12-06 05:09:05,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222872473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:09:05,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819199081] [2022-12-06 05:09:05,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:05,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:09:05,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:09:05,786 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:09:05,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-12-06 05:09:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:06,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:09:06,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:09:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:09:06,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:09:06,297 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:09:06,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:09:06,301 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:09:06,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-06 05:09:06,331 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-06 05:09:06,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-06 05:09:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:09:06,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819199081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:09:06,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:09:06,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 15 [2022-12-06 05:09:06,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343953331] [2022-12-06 05:09:06,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:09:06,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:09:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:06,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:09:06,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:09:06,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:09:06,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 1117 transitions, 40037 flow. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:06,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:06,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:09:06,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:14,396 INFO L130 PetriNetUnfolder]: 7486/13864 cut-off events. [2022-12-06 05:09:14,396 INFO L131 PetriNetUnfolder]: For 1404586/1404586 co-relation queries the response was YES. [2022-12-06 05:09:14,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215370 conditions, 13864 events. 7486/13864 cut-off events. For 1404586/1404586 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 117945 event pairs, 2843 based on Foata normal form. 8/13871 useless extension candidates. Maximal degree in co-relation 212360. Up to 13632 conditions per place. [2022-12-06 05:09:14,666 INFO L137 encePairwiseOnDemand]: 36/63 looper letters, 1002 selfloop transitions, 132 changer transitions 7/1141 dead transitions. [2022-12-06 05:09:14,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 1141 transitions, 42564 flow [2022-12-06 05:09:14,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:09:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:09:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2022-12-06 05:09:14,667 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15728715728715728 [2022-12-06 05:09:14,667 INFO L175 Difference]: Start difference. First operand has 470 places, 1117 transitions, 40037 flow. Second operand 11 states and 109 transitions. [2022-12-06 05:09:14,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 1141 transitions, 42564 flow [2022-12-06 05:09:24,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 1141 transitions, 41566 flow, removed 486 selfloop flow, removed 2 redundant places. [2022-12-06 05:09:24,321 INFO L231 Difference]: Finished difference. Result has 478 places, 1117 transitions, 39320 flow [2022-12-06 05:09:24,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=38825, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=987, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=39320, PETRI_PLACES=478, PETRI_TRANSITIONS=1117} [2022-12-06 05:09:24,322 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 457 predicate places. [2022-12-06 05:09:24,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:24,322 INFO L89 Accepts]: Start accepts. Operand has 478 places, 1117 transitions, 39320 flow [2022-12-06 05:09:24,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:24,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:24,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 478 places, 1117 transitions, 39320 flow [2022-12-06 05:09:24,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 474 places, 1117 transitions, 39320 flow [2022-12-06 05:09:26,525 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][165], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), 2317#true, Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), 2049#true, Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 5598#(and (< 10 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), 695#true, Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 5653#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), 4396#true, Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, 608#true, Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 44#thread1EXITtrue, 5672#true, Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 6417#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 6431#(or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6451#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 5997#true, Black: 6424#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 6438#(and (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 6453#(and (forall ((v_ArrVal_5727 (Array Int Int)) (v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5727 (Array Int Int)) (v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_5727 (Array Int Int)) (v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 6379#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 6386#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 6459#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 1)), Black: 6442#(and (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 6461#(and (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (< ~i_BA~0 ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 6469#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 3 ~An~0) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (not (= ~A~0.base ~B~0.base)) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 6457#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 1)), Black: 6465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (< 3 ~An~0) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 6230#(and (<= (+ ~A~0.offset 4) (+ (* ~i_AB~0 4) ~B~0.offset)) (= ~A~0.offset 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4)))) (< (+ (* ~i_AB~0 4) ~B~0.offset) (+ 5 ~A~0.offset)) (= ~i_BA~0 0) (= ~i_AB~0 1)), 4505#true, Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 5991#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5890#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5465#(and (<= ~Bn~0 2) (<= 1 ~i_BA~0)), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5472#(and (<= ~Bn~0 2) (<= 2 ~i_BA~0)), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 4856#true, 5786#true, 3958#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), 5581#true, 1152#true, Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 1290#true, 2845#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), 3341#true, Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 5302#true, 4050#true, 1455#true, Black: 1642#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (or (< ~i_BA~0 ~Bn~0) (forall ((~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))))), 2304#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 5743#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5705#(and (= ~B~0.offset 0) (= (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset) 0) (<= 6 ~An~0) (= (select (select |#memory_int| ~B~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset 4))) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 5754#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5733#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 48#thread2EXITtrue, Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), 6346#true, 3492#true, Black: 166#(= ~i_BA~0 0), 1569#true, 4958#true, 1681#true, Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 176#(= ~i_AB~0 0), Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), 2956#true, Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), 4168#true, Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6246#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (= (+ (* ~i_AB~0 4) ~A~0.offset) 4) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (not (<= (+ (* ~i_BA~0 4) ~B~0.offset) 3)) (<= (+ ~i_BA~0 1) ~Bn~0)), Black: 5492#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), 6485#true, Black: 5558#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), 3806#true, Black: 5490#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5550#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 6117#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 2 ~Bn~0) (< 9 ~An~0) (= ~i_BA~0 1)), Black: 6003#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 10 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), 3686#true, Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5792#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 5847#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 5858#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5865#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), 2415#true]) [2022-12-06 05:09:26,526 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:09:26,526 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:09:26,526 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:09:26,526 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:09:26,974 INFO L130 PetriNetUnfolder]: 3236/8392 cut-off events. [2022-12-06 05:09:26,974 INFO L131 PetriNetUnfolder]: For 830368/832576 co-relation queries the response was YES. [2022-12-06 05:09:27,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124373 conditions, 8392 events. 3236/8392 cut-off events. For 830368/832576 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 92524 event pairs, 1178 based on Foata normal form. 381/8193 useless extension candidates. Maximal degree in co-relation 122799. Up to 2809 conditions per place. [2022-12-06 05:09:27,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 474 places, 1117 transitions, 39320 flow [2022-12-06 05:09:27,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 3804 [2022-12-06 05:09:27,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:09:27,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:09:27,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-06 05:09:35,157 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:09:35,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10836 [2022-12-06 05:09:35,158 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 1117 transitions, 39413 flow [2022-12-06 05:09:35,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:35,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:35,158 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:35,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-12-06 05:09:35,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:09:35,364 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:09:35,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:35,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2031312798, now seen corresponding path program 1 times [2022-12-06 05:09:35,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:35,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971823239] [2022-12-06 05:09:35,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:35,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:09:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:35,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971823239] [2022-12-06 05:09:35,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971823239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:09:35,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375607430] [2022-12-06 05:09:35,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:35,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:09:35,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:09:35,684 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:09:35,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-12-06 05:09:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:36,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 05:09:36,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:09:36,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:09:36,073 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-06 05:09:36,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-06 05:09:36,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:09:36,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:09:36,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:09:36,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 05:09:36,121 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:09:36,122 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2022-12-06 05:09:36,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:09:36,141 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-06 05:09:36,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 33 [2022-12-06 05:09:36,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:09:36,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 05:09:36,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:09:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:09:36,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:09:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:09:36,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375607430] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:09:36,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:09:36,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-12-06 05:09:36,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047018943] [2022-12-06 05:09:36,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:09:36,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:09:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:36,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:09:36,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=190, Unknown=4, NotChecked=0, Total=240 [2022-12-06 05:09:36,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 05:09:36,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 1117 transitions, 39413 flow. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:36,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:36,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 05:09:36,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:44,891 INFO L130 PetriNetUnfolder]: 7624/14179 cut-off events. [2022-12-06 05:09:44,892 INFO L131 PetriNetUnfolder]: For 1357229/1357229 co-relation queries the response was YES. [2022-12-06 05:09:45,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213758 conditions, 14179 events. 7624/14179 cut-off events. For 1357229/1357229 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 122323 event pairs, 2795 based on Foata normal form. 20/14198 useless extension candidates. Maximal degree in co-relation 210774. Up to 12964 conditions per place. [2022-12-06 05:09:45,167 INFO L137 encePairwiseOnDemand]: 31/67 looper letters, 956 selfloop transitions, 311 changer transitions 32/1299 dead transitions. [2022-12-06 05:09:45,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 1299 transitions, 47184 flow [2022-12-06 05:09:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:09:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:09:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 160 transitions. [2022-12-06 05:09:45,168 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14047410008779632 [2022-12-06 05:09:45,168 INFO L175 Difference]: Start difference. First operand has 474 places, 1117 transitions, 39413 flow. Second operand 17 states and 160 transitions. [2022-12-06 05:09:45,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 1299 transitions, 47184 flow [2022-12-06 05:09:52,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 1299 transitions, 46807 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-12-06 05:09:52,606 INFO L231 Difference]: Finished difference. Result has 492 places, 1199 transitions, 43176 flow [2022-12-06 05:09:52,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=39049, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=43176, PETRI_PLACES=492, PETRI_TRANSITIONS=1199} [2022-12-06 05:09:52,607 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 471 predicate places. [2022-12-06 05:09:52,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:52,608 INFO L89 Accepts]: Start accepts. Operand has 492 places, 1199 transitions, 43176 flow [2022-12-06 05:09:52,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:52,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:52,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 492 places, 1199 transitions, 43176 flow [2022-12-06 05:09:52,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 489 places, 1199 transitions, 43176 flow [2022-12-06 05:09:54,970 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_8| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_8| 0)) (.cse3 (< v_~i_BA~0_In_6 v_~Bn~0_In_5)) (.cse2 (< v_~i_BA~0_In_6 v_~An~0_In_4))) (or (and .cse0 .cse1 (= |v_thread2Thread1of1ForFork0_#t~mem5_Out_10| |v_thread2Thread1of1ForFork0_#t~mem5_In_2|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_8| |v_thread2Thread1of1ForFork0_#t~mem4_In_2|)) (and .cse0 .cse1 .cse3 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_6 4))) (= (select (select |v_#memory_int_In_16| v_~B~0.base_In_2) (+ .cse4 v_~B~0.offset_In_2)) (select (select |v_#memory_int_In_16| v_~A~0.base_In_4) (+ .cse4 v_~A~0.offset_In_4)))))))) InVars {~A~0.base=v_~A~0.base_In_4, ~A~0.offset=v_~A~0.offset_In_4, ~B~0.base=v_~B~0.base_In_2, #memory_int=|v_#memory_int_In_16|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_2|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_2|, ~An~0=v_~An~0_In_4} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_8|, ~A~0.base=v_~A~0.base_In_4, ~B~0.base=v_~B~0.base_In_2, ~An~0=v_~An~0_In_4, ~A~0.offset=v_~A~0.offset_In_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_8|, #memory_int=|v_#memory_int_In_16|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_8|, ~i_BA~0=v_~i_BA~0_In_6, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_10|, ~B~0.offset=v_~B~0.offset_In_2, ~Bn~0=v_~Bn~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][214], [Black: 4592#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 4605#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (forall ((v_ArrVal_3811 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3811) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))))))), Black: 4509#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 457#(and (<= 0 ~i_BA~0) (<= ~i_BA~0 0) (= ~i_AB~0 1)), 2049#true, Black: 1465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 1521#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 4288#true, Black: 541#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_AB~0 0)), Black: 5598#(and (< 10 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), 695#true, Black: 5653#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), 4396#true, Black: 6701#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5889 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5889) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5889) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_5889 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5889) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5889) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5889) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5889) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (forall ((v_ArrVal_5889 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5889) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5889) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 6713#(and (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (< 3 (+ (* ~i_BA~0 4) ~B~0.offset)) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (exists ((~i_BA~0 Int) (~A~0.base Int)) (and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (* ~i_AB~0 4))) (<= (* ~i_BA~0 4) 4) (not (<= (* ~i_BA~0 4) 3)) (not (= (select (select |#memory_int| ~A~0.base) (* ~i_BA~0 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 6715#(and (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 6703#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))), Black: 6711#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 6674#(not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 4158#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 6678#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0))), Black: 4118#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 44#thread1EXITtrue, Black: 4156#(and (= ~B~0.offset 0) (<= ~A~0.offset 0) (<= 7 ~An~0) (<= 2 ~Bn~0) (<= 0 ~A~0.offset) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (= ~i_AB~0 1)), Black: 4150#(and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| ~A~0.offset) (= ~B~0.offset 0) (<= ~A~0.offset |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 7 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3146#(= (* ~i_BA~0 4) (* ~i_AB~0 4)), Black: 2067#(and (< 4 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1)), Black: 603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 1 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 ~i_BA~0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 1)), Black: 6230#(and (<= (+ ~A~0.offset 4) (+ (* ~i_AB~0 4) ~B~0.offset)) (= ~A~0.offset 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4)))) (< (+ (* ~i_AB~0 4) ~B~0.offset) (+ 5 ~A~0.offset)) (= ~i_BA~0 0) (= ~i_AB~0 1)), Black: 3656#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5214#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5144#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 7)) (<= ~i_BA~0 2) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~Bn~0 ~i_BA~0)), 6600#true, 4856#true, 3958#true, Black: 1142#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), 5581#true, Black: 1119#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 1789#true, 3341#true, 4050#true, 1455#true, 2304#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 5743#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2694#(and (< ~i_BA~0 ~i_AB~0) (<= ~i_AB~0 (+ ~i_BA~0 1))), Black: 4723#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 5705#(and (= ~B~0.offset 0) (= (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset) 0) (<= 6 ~An~0) (= (select (select |#memory_int| ~B~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* (div (- ~B~0.offset) 4) 4) ~A~0.offset 4))) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 2637#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 4744#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4669#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 5754#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4670#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4674#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 5 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 5733#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 157#(and (= ~An~0 0) (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), Black: 158#(and (<= ~i_AB~0 ~i_BA~0) (= ~i_BA~0 0) (<= 0 ~i_AB~0)), 6346#true, Black: 166#(= ~i_BA~0 0), 1569#true, 1681#true, Black: 3219#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 176#(= ~i_AB~0 0), Black: 674#(and (<= ~i_BA~0 (+ ~i_AB~0 1)) (< ~i_AB~0 ~i_BA~0)), Black: 2151#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 1 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 612#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 183#(and (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_AB~0 0)), Black: 4173#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 4174#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4)) (<= ~i_BA~0 0)), Black: 4238#(and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 4175#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 4172#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 2) ~Bn~0) (<= 0 ~i_BA~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3)) (<= ~i_BA~0 0)), Black: 2735#(and (<= ~An~0 2) (<= 2 ~i_AB~0)), Black: 2725#(and (<= 1 ~i_AB~0) (<= ~An~0 2)), Black: 193#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 195#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~Bn~0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 1 ~An~0) (= ~i_BA~0 0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6246#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~i_BA~0 4) ~An~0) (= (+ (* ~i_AB~0 4) ~A~0.offset) 4) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (not (<= (+ (* ~i_BA~0 4) ~B~0.offset) 3)) (<= (+ ~i_BA~0 1) ~Bn~0)), 3806#true, Black: 3783#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_16) ~B~0.base v_DerPreprocessor_17) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) v_DerPreprocessor_16))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base) (<= (+ 2 ~B~0.base) ~A~0.base)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3766#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 ~i_AB~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 3762#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))), Black: 3785#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (forall ((v_ArrVal_3065 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< ~i_BA~0 (+ ~i_AB~0 1))) (forall ((v_ArrVal_3065 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3065) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 1225#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3791#(and (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< ~i_BA~0 (+ ~i_AB~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))), Black: 3751#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 437#true, Black: 222#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset))) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), 3157#true, Black: 234#(and (= ~A~0.offset 0) (= (+ (* ~i_BA~0 4) ~B~0.offset) 0) (<= 0 ~i_BA~0) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= ~i_BA~0 0)), Black: 1763#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 4766#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 1770#(forall ((v_ArrVal_1210 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1210) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)))))), Black: 1777#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5792#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 5847#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 5858#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5865#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), 2415#true, 2317#true, Black: 2257#(and (<= ~i_AB~0 2) (= ~i_BA~0 2) (<= 2 ~i_AB~0)), Black: 2236#(and (<= ~i_AB~0 2) (= ~i_BA~0 0) (<= 2 ~i_AB~0)), Black: 2237#(and (< ~i_BA~0 (+ ~i_AB~0 1)) (<= ~i_AB~0 ~i_BA~0)), Black: 5307#(and (< ~i_AB~0 (+ ~i_BA~0 1)) (<= ~i_BA~0 ~i_AB~0)), Black: 5306#(and (<= (+ ~i_AB~0 1) ~i_BA~0) (<= ~i_BA~0 (+ ~i_AB~0 1))), Black: 5335#(and (= ~i_BA~0 2) (= ~i_AB~0 2)), Black: 4384#(and (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4377#(forall ((v_ArrVal_3586 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3586) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))), Black: 4290#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 4291#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4292#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (= ~i_BA~0 0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 4370#(or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))))), Black: 699#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= ~i_AB~0 0)), Black: 799#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (= ~i_AB~0 0)), Black: 797#(and (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))))) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_~B~0.base_87 Int)) (or (not (= (select |#valid| v_~B~0.base_87) 0)) (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_AB~0 4))) (not (< v_~B~0.base_87 |#StackHeapBarrier|)) (not (= (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) v_~B~0.base_87) (* ~i_BA~0 4)) (select (select (store (store (store |#memory_int| v_~B~0.base_87 (store (select |#memory_int| v_~B~0.base_87) 0 v_ArrVal_445)) |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_446) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))), Black: 768#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 4#L81-1true, 608#true, Black: 3808#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3903#(and (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))), Black: 3874#(= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 5672#true, Black: 6417#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 6431#(or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 6451#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_AB~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6424#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 5997#true, Black: 6438#(and (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 6453#(and (forall ((v_ArrVal_5727 (Array Int Int)) (v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_BA~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5727 (Array Int Int)) (v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_5727 (Array Int Int)) (v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5727) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i_AB~0 4) 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 6379#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 6386#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 6459#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 1)), Black: 6442#(and (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))))), Black: 6461#(and (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))))) (< ~i_BA~0 ~An~0) (forall ((v_ArrVal_5728 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((v_ArrVal_5728 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5728) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 255#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 ~i_BA~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_BA~0 0)), Black: 6469#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 3 ~An~0) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (not (= ~A~0.base ~B~0.base)) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 6457#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< 3 ~An~0) (not (= ~A~0.base ~B~0.base)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 1)), Black: 6465#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (< 3 ~An~0) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset))) (<= 2 ~Bn~0) (= ~i_BA~0 1) (= ~i_AB~0 1)), Black: 4890#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= ~B~0.offset 0) (< 5 ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1)), Black: 4952#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 4948#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (<= 2 ~i_AB~0) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 4862#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (<= 2 ~i_AB~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (= (+ (* ~i_AB~0 4) ~B~0.offset) 8)), Black: 4950#(and (<= ~Bn~0 2) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~i_AB~0 2) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 6 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (or (= (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset (- 4)))) (not (= (+ (* ~i_AB~0 4) ~A~0.offset) 8))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 4505#true, Black: 2378#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), Black: 1888#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 2399#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1892#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5890#(and (= ~B~0.offset 0) (<= (+ 7 ~i_BA~0) ~An~0) (<= (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_AB~0 4) 4) (= ~i_BA~0 1) (= (+ (* ~i_BA~0 4) ~B~0.offset) (+ ~A~0.offset 4))), Black: 1877#(and (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5465#(and (<= ~Bn~0 2) (<= 1 ~i_BA~0)), Black: 2408#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 5472#(and (<= ~Bn~0 2) (<= 2 ~i_BA~0)), Black: 3421#(and (< (+ ~i_BA~0 1) ~An~0) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4)) (< (+ ~i_BA~0 1) ~Bn~0)), Black: 1881#(and (= (* ~i_BA~0 4) (* ~i_AB~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0) (<= 2 ~An~0)), Black: 3428#(and (< (+ ~i_BA~0 1) ~An~0) (< (+ ~i_BA~0 1) ~Bn~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3433#(and (forall ((~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3414#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), 5786#true, Black: 1368#(and (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~An~0)) (forall ((~B~0.offset Int) (~B~0.base Int)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))))) (or (forall ((~B~0.offset Int) (~B~0.base Int)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (< ~i_BA~0 ~Bn~0))), 1152#true, Black: 2914#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), 1290#true, 2845#true, Black: 2925#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 2907#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), 5302#true, Black: 4487#(and (or (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_3700 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_3700 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3700) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 4406#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (< 5 ~An~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= ~i_AB~0 0)), Black: 4469#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 4477#(or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))), Black: 4494#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0)))), 48#thread2EXITtrue, 3492#true, 4958#true, Black: 362#(and (= ~A~0.offset 0) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~Bn~0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~An~0) (= ~i_BA~0 0)), 2956#true, 4168#true, Black: 5047#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)))) (and (< (+ ~i_BA~0 1) ~An~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4))) (< (+ ~i_BA~0 1) ~Bn~0))) (or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))) (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5040#(and (or (< (+ ~i_BA~0 1) ~An~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (or (< (+ ~i_BA~0 1) ~Bn~0) (forall ((v_ArrVal_4369 (Array Int Int))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)))))) (forall ((v_ArrVal_4369 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4369) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4))))))), Black: 5026#(or (and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)) (not (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))))), Black: 2488#(and (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~Bn~0)) (or (forall ((v_ArrVal_1823 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4))))) (< (+ ~i_BA~0 1) ~An~0)) (forall ((v_ArrVal_1823 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 4)))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))), Black: 5492#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~Bn~0) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3))), Black: 2501#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= (+ ~i_BA~0 1) ~An~0) (<= 2 ~Bn~0) (= ~i_BA~0 1) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~i_AB~0 ~i_BA~0))), Black: 5558#(and (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 5490#(and (<= (+ ~i_BA~0 5) ~An~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ (* ~i_BA~0 4) ~A~0.offset) 4) (<= (+ ~i_BA~0 1) ~Bn~0) (<= ~i_AB~0 1) (not (<= (+ (* ~i_BA~0 4) ~A~0.offset) 3)) (not (<= (+ (* ~i_AB~0 4) ~A~0.offset) 3))), Black: 5550#(and (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (< ~i_BA~0 ~Bn~0) (< ~i_BA~0 ~An~0)), Black: 4031#(and (< ~i_AB~0 ~Bn~0) (< ~i_AB~0 ~An~0)), Black: 3976#(and (<= 2 ~Bn~0) (< 8 ~An~0) (<= ~i_AB~0 1)), Black: 6117#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset))) (<= 2 ~Bn~0) (< 9 ~An~0) (= ~i_BA~0 1)), Black: 6003#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 10 ~An~0) (= ~i_BA~0 0) (<= 2 ~Bn~0) (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~B~0.base) 4))), Black: 3051#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset)))))) (= (* ~i_BA~0 4) (* ~i_AB~0 4))), Black: 3049#(and (forall ((~B~0.base Int)) (or (= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i_BA~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ (* ~i_BA~0 4) ~B~0.offset 4)))))) (= (* ~i_AB~0 4) (+ (* ~i_BA~0 4) 4))), Black: 3022#(= |thread1Thread1of1ForFork1_#t~mem1| (select (select |#memory_int| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset))), 3686#true, Black: 1962#(and (or (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base) (select |#memory_int| ~A~0.base)) (= (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) (+ ~B~0.offset 4)) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset 4))) (= (select (select |#memory_int| ~B~0.base) ~B~0.offset) (select (select (store (store (store (store (store (store |#memory_int| ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~A~0.base v_DerPreprocessor_4) ~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|)) ~B~0.base) ~B~0.offset)))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t1~0#1.base|))) (= ~A~0.base ~B~0.base)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i_BA~0 0) (= ~i_AB~0 0)), Black: 3518#(and (< 6 ~An~0) (<= 2 ~Bn~0) (<= ~i_AB~0 1))]) [2022-12-06 05:09:54,971 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:09:54,971 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:09:54,971 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:09:54,971 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:09:55,431 INFO L130 PetriNetUnfolder]: 3300/8608 cut-off events. [2022-12-06 05:09:55,432 INFO L131 PetriNetUnfolder]: For 912296/914491 co-relation queries the response was YES. [2022-12-06 05:09:55,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130378 conditions, 8608 events. 3300/8608 cut-off events. For 912296/914491 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 95559 event pairs, 1162 based on Foata normal form. 355/8376 useless extension candidates. Maximal degree in co-relation 128771. Up to 2889 conditions per place. [2022-12-06 05:09:55,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 489 places, 1199 transitions, 43176 flow [2022-12-06 05:09:55,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 3904 [2022-12-06 05:09:55,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [670] L47-5-->L47-5: Formula: (let ((.cse0 (select |v_#memory_int_607| v_~A~0.base_284)) (.cse2 (select |v_#memory_int_607| v_~B~0.base_269))) (and (= (+ 2 v_~i_AB~0_385) v_~i_AB~0_383) (let ((.cse1 (* v_~i_AB~0_383 4))) (= (select .cse0 (+ .cse1 v_~A~0.offset_284 (- 4))) (select .cse2 (+ .cse1 v_~B~0.offset_269 (- 4))))) (< v_~i_AB~0_383 (+ v_~Bn~0_252 1)) (< v_~i_AB~0_383 (+ v_~An~0_232 1)) (let ((.cse3 (* v_~i_AB~0_385 4))) (= (select .cse0 (+ v_~A~0.offset_284 .cse3)) (select .cse2 (+ v_~B~0.offset_269 .cse3)))))) InVars {~A~0.base=v_~A~0.base_284, ~B~0.base=v_~B~0.base_269, ~A~0.offset=v_~A~0.offset_284, ~i_AB~0=v_~i_AB~0_385, #memory_int=|v_#memory_int_607|, ~B~0.offset=v_~B~0.offset_269, ~Bn~0=v_~Bn~0_252, ~An~0=v_~An~0_232} OutVars{~A~0.base=v_~A~0.base_284, ~B~0.base=v_~B~0.base_269, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_306|, ~A~0.offset=v_~A~0.offset_284, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_214|, ~i_AB~0=v_~i_AB~0_383, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_165|, #memory_int=|v_#memory_int_607|, ~B~0.offset=v_~B~0.offset_269, ~Bn~0=v_~Bn~0_252, ~An~0=v_~An~0_232} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 05:09:55,811 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:09:55,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3204 [2022-12-06 05:09:55,811 INFO L495 AbstractCegarLoop]: Abstraction has has 488 places, 1198 transitions, 43156 flow [2022-12-06 05:09:55,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:55,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:55,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:55,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-12-06 05:09:56,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:09:56,018 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:09:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:56,018 INFO L85 PathProgramCache]: Analyzing trace with hash -825877828, now seen corresponding path program 1 times [2022-12-06 05:09:56,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:56,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466446415] [2022-12-06 05:09:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:09:56,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:56,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466446415] [2022-12-06 05:09:56,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466446415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:09:56,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452010870] [2022-12-06 05:09:56,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:56,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:09:56,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:09:56,247 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:09:56,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-12-06 05:09:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:56,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 05:09:56,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:09:56,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:09:56,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:09:56,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-06 05:09:56,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:09:56,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 05:09:56,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:09:56,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:09:56,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-12-06 05:09:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:09:56,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:09:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:09:57,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452010870] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:09:57,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:09:57,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 05:09:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402908576] [2022-12-06 05:09:57,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:09:57,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:09:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:57,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:09:57,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=217, Unknown=3, NotChecked=0, Total=272 [2022-12-06 05:09:57,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 05:09:57,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 1198 transitions, 43156 flow. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:09:57,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:57,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 05:09:57,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:57,896 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| c_~A~0.base)) (.cse18 (* c_~i_AB~0 4))) (let ((.cse16 (* c_~i_BA~0 4)) (.cse12 (+ c_~B~0.offset .cse18)) (.cse14 (select .cse10 (+ c_~A~0.offset .cse18))) (.cse7 (select .cse10 (+ c_~A~0.offset 4 .cse18))) (.cse8 (+ 4 c_~B~0.offset .cse18)) (.cse17 (+ c_~i_BA~0 1))) (let ((.cse0 (< .cse17 c_~Bn~0)) (.cse2 (forall ((v_ArrVal_5990 (Array Int Int))) (not (= .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5990) c_~B~0.base) .cse8))))) (.cse9 (< .cse17 c_~An~0)) (.cse1 (forall ((v_ArrVal_5990 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5990) c_~B~0.base) .cse12) .cse14)))) (.cse4 (+ c_~A~0.offset .cse16 4)) (.cse6 (+ .cse16 4 c_~B~0.offset))) (and (or .cse0 .cse1) (or .cse0 .cse2) (forall ((v_ArrVal_5990 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5990))) (let ((.cse5 (select .cse3 c_~B~0.base))) (or (= (select (select .cse3 c_~A~0.base) .cse4) (select .cse5 .cse6)) (not (= .cse7 (select .cse5 .cse8))))))) (let ((.cse11 (select |c_#memory_int| c_~B~0.base))) (or (and .cse9 .cse0 (= (select .cse10 .cse4) (select .cse11 .cse6))) (not (= |c_thread1Thread1of1ForFork1_#t~mem1| (select .cse11 .cse12))))) (or .cse9 .cse2) (or .cse9 .cse1) (forall ((v_ArrVal_5990 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5990))) (let ((.cse13 (select .cse15 c_~B~0.base))) (or (not (= (select .cse13 .cse12) .cse14)) (= (select (select .cse15 c_~A~0.base) .cse4) (select .cse13 .cse6)))))))))) is different from false