/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 09:26:42,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 09:26:42,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 09:26:43,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 09:26:43,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 09:26:43,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 09:26:43,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 09:26:43,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 09:26:43,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 09:26:43,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 09:26:43,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 09:26:43,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 09:26:43,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 09:26:43,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 09:26:43,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 09:26:43,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 09:26:43,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 09:26:43,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 09:26:43,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 09:26:43,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 09:26:43,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 09:26:43,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 09:26:43,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 09:26:43,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 09:26:43,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 09:26:43,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 09:26:43,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 09:26:43,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 09:26:43,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 09:26:43,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 09:26:43,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 09:26:43,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 09:26:43,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 09:26:43,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 09:26:43,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 09:26:43,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 09:26:43,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 09:26:43,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 09:26:43,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 09:26:43,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 09:26:43,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 09:26:43,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 09:26:43,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 09:26:43,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 09:26:43,104 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 09:26:43,104 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 09:26:43,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 09:26:43,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 09:26:43,105 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 09:26:43,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 09:26:43,105 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 09:26:43,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 09:26:43,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 09:26:43,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 09:26:43,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 09:26:43,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 09:26:43,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 09:26:43,107 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 09:26:43,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 09:26:43,107 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 09:26:43,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 09:26:43,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 09:26:43,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 09:26:43,108 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 09:26:43,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 09:26:43,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 09:26:43,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 09:26:43,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 09:26:43,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 09:26:43,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 09:26:43,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 09:26:43,110 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 09:26:43,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 09:26:43,110 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 09:26:43,110 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-01-19 09:26:43,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 09:26:43,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 09:26:43,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 09:26:43,344 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 09:26:43,346 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 09:26:43,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-01-19 09:26:43,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95241ff10/432bc4757a064bb1a7499a5c19af402f/FLAG7dcac5128 [2022-01-19 09:26:43,811 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 09:26:43,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-01-19 09:26:43,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95241ff10/432bc4757a064bb1a7499a5c19af402f/FLAG7dcac5128 [2022-01-19 09:26:44,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95241ff10/432bc4757a064bb1a7499a5c19af402f [2022-01-19 09:26:44,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 09:26:44,210 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 09:26:44,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 09:26:44,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 09:26:44,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 09:26:44,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43126d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44, skipping insertion in model container [2022-01-19 09:26:44,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 09:26:44,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 09:26:44,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[2975,2988] [2022-01-19 09:26:44,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 09:26:44,440 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 09:26:44,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[2975,2988] [2022-01-19 09:26:44,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 09:26:44,477 INFO L208 MainTranslator]: Completed translation [2022-01-19 09:26:44,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44 WrapperNode [2022-01-19 09:26:44,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 09:26:44,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 09:26:44,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 09:26:44,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 09:26:44,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,537 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 204 [2022-01-19 09:26:44,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 09:26:44,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 09:26:44,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 09:26:44,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 09:26:44,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 09:26:44,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 09:26:44,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 09:26:44,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 09:26:44,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (1/1) ... [2022-01-19 09:26:44,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 09:26:44,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:26:44,612 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-01-19 09:26:44,620 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-01-19 09:26:44,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 09:26:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 09:26:44,652 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 09:26:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 09:26:44,652 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 09:26:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 09:26:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 09:26:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 09:26:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 09:26:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 09:26:44,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 09:26:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 09:26:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 09:26:44,656 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 09:26:44,757 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 09:26:44,758 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 09:26:45,088 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 09:26:45,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 09:26:45,099 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 09:26:45,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 09:26:45 BoogieIcfgContainer [2022-01-19 09:26:45,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 09:26:45,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 09:26:45,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 09:26:45,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 09:26:45,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 09:26:44" (1/3) ... [2022-01-19 09:26:45,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36974521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 09:26:45, skipping insertion in model container [2022-01-19 09:26:45,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:26:44" (2/3) ... [2022-01-19 09:26:45,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36974521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 09:26:45, skipping insertion in model container [2022-01-19 09:26:45,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 09:26:45" (3/3) ... [2022-01-19 09:26:45,107 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2022-01-19 09:26:45,111 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 09:26:45,111 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 09:26:45,111 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 09:26:45,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,174 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,174 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,174 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,174 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,174 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,175 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,175 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,175 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,175 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,175 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,175 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,175 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,177 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,177 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,177 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,177 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,177 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,179 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,179 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,179 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,179 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,179 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,179 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,180 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,180 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,180 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,180 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,180 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,211 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,211 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:26:45,219 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 09:26:45,256 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 09:26:45,262 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 09:26:45,263 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 09:26:45,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 252 places, 269 transitions, 554 flow [2022-01-19 09:26:45,361 INFO L129 PetriNetUnfolder]: 24/267 cut-off events. [2022-01-19 09:26:45,361 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 09:26:45,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 267 events. 24/267 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 514 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 171. Up to 2 conditions per place. [2022-01-19 09:26:45,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 269 transitions, 554 flow [2022-01-19 09:26:45,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 258 transitions, 528 flow [2022-01-19 09:26:45,406 INFO L129 PetriNetUnfolder]: 20/215 cut-off events. [2022-01-19 09:26:45,407 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 09:26:45,407 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:45,407 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:45,408 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:45,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2100965146, now seen corresponding path program 1 times [2022-01-19 09:26:45,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:45,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533179840] [2022-01-19 09:26:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:45,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:45,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:45,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533179840] [2022-01-19 09:26:45,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533179840] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:45,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:45,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 09:26:45,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856798299] [2022-01-19 09:26:45,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:45,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 09:26:45,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:45,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 09:26:45,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 09:26:45,695 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 269 [2022-01-19 09:26:45,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 258 transitions, 528 flow. Second operand has 2 states, 2 states have (on average 249.5) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:45,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:45,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 269 [2022-01-19 09:26:45,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:45,745 INFO L129 PetriNetUnfolder]: 7/241 cut-off events. [2022-01-19 09:26:45,745 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 09:26:45,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 241 events. 7/241 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 482 event pairs, 0 based on Foata normal form. 20/240 useless extension candidates. Maximal degree in co-relation 160. Up to 5 conditions per place. [2022-01-19 09:26:45,748 INFO L132 encePairwiseOnDemand]: 252/269 looper letters, 4 selfloop transitions, 0 changer transitions 4/241 dead transitions. [2022-01-19 09:26:45,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 241 transitions, 502 flow [2022-01-19 09:26:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 09:26:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 09:26:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 515 transitions. [2022-01-19 09:26:45,767 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9572490706319703 [2022-01-19 09:26:45,767 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 515 transitions. [2022-01-19 09:26:45,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 515 transitions. [2022-01-19 09:26:45,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:45,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 515 transitions. [2022-01-19 09:26:45,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 257.5) internal successors, (515), 2 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:45,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:45,791 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:45,792 INFO L186 Difference]: Start difference. First operand has 241 places, 258 transitions, 528 flow. Second operand 2 states and 515 transitions. [2022-01-19 09:26:45,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 241 transitions, 502 flow [2022-01-19 09:26:45,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 241 transitions, 494 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 09:26:45,800 INFO L242 Difference]: Finished difference. Result has 238 places, 237 transitions, 478 flow [2022-01-19 09:26:45,802 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=478, PETRI_PLACES=238, PETRI_TRANSITIONS=237} [2022-01-19 09:26:45,804 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, -3 predicate places. [2022-01-19 09:26:45,805 INFO L470 AbstractCegarLoop]: Abstraction has has 238 places, 237 transitions, 478 flow [2022-01-19 09:26:45,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 249.5) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:45,805 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:45,805 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:45,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 09:26:45,806 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:45,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:45,807 INFO L85 PathProgramCache]: Analyzing trace with hash -381179899, now seen corresponding path program 1 times [2022-01-19 09:26:45,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:45,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466974590] [2022-01-19 09:26:45,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:45,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:46,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:46,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466974590] [2022-01-19 09:26:46,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466974590] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:46,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:46,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 09:26:46,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131178136] [2022-01-19 09:26:46,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:46,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 09:26:46,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:46,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 09:26:46,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 09:26:46,093 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 269 [2022-01-19 09:26:46,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 237 transitions, 478 flow. Second operand has 4 states, 4 states have (on average 217.25) internal successors, (869), 4 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:46,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:46,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 269 [2022-01-19 09:26:46,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:46,358 INFO L129 PetriNetUnfolder]: 209/989 cut-off events. [2022-01-19 09:26:46,358 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-01-19 09:26:46,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 989 events. 209/989 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4981 event pairs, 56 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 1342. Up to 269 conditions per place. [2022-01-19 09:26:46,366 INFO L132 encePairwiseOnDemand]: 263/269 looper letters, 49 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2022-01-19 09:26:46,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 254 transitions, 622 flow [2022-01-19 09:26:46,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 09:26:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 09:26:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 911 transitions. [2022-01-19 09:26:46,373 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8466542750929368 [2022-01-19 09:26:46,373 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 911 transitions. [2022-01-19 09:26:46,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 911 transitions. [2022-01-19 09:26:46,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:46,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 911 transitions. [2022-01-19 09:26:46,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 227.75) internal successors, (911), 4 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:46,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:46,381 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:46,381 INFO L186 Difference]: Start difference. First operand has 238 places, 237 transitions, 478 flow. Second operand 4 states and 911 transitions. [2022-01-19 09:26:46,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 254 transitions, 622 flow [2022-01-19 09:26:46,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 254 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 09:26:46,391 INFO L242 Difference]: Finished difference. Result has 239 places, 241 transitions, 512 flow [2022-01-19 09:26:46,391 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=512, PETRI_PLACES=239, PETRI_TRANSITIONS=241} [2022-01-19 09:26:46,392 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, -2 predicate places. [2022-01-19 09:26:46,392 INFO L470 AbstractCegarLoop]: Abstraction has has 239 places, 241 transitions, 512 flow [2022-01-19 09:26:46,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 217.25) internal successors, (869), 4 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:46,393 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:46,393 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:46,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 09:26:46,393 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1599953335, now seen corresponding path program 1 times [2022-01-19 09:26:46,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:46,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567719192] [2022-01-19 09:26:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:46,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:46,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:46,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567719192] [2022-01-19 09:26:46,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567719192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:46,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:46,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 09:26:46,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471821840] [2022-01-19 09:26:46,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:46,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 09:26:46,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:46,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 09:26:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 09:26:46,668 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 269 [2022-01-19 09:26:46,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 241 transitions, 512 flow. Second operand has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:46,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:46,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 269 [2022-01-19 09:26:46,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:46,871 INFO L129 PetriNetUnfolder]: 195/921 cut-off events. [2022-01-19 09:26:46,871 INFO L130 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-01-19 09:26:46,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 921 events. 195/921 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4442 event pairs, 83 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1296. Up to 270 conditions per place. [2022-01-19 09:26:46,878 INFO L132 encePairwiseOnDemand]: 264/269 looper letters, 46 selfloop transitions, 4 changer transitions 0/250 dead transitions. [2022-01-19 09:26:46,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 250 transitions, 629 flow [2022-01-19 09:26:46,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 09:26:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 09:26:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 907 transitions. [2022-01-19 09:26:46,881 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8429368029739777 [2022-01-19 09:26:46,881 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 907 transitions. [2022-01-19 09:26:46,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 907 transitions. [2022-01-19 09:26:46,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:46,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 907 transitions. [2022-01-19 09:26:46,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 226.75) internal successors, (907), 4 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:46,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:46,887 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:46,887 INFO L186 Difference]: Start difference. First operand has 239 places, 241 transitions, 512 flow. Second operand 4 states and 907 transitions. [2022-01-19 09:26:46,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 250 transitions, 629 flow [2022-01-19 09:26:46,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 250 transitions, 622 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 09:26:46,893 INFO L242 Difference]: Finished difference. Result has 242 places, 240 transitions, 512 flow [2022-01-19 09:26:46,893 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=512, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2022-01-19 09:26:46,894 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 1 predicate places. [2022-01-19 09:26:46,894 INFO L470 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 512 flow [2022-01-19 09:26:46,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:46,895 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:46,895 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:46,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 09:26:46,896 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1706270672, now seen corresponding path program 1 times [2022-01-19 09:26:46,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:46,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910084813] [2022-01-19 09:26:46,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:46,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:47,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:47,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910084813] [2022-01-19 09:26:47,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910084813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:47,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:47,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 09:26:47,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516021847] [2022-01-19 09:26:47,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:47,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 09:26:47,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:47,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 09:26:47,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 09:26:47,421 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 269 [2022-01-19 09:26:47,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 512 flow. Second operand has 8 states, 8 states have (on average 212.125) internal successors, (1697), 8 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:47,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:47,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 269 [2022-01-19 09:26:47,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:50,249 INFO L129 PetriNetUnfolder]: 577/2766 cut-off events. [2022-01-19 09:26:50,250 INFO L130 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-01-19 09:26:50,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3995 conditions, 2766 events. 577/2766 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 21157 event pairs, 153 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 3988. Up to 368 conditions per place. [2022-01-19 09:26:50,266 INFO L132 encePairwiseOnDemand]: 256/269 looper letters, 170 selfloop transitions, 35 changer transitions 0/401 dead transitions. [2022-01-19 09:26:50,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 401 transitions, 1311 flow [2022-01-19 09:26:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 09:26:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 09:26:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3571 transitions. [2022-01-19 09:26:50,274 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8296933085501859 [2022-01-19 09:26:50,274 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3571 transitions. [2022-01-19 09:26:50,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3571 transitions. [2022-01-19 09:26:50,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:50,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3571 transitions. [2022-01-19 09:26:50,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 223.1875) internal successors, (3571), 16 states have internal predecessors, (3571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:50,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 269.0) internal successors, (4573), 17 states have internal predecessors, (4573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:50,293 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 269.0) internal successors, (4573), 17 states have internal predecessors, (4573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:50,293 INFO L186 Difference]: Start difference. First operand has 242 places, 240 transitions, 512 flow. Second operand 16 states and 3571 transitions. [2022-01-19 09:26:50,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 401 transitions, 1311 flow [2022-01-19 09:26:50,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 401 transitions, 1289 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 09:26:50,301 INFO L242 Difference]: Finished difference. Result has 264 places, 268 transitions, 739 flow [2022-01-19 09:26:50,302 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=739, PETRI_PLACES=264, PETRI_TRANSITIONS=268} [2022-01-19 09:26:50,303 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 23 predicate places. [2022-01-19 09:26:50,303 INFO L470 AbstractCegarLoop]: Abstraction has has 264 places, 268 transitions, 739 flow [2022-01-19 09:26:50,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 212.125) internal successors, (1697), 8 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:50,304 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:50,304 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:50,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 09:26:50,305 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:50,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1578631382, now seen corresponding path program 1 times [2022-01-19 09:26:50,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:50,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162939306] [2022-01-19 09:26:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:50,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:50,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:50,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162939306] [2022-01-19 09:26:50,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162939306] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:50,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:50,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 09:26:50,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5433908] [2022-01-19 09:26:50,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:50,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 09:26:50,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:50,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 09:26:50,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 09:26:50,480 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 09:26:50,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 268 transitions, 739 flow. Second operand has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:50,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:50,481 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 09:26:50,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:51,084 INFO L129 PetriNetUnfolder]: 572/2836 cut-off events. [2022-01-19 09:26:51,084 INFO L130 PetriNetUnfolder]: For 2987/2987 co-relation queries the response was YES. [2022-01-19 09:26:51,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5126 conditions, 2836 events. 572/2836 cut-off events. For 2987/2987 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 21891 event pairs, 282 based on Foata normal form. 2/2618 useless extension candidates. Maximal degree in co-relation 5109. Up to 580 conditions per place. [2022-01-19 09:26:51,111 INFO L132 encePairwiseOnDemand]: 261/269 looper letters, 118 selfloop transitions, 21 changer transitions 0/338 dead transitions. [2022-01-19 09:26:51,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 338 transitions, 1234 flow [2022-01-19 09:26:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 09:26:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 09:26:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1377 transitions. [2022-01-19 09:26:51,115 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8531598513011153 [2022-01-19 09:26:51,115 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1377 transitions. [2022-01-19 09:26:51,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1377 transitions. [2022-01-19 09:26:51,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:51,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1377 transitions. [2022-01-19 09:26:51,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:51,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:51,122 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:51,122 INFO L186 Difference]: Start difference. First operand has 264 places, 268 transitions, 739 flow. Second operand 6 states and 1377 transitions. [2022-01-19 09:26:51,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 338 transitions, 1234 flow [2022-01-19 09:26:51,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 338 transitions, 1218 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 09:26:51,141 INFO L242 Difference]: Finished difference. Result has 269 places, 270 transitions, 812 flow [2022-01-19 09:26:51,141 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=812, PETRI_PLACES=269, PETRI_TRANSITIONS=270} [2022-01-19 09:26:51,142 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 28 predicate places. [2022-01-19 09:26:51,142 INFO L470 AbstractCegarLoop]: Abstraction has has 269 places, 270 transitions, 812 flow [2022-01-19 09:26:51,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:51,143 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:51,143 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:51,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 09:26:51,143 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1765536420, now seen corresponding path program 2 times [2022-01-19 09:26:51,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:51,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393939605] [2022-01-19 09:26:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:51,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:51,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:51,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393939605] [2022-01-19 09:26:51,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393939605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:51,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:51,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 09:26:51,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824489294] [2022-01-19 09:26:51,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:51,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 09:26:51,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:51,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 09:26:51,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 09:26:51,336 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 269 [2022-01-19 09:26:51,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 270 transitions, 812 flow. Second operand has 8 states, 8 states have (on average 214.375) internal successors, (1715), 8 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:51,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:51,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 269 [2022-01-19 09:26:51,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:51,812 INFO L129 PetriNetUnfolder]: 411/2207 cut-off events. [2022-01-19 09:26:51,812 INFO L130 PetriNetUnfolder]: For 3555/3744 co-relation queries the response was YES. [2022-01-19 09:26:51,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4159 conditions, 2207 events. 411/2207 cut-off events. For 3555/3744 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 16142 event pairs, 175 based on Foata normal form. 58/2091 useless extension candidates. Maximal degree in co-relation 4139. Up to 538 conditions per place. [2022-01-19 09:26:51,829 INFO L132 encePairwiseOnDemand]: 257/269 looper letters, 71 selfloop transitions, 22 changer transitions 0/304 dead transitions. [2022-01-19 09:26:51,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 304 transitions, 1223 flow [2022-01-19 09:26:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 09:26:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 09:26:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2197 transitions. [2022-01-19 09:26:51,834 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.816728624535316 [2022-01-19 09:26:51,834 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2197 transitions. [2022-01-19 09:26:51,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2197 transitions. [2022-01-19 09:26:51,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:51,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2197 transitions. [2022-01-19 09:26:51,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 219.7) internal successors, (2197), 10 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:51,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 269.0) internal successors, (2959), 11 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:51,845 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 269.0) internal successors, (2959), 11 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:51,845 INFO L186 Difference]: Start difference. First operand has 269 places, 270 transitions, 812 flow. Second operand 10 states and 2197 transitions. [2022-01-19 09:26:51,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 304 transitions, 1223 flow [2022-01-19 09:26:51,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 304 transitions, 1205 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 09:26:51,855 INFO L242 Difference]: Finished difference. Result has 280 places, 273 transitions, 870 flow [2022-01-19 09:26:51,855 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=870, PETRI_PLACES=280, PETRI_TRANSITIONS=273} [2022-01-19 09:26:51,858 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 39 predicate places. [2022-01-19 09:26:51,858 INFO L470 AbstractCegarLoop]: Abstraction has has 280 places, 273 transitions, 870 flow [2022-01-19 09:26:51,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 214.375) internal successors, (1715), 8 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:51,859 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:51,859 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:51,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 09:26:51,859 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:51,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash 209163142, now seen corresponding path program 1 times [2022-01-19 09:26:51,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:51,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400634575] [2022-01-19 09:26:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:51,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:51,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:51,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400634575] [2022-01-19 09:26:51,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400634575] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:51,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:51,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 09:26:51,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510555443] [2022-01-19 09:26:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:51,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 09:26:51,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:51,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 09:26:51,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 09:26:51,972 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 09:26:51,973 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 273 transitions, 870 flow. Second operand has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:51,973 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:51,973 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 09:26:51,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:52,417 INFO L129 PetriNetUnfolder]: 590/2967 cut-off events. [2022-01-19 09:26:52,418 INFO L130 PetriNetUnfolder]: For 4084/4095 co-relation queries the response was YES. [2022-01-19 09:26:52,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5812 conditions, 2967 events. 590/2967 cut-off events. For 4084/4095 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23149 event pairs, 331 based on Foata normal form. 5/2769 useless extension candidates. Maximal degree in co-relation 5789. Up to 575 conditions per place. [2022-01-19 09:26:52,439 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 102 selfloop transitions, 24 changer transitions 0/326 dead transitions. [2022-01-19 09:26:52,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 326 transitions, 1332 flow [2022-01-19 09:26:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 09:26:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 09:26:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1148 transitions. [2022-01-19 09:26:52,442 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8535315985130112 [2022-01-19 09:26:52,442 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1148 transitions. [2022-01-19 09:26:52,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1148 transitions. [2022-01-19 09:26:52,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:52,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1148 transitions. [2022-01-19 09:26:52,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 229.6) internal successors, (1148), 5 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:52,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:52,447 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:52,447 INFO L186 Difference]: Start difference. First operand has 280 places, 273 transitions, 870 flow. Second operand 5 states and 1148 transitions. [2022-01-19 09:26:52,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 326 transitions, 1332 flow [2022-01-19 09:26:52,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 326 transitions, 1296 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 09:26:52,461 INFO L242 Difference]: Finished difference. Result has 281 places, 280 transitions, 970 flow [2022-01-19 09:26:52,462 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=970, PETRI_PLACES=281, PETRI_TRANSITIONS=280} [2022-01-19 09:26:52,462 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 40 predicate places. [2022-01-19 09:26:52,462 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 280 transitions, 970 flow [2022-01-19 09:26:52,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:52,463 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:52,463 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:52,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 09:26:52,463 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash -246940562, now seen corresponding path program 2 times [2022-01-19 09:26:52,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:52,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530271993] [2022-01-19 09:26:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:52,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:52,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:52,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530271993] [2022-01-19 09:26:52,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530271993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:52,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:52,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 09:26:52,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144213446] [2022-01-19 09:26:52,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:52,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 09:26:52,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:52,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 09:26:52,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 09:26:52,629 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 09:26:52,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 280 transitions, 970 flow. Second operand has 6 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:52,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:52,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 09:26:52,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:53,055 INFO L129 PetriNetUnfolder]: 608/3075 cut-off events. [2022-01-19 09:26:53,056 INFO L130 PetriNetUnfolder]: For 4475/4475 co-relation queries the response was YES. [2022-01-19 09:26:53,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6139 conditions, 3075 events. 608/3075 cut-off events. For 4475/4475 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 24452 event pairs, 260 based on Foata normal form. 8/2860 useless extension candidates. Maximal degree in co-relation 6113. Up to 587 conditions per place. [2022-01-19 09:26:53,087 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 113 selfloop transitions, 27 changer transitions 0/340 dead transitions. [2022-01-19 09:26:53,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 340 transitions, 1458 flow [2022-01-19 09:26:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 09:26:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 09:26:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1371 transitions. [2022-01-19 09:26:53,090 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8494423791821561 [2022-01-19 09:26:53,091 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1371 transitions. [2022-01-19 09:26:53,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1371 transitions. [2022-01-19 09:26:53,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:53,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1371 transitions. [2022-01-19 09:26:53,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:53,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:53,097 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:53,097 INFO L186 Difference]: Start difference. First operand has 281 places, 280 transitions, 970 flow. Second operand 6 states and 1371 transitions. [2022-01-19 09:26:53,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 340 transitions, 1458 flow [2022-01-19 09:26:53,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 340 transitions, 1436 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-01-19 09:26:53,114 INFO L242 Difference]: Finished difference. Result has 287 places, 284 transitions, 1055 flow [2022-01-19 09:26:53,114 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1055, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2022-01-19 09:26:53,117 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 46 predicate places. [2022-01-19 09:26:53,117 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 1055 flow [2022-01-19 09:26:53,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:53,118 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:53,118 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:53,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 09:26:53,118 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:53,119 INFO L85 PathProgramCache]: Analyzing trace with hash 632279702, now seen corresponding path program 3 times [2022-01-19 09:26:53,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:53,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965385856] [2022-01-19 09:26:53,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:53,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:53,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:53,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965385856] [2022-01-19 09:26:53,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965385856] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:53,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:53,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 09:26:53,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065262986] [2022-01-19 09:26:53,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:53,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 09:26:53,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 09:26:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 09:26:53,251 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 09:26:53,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 1055 flow. Second operand has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:53,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:53,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 09:26:53,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:53,703 INFO L129 PetriNetUnfolder]: 616/3067 cut-off events. [2022-01-19 09:26:53,703 INFO L130 PetriNetUnfolder]: For 4863/4867 co-relation queries the response was YES. [2022-01-19 09:26:53,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6182 conditions, 3067 events. 616/3067 cut-off events. For 4863/4867 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 24177 event pairs, 379 based on Foata normal form. 6/2860 useless extension candidates. Maximal degree in co-relation 6154. Up to 947 conditions per place. [2022-01-19 09:26:53,727 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 81 selfloop transitions, 19 changer transitions 0/300 dead transitions. [2022-01-19 09:26:53,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 300 transitions, 1311 flow [2022-01-19 09:26:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 09:26:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 09:26:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1124 transitions. [2022-01-19 09:26:53,730 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8356877323420074 [2022-01-19 09:26:53,730 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1124 transitions. [2022-01-19 09:26:53,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1124 transitions. [2022-01-19 09:26:53,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:53,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1124 transitions. [2022-01-19 09:26:53,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 224.8) internal successors, (1124), 5 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:53,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:53,736 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:53,736 INFO L186 Difference]: Start difference. First operand has 287 places, 284 transitions, 1055 flow. Second operand 5 states and 1124 transitions. [2022-01-19 09:26:53,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 300 transitions, 1311 flow [2022-01-19 09:26:53,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 300 transitions, 1268 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 09:26:53,750 INFO L242 Difference]: Finished difference. Result has 289 places, 283 transitions, 1038 flow [2022-01-19 09:26:53,750 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1038, PETRI_PLACES=289, PETRI_TRANSITIONS=283} [2022-01-19 09:26:53,750 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 48 predicate places. [2022-01-19 09:26:53,751 INFO L470 AbstractCegarLoop]: Abstraction has has 289 places, 283 transitions, 1038 flow [2022-01-19 09:26:53,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:53,752 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:53,752 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:53,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 09:26:53,752 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash 272885954, now seen corresponding path program 4 times [2022-01-19 09:26:53,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:53,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629253224] [2022-01-19 09:26:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:53,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:53,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:53,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629253224] [2022-01-19 09:26:53,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629253224] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:53,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:53,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 09:26:53,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869218138] [2022-01-19 09:26:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:53,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 09:26:53,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:53,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 09:26:53,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 09:26:53,890 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 09:26:53,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 283 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:53,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:53,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 09:26:53,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:54,359 INFO L129 PetriNetUnfolder]: 659/3287 cut-off events. [2022-01-19 09:26:54,359 INFO L130 PetriNetUnfolder]: For 5001/5011 co-relation queries the response was YES. [2022-01-19 09:26:54,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6524 conditions, 3287 events. 659/3287 cut-off events. For 5001/5011 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 26443 event pairs, 373 based on Foata normal form. 16/3074 useless extension candidates. Maximal degree in co-relation 6496. Up to 959 conditions per place. [2022-01-19 09:26:54,381 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 95 selfloop transitions, 25 changer transitions 0/320 dead transitions. [2022-01-19 09:26:54,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 320 transitions, 1452 flow [2022-01-19 09:26:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 09:26:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 09:26:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions. [2022-01-19 09:26:54,385 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8370508054522925 [2022-01-19 09:26:54,385 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions. [2022-01-19 09:26:54,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions. [2022-01-19 09:26:54,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:54,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions. [2022-01-19 09:26:54,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:54,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:54,390 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:54,391 INFO L186 Difference]: Start difference. First operand has 289 places, 283 transitions, 1038 flow. Second operand 6 states and 1351 transitions. [2022-01-19 09:26:54,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 320 transitions, 1452 flow [2022-01-19 09:26:54,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 320 transitions, 1391 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-01-19 09:26:54,404 INFO L242 Difference]: Finished difference. Result has 289 places, 289 transitions, 1098 flow [2022-01-19 09:26:54,404 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1098, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2022-01-19 09:26:54,405 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 48 predicate places. [2022-01-19 09:26:54,405 INFO L470 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 1098 flow [2022-01-19 09:26:54,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:54,405 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:54,405 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:54,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 09:26:54,406 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:54,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1353785088, now seen corresponding path program 5 times [2022-01-19 09:26:54,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:54,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099858969] [2022-01-19 09:26:54,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:54,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:54,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:54,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099858969] [2022-01-19 09:26:54,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099858969] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:54,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:54,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 09:26:54,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77832264] [2022-01-19 09:26:54,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:54,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 09:26:54,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:54,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 09:26:54,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 09:26:54,555 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 09:26:54,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 1098 flow. Second operand has 6 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:54,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:54,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 09:26:54,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:55,032 INFO L129 PetriNetUnfolder]: 693/3477 cut-off events. [2022-01-19 09:26:55,032 INFO L130 PetriNetUnfolder]: For 5380/5392 co-relation queries the response was YES. [2022-01-19 09:26:55,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 3477 events. 693/3477 cut-off events. For 5380/5392 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 28430 event pairs, 405 based on Foata normal form. 18/3249 useless extension candidates. Maximal degree in co-relation 6836. Up to 1023 conditions per place. [2022-01-19 09:26:55,062 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 98 selfloop transitions, 23 changer transitions 0/321 dead transitions. [2022-01-19 09:26:55,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 321 transitions, 1507 flow [2022-01-19 09:26:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 09:26:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 09:26:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1345 transitions. [2022-01-19 09:26:55,065 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-01-19 09:26:55,065 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1345 transitions. [2022-01-19 09:26:55,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1345 transitions. [2022-01-19 09:26:55,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:55,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1345 transitions. [2022-01-19 09:26:55,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 224.16666666666666) internal successors, (1345), 6 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:55,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:55,071 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:55,071 INFO L186 Difference]: Start difference. First operand has 289 places, 289 transitions, 1098 flow. Second operand 6 states and 1345 transitions. [2022-01-19 09:26:55,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 321 transitions, 1507 flow [2022-01-19 09:26:55,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 321 transitions, 1466 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-01-19 09:26:55,087 INFO L242 Difference]: Finished difference. Result has 292 places, 292 transitions, 1147 flow [2022-01-19 09:26:55,088 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1147, PETRI_PLACES=292, PETRI_TRANSITIONS=292} [2022-01-19 09:26:55,088 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 51 predicate places. [2022-01-19 09:26:55,088 INFO L470 AbstractCegarLoop]: Abstraction has has 292 places, 292 transitions, 1147 flow [2022-01-19 09:26:55,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:55,089 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:55,089 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:55,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 09:26:55,089 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1682285936, now seen corresponding path program 6 times [2022-01-19 09:26:55,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:55,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302074426] [2022-01-19 09:26:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:55,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:55,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:55,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302074426] [2022-01-19 09:26:55,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302074426] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:55,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:26:55,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 09:26:55,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287008560] [2022-01-19 09:26:55,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:55,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 09:26:55,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:55,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 09:26:55,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 09:26:55,211 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 09:26:55,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 292 transitions, 1147 flow. Second operand has 6 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:55,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:55,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 09:26:55,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:55,682 INFO L129 PetriNetUnfolder]: 685/3467 cut-off events. [2022-01-19 09:26:55,683 INFO L130 PetriNetUnfolder]: For 5253/5262 co-relation queries the response was YES. [2022-01-19 09:26:55,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 3467 events. 685/3467 cut-off events. For 5253/5262 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 28447 event pairs, 321 based on Foata normal form. 15/3243 useless extension candidates. Maximal degree in co-relation 6760. Up to 669 conditions per place. [2022-01-19 09:26:55,708 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 104 selfloop transitions, 29 changer transitions 0/333 dead transitions. [2022-01-19 09:26:55,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 333 transitions, 1584 flow [2022-01-19 09:26:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 09:26:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 09:26:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1573 transitions. [2022-01-19 09:26:55,712 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8353690918746681 [2022-01-19 09:26:55,712 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1573 transitions. [2022-01-19 09:26:55,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1573 transitions. [2022-01-19 09:26:55,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:55,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1573 transitions. [2022-01-19 09:26:55,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 224.71428571428572) internal successors, (1573), 7 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:55,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:55,719 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:55,719 INFO L186 Difference]: Start difference. First operand has 292 places, 292 transitions, 1147 flow. Second operand 7 states and 1573 transitions. [2022-01-19 09:26:55,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 333 transitions, 1584 flow [2022-01-19 09:26:55,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 333 transitions, 1537 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-01-19 09:26:55,733 INFO L242 Difference]: Finished difference. Result has 294 places, 291 transitions, 1135 flow [2022-01-19 09:26:55,734 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1135, PETRI_PLACES=294, PETRI_TRANSITIONS=291} [2022-01-19 09:26:55,734 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 53 predicate places. [2022-01-19 09:26:55,734 INFO L470 AbstractCegarLoop]: Abstraction has has 294 places, 291 transitions, 1135 flow [2022-01-19 09:26:55,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:55,735 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:55,735 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:55,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 09:26:55,735 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1561652115, now seen corresponding path program 1 times [2022-01-19 09:26:55,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:55,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211017547] [2022-01-19 09:26:55,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:55,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:55,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:55,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211017547] [2022-01-19 09:26:55,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211017547] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:26:55,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409478072] [2022-01-19 09:26:55,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:55,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:26:55,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:26:55,872 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-01-19 09:26:55,899 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-01-19 09:26:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:55,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 09:26:55,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:26:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:26:56,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 09:26:56,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409478072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:26:56,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 09:26:56,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-01-19 09:26:56,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989411558] [2022-01-19 09:26:56,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:26:56,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 09:26:56,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:56,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 09:26:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-19 09:26:56,346 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 269 [2022-01-19 09:26:56,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 291 transitions, 1135 flow. Second operand has 8 states, 8 states have (on average 189.5) internal successors, (1516), 8 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:56,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:56,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 269 [2022-01-19 09:26:56,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:56,838 INFO L129 PetriNetUnfolder]: 512/2605 cut-off events. [2022-01-19 09:26:56,838 INFO L130 PetriNetUnfolder]: For 1551/1565 co-relation queries the response was YES. [2022-01-19 09:26:56,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4573 conditions, 2605 events. 512/2605 cut-off events. For 1551/1565 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 21144 event pairs, 277 based on Foata normal form. 12/2424 useless extension candidates. Maximal degree in co-relation 4548. Up to 765 conditions per place. [2022-01-19 09:26:56,854 INFO L132 encePairwiseOnDemand]: 247/269 looper letters, 55 selfloop transitions, 15 changer transitions 18/314 dead transitions. [2022-01-19 09:26:56,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 314 transitions, 1363 flow [2022-01-19 09:26:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 09:26:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 09:26:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1950 transitions. [2022-01-19 09:26:56,859 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.724907063197026 [2022-01-19 09:26:56,859 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1950 transitions. [2022-01-19 09:26:56,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1950 transitions. [2022-01-19 09:26:56,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:56,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1950 transitions. [2022-01-19 09:26:56,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:56,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 269.0) internal successors, (2959), 11 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:56,867 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 269.0) internal successors, (2959), 11 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:56,867 INFO L186 Difference]: Start difference. First operand has 294 places, 291 transitions, 1135 flow. Second operand 10 states and 1950 transitions. [2022-01-19 09:26:56,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 314 transitions, 1363 flow [2022-01-19 09:26:56,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 314 transitions, 1286 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-01-19 09:26:56,877 INFO L242 Difference]: Finished difference. Result has 301 places, 292 transitions, 1108 flow [2022-01-19 09:26:56,878 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1108, PETRI_PLACES=301, PETRI_TRANSITIONS=292} [2022-01-19 09:26:56,878 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 60 predicate places. [2022-01-19 09:26:56,878 INFO L470 AbstractCegarLoop]: Abstraction has has 301 places, 292 transitions, 1108 flow [2022-01-19 09:26:56,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 189.5) internal successors, (1516), 8 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:56,879 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:56,879 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:26:56,907 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-01-19 09:26:57,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-19 09:26:57,104 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash -140437133, now seen corresponding path program 1 times [2022-01-19 09:26:57,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:57,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892463463] [2022-01-19 09:26:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:57,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:26:57,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:57,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892463463] [2022-01-19 09:26:57,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892463463] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:26:57,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5906764] [2022-01-19 09:26:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:57,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:26:57,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:26:57,246 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-01-19 09:26:57,248 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-01-19 09:26:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:57,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-19 09:26:57,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:26:58,157 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 09:26:58,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-01-19 09:26:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:58,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:26:58,889 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 09:26:58,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-01-19 09:26:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:59,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5906764] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:26:59,685 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:26:59,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 18] total 35 [2022-01-19 09:26:59,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926751853] [2022-01-19 09:26:59,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:26:59,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-19 09:26:59,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:59,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-19 09:26:59,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2022-01-19 09:26:59,693 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 269 [2022-01-19 09:26:59,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 292 transitions, 1108 flow. Second operand has 35 states, 35 states have (on average 105.62857142857143) internal successors, (3697), 35 states have internal predecessors, (3697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:26:59,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:59,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 269 [2022-01-19 09:26:59,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:27:19,401 INFO L129 PetriNetUnfolder]: 33593/71215 cut-off events. [2022-01-19 09:27:19,401 INFO L130 PetriNetUnfolder]: For 74558/74656 co-relation queries the response was YES. [2022-01-19 09:27:19,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163122 conditions, 71215 events. 33593/71215 cut-off events. For 74558/74656 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 752671 event pairs, 1137 based on Foata normal form. 166/69843 useless extension candidates. Maximal degree in co-relation 163094. Up to 10885 conditions per place. [2022-01-19 09:27:20,236 INFO L132 encePairwiseOnDemand]: 186/269 looper letters, 2662 selfloop transitions, 739 changer transitions 524/4017 dead transitions. [2022-01-19 09:27:20,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 4017 transitions, 21367 flow [2022-01-19 09:27:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2022-01-19 09:27:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2022-01-19 09:27:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 22882 transitions. [2022-01-19 09:27:20,289 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4362215232103708 [2022-01-19 09:27:20,289 INFO L72 ComplementDD]: Start complementDD. Operand 195 states and 22882 transitions. [2022-01-19 09:27:20,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 22882 transitions. [2022-01-19 09:27:20,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:27:20,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 195 states and 22882 transitions. [2022-01-19 09:27:20,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 196 states, 195 states have (on average 117.34358974358975) internal successors, (22882), 195 states have internal predecessors, (22882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:20,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 196 states, 196 states have (on average 269.0) internal successors, (52724), 196 states have internal predecessors, (52724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:20,443 INFO L81 ComplementDD]: Finished complementDD. Result has 196 states, 196 states have (on average 269.0) internal successors, (52724), 196 states have internal predecessors, (52724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:20,443 INFO L186 Difference]: Start difference. First operand has 301 places, 292 transitions, 1108 flow. Second operand 195 states and 22882 transitions. [2022-01-19 09:27:20,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 4017 transitions, 21367 flow [2022-01-19 09:27:21,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 4017 transitions, 20509 flow, removed 266 selfloop flow, removed 7 redundant places. [2022-01-19 09:27:21,270 INFO L242 Difference]: Finished difference. Result has 619 places, 1024 transitions, 7762 flow [2022-01-19 09:27:21,272 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=195, PETRI_FLOW=7762, PETRI_PLACES=619, PETRI_TRANSITIONS=1024} [2022-01-19 09:27:21,272 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 378 predicate places. [2022-01-19 09:27:21,272 INFO L470 AbstractCegarLoop]: Abstraction has has 619 places, 1024 transitions, 7762 flow [2022-01-19 09:27:21,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 105.62857142857143) internal successors, (3697), 35 states have internal predecessors, (3697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:21,274 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:27:21,274 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:27:21,302 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-01-19 09:27:21,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-19 09:27:21,496 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:27:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:27:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash 605957215, now seen corresponding path program 2 times [2022-01-19 09:27:21,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:27:21,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558557943] [2022-01-19 09:27:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:27:21,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:27:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:27:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:27:21,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:27:21,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558557943] [2022-01-19 09:27:21,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558557943] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:27:21,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:27:21,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 09:27:21,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821305084] [2022-01-19 09:27:21,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:27:21,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 09:27:21,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:27:21,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 09:27:21,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-19 09:27:21,712 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 09:27:21,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 1024 transitions, 7762 flow. Second operand has 11 states, 11 states have (on average 213.0909090909091) internal successors, (2344), 11 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:21,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:27:21,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 09:27:21,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:27:26,960 INFO L129 PetriNetUnfolder]: 3114/15258 cut-off events. [2022-01-19 09:27:26,960 INFO L130 PetriNetUnfolder]: For 161340/162913 co-relation queries the response was YES. [2022-01-19 09:27:27,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61074 conditions, 15258 events. 3114/15258 cut-off events. For 161340/162913 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 169682 event pairs, 545 based on Foata normal form. 300/15155 useless extension candidates. Maximal degree in co-relation 60915. Up to 2470 conditions per place. [2022-01-19 09:27:27,209 INFO L132 encePairwiseOnDemand]: 252/269 looper letters, 235 selfloop transitions, 35 changer transitions 20/1203 dead transitions. [2022-01-19 09:27:27,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 1203 transitions, 10570 flow [2022-01-19 09:27:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 09:27:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 09:27:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3294 transitions. [2022-01-19 09:27:27,214 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8163568773234201 [2022-01-19 09:27:27,214 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3294 transitions. [2022-01-19 09:27:27,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3294 transitions. [2022-01-19 09:27:27,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:27:27,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3294 transitions. [2022-01-19 09:27:27,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 219.6) internal successors, (3294), 15 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:27,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 269.0) internal successors, (4304), 16 states have internal predecessors, (4304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:27,224 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 269.0) internal successors, (4304), 16 states have internal predecessors, (4304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:27,224 INFO L186 Difference]: Start difference. First operand has 619 places, 1024 transitions, 7762 flow. Second operand 15 states and 3294 transitions. [2022-01-19 09:27:27,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 1203 transitions, 10570 flow [2022-01-19 09:27:27,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 1203 transitions, 9209 flow, removed 586 selfloop flow, removed 18 redundant places. [2022-01-19 09:27:27,992 INFO L242 Difference]: Finished difference. Result has 574 places, 1050 transitions, 7592 flow [2022-01-19 09:27:27,992 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=7203, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7592, PETRI_PLACES=574, PETRI_TRANSITIONS=1050} [2022-01-19 09:27:27,993 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 333 predicate places. [2022-01-19 09:27:27,993 INFO L470 AbstractCegarLoop]: Abstraction has has 574 places, 1050 transitions, 7592 flow [2022-01-19 09:27:27,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 213.0909090909091) internal successors, (2344), 11 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:27,993 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:27:27,994 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:27:27,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 09:27:27,994 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:27:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:27:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2084020009, now seen corresponding path program 3 times [2022-01-19 09:27:27,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:27:27,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511991296] [2022-01-19 09:27:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:27:27,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:27:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:27:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:27:28,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:27:28,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511991296] [2022-01-19 09:27:28,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511991296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:27:28,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:27:28,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 09:27:28,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459770873] [2022-01-19 09:27:28,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:27:28,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 09:27:28,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:27:28,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 09:27:28,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-01-19 09:27:28,183 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 09:27:28,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 1050 transitions, 7592 flow. Second operand has 11 states, 11 states have (on average 213.0909090909091) internal successors, (2344), 11 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:28,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:27:28,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 09:27:28,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:27:32,808 INFO L129 PetriNetUnfolder]: 3098/14892 cut-off events. [2022-01-19 09:27:32,809 INFO L130 PetriNetUnfolder]: For 134279/135517 co-relation queries the response was YES. [2022-01-19 09:27:32,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58077 conditions, 14892 events. 3098/14892 cut-off events. For 134279/135517 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 164265 event pairs, 486 based on Foata normal form. 241/14750 useless extension candidates. Maximal degree in co-relation 57918. Up to 2165 conditions per place. [2022-01-19 09:27:33,019 INFO L132 encePairwiseOnDemand]: 251/269 looper letters, 207 selfloop transitions, 72 changer transitions 20/1212 dead transitions. [2022-01-19 09:27:33,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 1212 transitions, 9667 flow [2022-01-19 09:27:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 09:27:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 09:27:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3478 transitions. [2022-01-19 09:27:33,023 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8080855018587361 [2022-01-19 09:27:33,023 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3478 transitions. [2022-01-19 09:27:33,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3478 transitions. [2022-01-19 09:27:33,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:27:33,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3478 transitions. [2022-01-19 09:27:33,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 217.375) internal successors, (3478), 16 states have internal predecessors, (3478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:33,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 269.0) internal successors, (4573), 17 states have internal predecessors, (4573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:33,032 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 269.0) internal successors, (4573), 17 states have internal predecessors, (4573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:33,032 INFO L186 Difference]: Start difference. First operand has 574 places, 1050 transitions, 7592 flow. Second operand 16 states and 3478 transitions. [2022-01-19 09:27:33,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 1212 transitions, 9667 flow [2022-01-19 09:27:33,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 1212 transitions, 9653 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-01-19 09:27:33,694 INFO L242 Difference]: Finished difference. Result has 596 places, 1075 transitions, 8087 flow [2022-01-19 09:27:33,695 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=7584, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8087, PETRI_PLACES=596, PETRI_TRANSITIONS=1075} [2022-01-19 09:27:33,695 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 355 predicate places. [2022-01-19 09:27:33,695 INFO L470 AbstractCegarLoop]: Abstraction has has 596 places, 1075 transitions, 8087 flow [2022-01-19 09:27:33,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 213.0909090909091) internal successors, (2344), 11 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:33,696 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:27:33,696 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:27:33,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 09:27:33,696 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:27:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:27:33,697 INFO L85 PathProgramCache]: Analyzing trace with hash -49083619, now seen corresponding path program 4 times [2022-01-19 09:27:33,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:27:33,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456816021] [2022-01-19 09:27:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:27:33,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:27:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:27:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:27:33,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:27:33,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456816021] [2022-01-19 09:27:33,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456816021] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:27:33,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850593776] [2022-01-19 09:27:33,887 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 09:27:33,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:27:33,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:27:33,892 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-01-19 09:27:33,893 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-01-19 09:27:34,054 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 09:27:34,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:27:34,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-19 09:27:34,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:27:35,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 09:27:35,176 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:27:35,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-01-19 09:27:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:27:35,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:27:35,461 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 09:27:35,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-01-19 09:27:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:27:36,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850593776] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:27:36,541 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:27:36,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23, 18] total 40 [2022-01-19 09:27:36,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868050435] [2022-01-19 09:27:36,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:27:36,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-19 09:27:36,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:27:36,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-19 09:27:36,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2022-01-19 09:27:36,545 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 269 [2022-01-19 09:27:36,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 1075 transitions, 8087 flow. Second operand has 40 states, 40 states have (on average 98.275) internal successors, (3931), 40 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:27:36,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:27:36,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 269 [2022-01-19 09:27:36,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:28:22,737 INFO L129 PetriNetUnfolder]: 54001/112627 cut-off events. [2022-01-19 09:28:22,737 INFO L130 PetriNetUnfolder]: For 1248896/1249618 co-relation queries the response was YES. [2022-01-19 09:28:26,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 509783 conditions, 112627 events. 54001/112627 cut-off events. For 1248896/1249618 co-relation queries the response was YES. Maximal size of possible extension queue 1598. Compared 1254237 event pairs, 5769 based on Foata normal form. 1190/111511 useless extension candidates. Maximal degree in co-relation 509617. Up to 36025 conditions per place. [2022-01-19 09:28:27,194 INFO L132 encePairwiseOnDemand]: 195/269 looper letters, 2731 selfloop transitions, 1084 changer transitions 15/3921 dead transitions. [2022-01-19 09:28:27,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 758 places, 3921 transitions, 46826 flow [2022-01-19 09:28:27,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-01-19 09:28:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2022-01-19 09:28:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 17299 transitions. [2022-01-19 09:28:27,216 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3945309827354209 [2022-01-19 09:28:27,216 INFO L72 ComplementDD]: Start complementDD. Operand 163 states and 17299 transitions. [2022-01-19 09:28:27,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 17299 transitions. [2022-01-19 09:28:27,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:28:27,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 163 states and 17299 transitions. [2022-01-19 09:28:27,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 164 states, 163 states have (on average 106.12883435582822) internal successors, (17299), 163 states have internal predecessors, (17299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:28:27,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 164 states, 164 states have (on average 269.0) internal successors, (44116), 164 states have internal predecessors, (44116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:28:27,278 INFO L81 ComplementDD]: Finished complementDD. Result has 164 states, 164 states have (on average 269.0) internal successors, (44116), 164 states have internal predecessors, (44116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:28:27,278 INFO L186 Difference]: Start difference. First operand has 596 places, 1075 transitions, 8087 flow. Second operand 163 states and 17299 transitions. [2022-01-19 09:28:27,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 758 places, 3921 transitions, 46826 flow [2022-01-19 09:28:37,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 3921 transitions, 46617 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-01-19 09:28:37,970 INFO L242 Difference]: Finished difference. Result has 854 places, 2011 transitions, 26705 flow [2022-01-19 09:28:37,971 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=8028, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=163, PETRI_FLOW=26705, PETRI_PLACES=854, PETRI_TRANSITIONS=2011} [2022-01-19 09:28:37,971 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 613 predicate places. [2022-01-19 09:28:37,972 INFO L470 AbstractCegarLoop]: Abstraction has has 854 places, 2011 transitions, 26705 flow [2022-01-19 09:28:37,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 98.275) internal successors, (3931), 40 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:28:37,972 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:28:37,972 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:28:37,997 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-01-19 09:28:38,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:28:38,194 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:28:38,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:28:38,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2118121773, now seen corresponding path program 5 times [2022-01-19 09:28:38,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:28:38,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515812141] [2022-01-19 09:28:38,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:28:38,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:28:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:28:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:28:38,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:28:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515812141] [2022-01-19 09:28:38,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515812141] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:28:38,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:28:38,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 09:28:38,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645300780] [2022-01-19 09:28:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:28:38,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 09:28:38,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:28:38,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 09:28:38,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-19 09:28:38,602 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 269 [2022-01-19 09:28:38,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 2011 transitions, 26705 flow. Second operand has 11 states, 11 states have (on average 210.36363636363637) internal successors, (2314), 11 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:28:38,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:28:38,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 269 [2022-01-19 09:28:38,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:28:53,532 INFO L129 PetriNetUnfolder]: 7198/29868 cut-off events. [2022-01-19 09:28:53,532 INFO L130 PetriNetUnfolder]: For 658034/659266 co-relation queries the response was YES. [2022-01-19 09:28:54,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162222 conditions, 29868 events. 7198/29868 cut-off events. For 658034/659266 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 361859 event pairs, 2029 based on Foata normal form. 266/29081 useless extension candidates. Maximal degree in co-relation 161952. Up to 7202 conditions per place. [2022-01-19 09:28:54,342 INFO L132 encePairwiseOnDemand]: 253/269 looper letters, 598 selfloop transitions, 180 changer transitions 3/2232 dead transitions. [2022-01-19 09:28:54,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 867 places, 2232 transitions, 30888 flow [2022-01-19 09:28:54,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 09:28:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 09:28:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3462 transitions. [2022-01-19 09:28:54,346 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.804368029739777 [2022-01-19 09:28:54,346 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3462 transitions. [2022-01-19 09:28:54,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3462 transitions. [2022-01-19 09:28:54,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:28:54,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3462 transitions. [2022-01-19 09:28:54,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 216.375) internal successors, (3462), 16 states have internal predecessors, (3462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:28:54,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 269.0) internal successors, (4573), 17 states have internal predecessors, (4573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:28:54,353 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 269.0) internal successors, (4573), 17 states have internal predecessors, (4573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:28:54,353 INFO L186 Difference]: Start difference. First operand has 854 places, 2011 transitions, 26705 flow. Second operand 16 states and 3462 transitions. [2022-01-19 09:28:54,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 867 places, 2232 transitions, 30888 flow [2022-01-19 09:29:00,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 844 places, 2232 transitions, 23167 flow, removed 3610 selfloop flow, removed 23 redundant places. [2022-01-19 09:29:00,334 INFO L242 Difference]: Finished difference. Result has 852 places, 2053 transitions, 20029 flow [2022-01-19 09:29:00,335 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=19022, PETRI_DIFFERENCE_MINUEND_PLACES=829, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1847, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=20029, PETRI_PLACES=852, PETRI_TRANSITIONS=2053} [2022-01-19 09:29:00,335 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 611 predicate places. [2022-01-19 09:29:00,335 INFO L470 AbstractCegarLoop]: Abstraction has has 852 places, 2053 transitions, 20029 flow [2022-01-19 09:29:00,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 210.36363636363637) internal successors, (2314), 11 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:29:00,336 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:29:00,336 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:29:00,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 09:29:00,336 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:29:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:29:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash -538122925, now seen corresponding path program 6 times [2022-01-19 09:29:00,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:29:00,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442236590] [2022-01-19 09:29:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:29:00,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:29:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:29:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:29:00,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:29:00,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442236590] [2022-01-19 09:29:00,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442236590] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:29:00,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123510825] [2022-01-19 09:29:00,539 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-19 09:29:00,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:29:00,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:29:00,540 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-01-19 09:29:00,542 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-01-19 09:29:00,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-01-19 09:29:00,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:29:00,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 09:29:00,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:29:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 09:29:01,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 09:29:01,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123510825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:29:01,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 09:29:01,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 14 [2022-01-19 09:29:01,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389699357] [2022-01-19 09:29:01,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:29:01,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 09:29:01,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:29:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 09:29:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-01-19 09:29:01,197 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 09:29:01,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 852 places, 2053 transitions, 20029 flow. Second operand has 10 states, 10 states have (on average 213.3) internal successors, (2133), 10 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:29:01,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:29:01,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 09:29:01,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:29:09,383 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([728] L93-1-->L93-2: Formula: (= |v_thread2Thread1of1ForFork0_#t~mem19#1_3| v_~x2~0_27) InVars {thread2Thread1of1ForFork0_#t~mem19#1=|v_thread2Thread1of1ForFork0_#t~mem19#1_3|} OutVars{~x2~0=v_~x2~0_27, thread2Thread1of1ForFork0_#t~mem19#1=|v_thread2Thread1of1ForFork0_#t~mem19#1_3|} AuxVars[] AssignedVars[~x2~0][1808], [Black: 3600#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3604#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3422#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 3598#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3548#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), 148#L110-4true, Black: 3364#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3482#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3420#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3338#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 ~x1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3584#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0)), Black: 3610#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3336#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 ~x1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3606#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3436#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3576#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3398#(and (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3490#(and (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3480#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3538#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= ~f~0.offset 0)), Black: 3406#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3378#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3470#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= ~x1~0 0) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3468#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3532#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~f~0.offset 0)), Black: 3526#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~f~0.offset 0)), Black: 3542#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3408#(and (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 3448#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), 2309#(<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))), Black: 3578#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296))) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3458#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3342#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 ~x1~0) (= |ULTIMATE.start_main_#t~ret23#1.offset| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3388#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3590#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= ~x2~0 ~x1~0)), Black: 3544#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= ~f~0.offset 0)), Black: 3602#(and (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3472#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3518#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~f~0.offset 0)), Black: 3400#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 3524#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~f~0.offset 0)), Black: 3384#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3368#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 3546#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296))) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~f~0.offset 0)), Black: 3358#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3498#(and (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 3504#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 3528#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0))), Black: 3558#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3608#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3474#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3426#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3534#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~f~0.offset 0)), Black: 3594#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= ~x2~0 ~x1~0)), Black: 3550#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= ~f~0.offset 0)), Black: 3434#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 3396#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3508#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3530#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~f~0.offset 0)), 68#L52-2true, Black: 3486#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 3556#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= ~f~0.offset 0)), Black: 3572#(and (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3540#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~f~0.offset 0)), Black: 2386#(<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)), Black: 3560#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3390#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 3568#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3444#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3536#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296))) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~f~0.offset 0)), Black: 3522#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0)), Black: 3460#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3510#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~f~0.offset 0)), Black: 2746#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= ~f~0.offset 0)), Black: 3492#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 2383#(and (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3562#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), 3723#true, Black: 2801#(= ~x2~0 ~x1~0), Black: 3428#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3506#(and (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 3352#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3412#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3596#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread1Thread1of1ForFork1_#t~mem1#1|))), Black: 1856#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), 390#(<= (+ (div ~n~0 4294967296) 1) (div (+ 4294967292 ~n~0) 4294967296)), Black: 3586#(and (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296))) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1998#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2134#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= ~x2~0 ~x1~0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 3464#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 3450#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1898#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2384#(and (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1830#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 3574#(and (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1976#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 3514#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 1934#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3582#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 2046#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3340#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 ~x1~0) (= |ULTIMATE.start_main_#t~ret23#1.offset| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1922#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1794#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post31#1| 0) (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3452#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 2048#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3418#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 2071#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 3552#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= ~f~0.offset 0)), Black: 3432#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 2132#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~x1~0 0) (<= ~size~0 1) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1964#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3520#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 2144#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= ~x2~0 ~x1~0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 3588#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (= ~x2~0 ~x1~0)), Black: 1866#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 3592#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0)), Black: 3404#(and (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0))), Black: 1845#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3424#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) 3 |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0)), Black: 2082#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 3564#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2104#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 3554#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967292 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967292 ~n~0) 4294967296))) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= ~f~0.offset 0)), Black: 2090#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1886#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 2926#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0)), Black: 3382#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= ~x1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1824#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2012#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2030#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 2092#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1890#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= ~x1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2086#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= ~size~0 1) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1796#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2078#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= ~size~0 1) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2064#(and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2004#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 1841#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1851#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 2020#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1966#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1834#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2044#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1988#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1910#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2080#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~size~0 1) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2120#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= ~x2~0 ~x1~0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2124#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= ~x2~0 ~x1~0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1862#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 1970#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2102#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= ~size~0 1) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1954#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= ~size~0 1) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 3743#(and (<= (+ 4294967297 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) |thread2Thread1of1ForFork0_~i~1#1| (* (div (+ (* (- 1) |thread2Thread1of1ForFork0_~i~1#1|) ~n~0 4294967293 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) 4294967296))) (<= (+ 4294967297 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ ~n~0 (* (- 1) |thread2Thread1of1ForFork0_#t~post16#1|) 4294967293 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) |thread2Thread1of1ForFork0_#t~post16#1|)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1994#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1972#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3731#(and (<= (+ (* (div ~n~0 4294967296) 4294967296) 4294967298) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) |thread2Thread1of1ForFork0_~i~1#1| (* (div (+ (* (- 1) |thread2Thread1of1ForFork0_~i~1#1|) 4294967294 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) 4294967296))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2108#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 3727#(and (< (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (div ~n~0 4294967296)) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3733#(<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))), Black: 2118#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 3729#(and (<= (+ 4294967297 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) |thread2Thread1of1ForFork0_~i~1#1| (* (div (+ (* (- 1) |thread2Thread1of1ForFork0_~i~1#1|) ~n~0 4294967293 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) 4294967296))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1847#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 3741#(and (<= (+ 4294967297 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) |thread2Thread1of1ForFork0_~i~1#1| (* (div (+ (* (- 1) |thread2Thread1of1ForFork0_~i~1#1|) ~n~0 4294967293 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork0_#t~post14#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1864#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1956#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~size~0 1) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 3749#(and (<= (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ (* (div ~n~0 4294967296) 4294967296) 4294967298) (+ (* (div (+ (* (- 1) |thread2Thread1of1ForFork0_#t~post18#1|) 4294967294 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_#t~post18#1| |thread1Thread1of1ForFork1_~i~0#1|)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3745#(and (<= (+ 4294967297 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ ~n~0 (* (- 1) |thread2Thread1of1ForFork0_#t~post16#1|) 4294967293 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) |thread2Thread1of1ForFork0_#t~post16#1|)) (<= (+ (* (div ~n~0 4294967296) 4294967296) 4294967298) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) |thread2Thread1of1ForFork0_~i~1#1| (* (div (+ (* (- 1) |thread2Thread1of1ForFork0_~i~1#1|) 4294967294 ~n~0 (* (div (+ ~n~0 4294967293) 4294967296) (- 4294967296))) 4294967296) 4294967296))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2084#(and (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1926#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2054#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1868#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2067#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 857#(and (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2014#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2088#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1992#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 2028#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 1914#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2156#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= ~x2~0 ~x1~0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 2018#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1982#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1811#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1896#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1978#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2058#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1815#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2112#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2002#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2062#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2100#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2096#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~size~0 1) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1986#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1944#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2076#(and (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1884#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1900#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1924#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1838#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1912#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2026#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 2040#(and (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2042#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1888#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1804#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2038#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2000#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1948#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~size~0 1) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1960#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2110#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (= ~x2~0 ~x1~0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1818#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2036#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 1802#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1813#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1974#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1874#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 2050#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1043#(and (= ~x1~0 0) (<= ~size~0 1)), Black: 2032#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|))), Black: 1990#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), 2379#true, Black: 2069#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~size~0 1) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2052#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1880#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1807#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1790#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= ~x2~0 ~x1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2056#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~size~0 1) (= |thread1Thread1of1ForFork1_#t~post2#1| 0) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2006#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2152#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1)), Black: 2010#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2034#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (= |thread1Thread1of1ForFork1_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (<= ~size~0 1) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1980#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)) ~n~0)) (or (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (<= 0 ~x2~0) (< ~x2~0 1))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2074#(and (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~x2~0 ~x1~0) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 2060#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork0_#t~mem17#1|) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= ~n~0 (+ (* (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1)) (<= 0 ~x2~0) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1876#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 0 (div (+ (- 1) ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296)) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= 0 ~x2~0) (< ~x2~0 1) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (not (<= (+ (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296) 1) 0))), Black: 1788#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 260#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 261#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296) 4294967293) (+ (* (div (+ ~n~0 4294967293) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|))), Black: 268#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (<= (+ (div (+ 4294967292 ~n~0) 4294967296) 1) (div (+ ~n~0 4294967293) 4294967296)))), Black: 2311#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread2Thread1of1ForFork0_#t~post14#1| 0) (<= (+ (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296) 4294967293) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|))), Black: 2301#(<= (+ (* (div ~n~0 4294967296) 4294967296) 1) ~n~0), Black: 2302#(and (<= (+ (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 2321#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) 4294967296) 4294967295 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|))), Black: 2317#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ 4294967294 (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_#t~post16#1| 2) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_#t~post16#1|)) (<= (+ (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) 4294967296) 4294967295 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ (* 4294967296 (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) 4294967294 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|))), Black: 2319#(and (<= (+ 4294967294 (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_#t~post16#1| 2) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_#t~post16#1|)) (<= (+ (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) 4294967296) 4294967295 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|))), Black: 2325#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_#t~post18#1| 1) 4294967296) 4294967296) 4294967295 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_#t~post18#1|))), Black: 2303#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296) 4294967293) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|))), Black: 2299#true, Black: 2323#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) 4294967296) 4294967295 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_#t~post18#1| 1) 4294967296) 4294967296) 4294967295 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_#t~post18#1|))), Black: 2315#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) 4294967296) 4294967295 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ (* 4294967296 (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) 4294967294 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|))), Black: 2313#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) 4294967296) 4294967295 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|)) (<= (+ (div ~n~0 4294967296) 1 (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) 3) 4294967296)) (div (+ 4294967292 ~n~0) 4294967296)) (<= (+ (* 4294967296 (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (- 1) ~n~0) |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) 4294967294 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|)) (= |thread2Thread1of1ForFork0_#t~post14#1| 0)), Black: 278#(and (not (<= (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1) 0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~n~0 4294967296) 4294967296)) ~n~0)), Black: 297#(and (not (<= (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1) 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~n~0 4294967296) 4294967296)) ~n~0)), Black: 291#(and (<= (+ 4 (* (div ~n~0 4294967296) 4294967296)) ~n~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread2Thread1of1ForFork0_#t~post14#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 283#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 276#(and (<= (+ 4294967292 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 280#(and (<= (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) ~n~0) (* (div (+ ~n~0 4294967293) 4294967296) 8589934592)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 273#(= |thread1Thread1of1ForFork1_~i~0#1| 0), Black: 295#(and (<= (+ 4 (* (div ~n~0 4294967296) 4294967296)) ~n~0) (not (<= (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1) 0)) (= |thread2Thread1of1ForFork0_#t~post14#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~n~0 4294967296) 4294967296)) ~n~0)), Black: 293#(and (<= (+ 4 (* (div ~n~0 4294967296) 4294967296)) ~n~0) (not (<= (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1) 0)) (= |thread2Thread1of1ForFork0_#t~post14#1| 0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~n~0 4294967296) 4294967296)) ~n~0)), Black: 287#(and (<= (+ 4294967292 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2342#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 2340#true, Black: 2366#(and (<= (+ 4294967294 ~n~0) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_#t~post18#1| (* 4294967296 (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) (- 4294967296)) (* (- 1) |thread2Thread1of1ForFork0_#t~post18#1|) 4294967294 ~n~0) 4294967296)))) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ 4294967294 ~n~0) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) (- 4294967296)) (* (- 1) |thread2Thread1of1ForFork0_~i~1#1|) 4294967294 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|))), Black: 2370#(<= (+ 4294967295 ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)) (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296))), Black: 2368#(and (or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ 4294967295 ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)) (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296)))) (<= (+ 4294967294 ~n~0) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_#t~post18#1| (* 4294967296 (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) (- 4294967296)) (* (- 1) |thread2Thread1of1ForFork0_#t~post18#1|) 4294967294 ~n~0) 4294967296))))), 274#(<= (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) ~n~0) (* (div (+ ~n~0 4294967293) 4294967296) 8589934592)), Black: 2364#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ 4294967294 ~n~0) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) (- 4294967296)) (* (- 1) |thread2Thread1of1ForFork0_~i~1#1|) 4294967294 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork0_~i~1#1|))), 109#L93-2true, Black: 838#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 329#(<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296)) (+ 4294967294 ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))), Black: 337#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296)) (+ 4294967294 ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= 1 |thread2Thread1of1ForFork0_#t~post16#1|) (<= (+ 4294967292 ~n~0) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) (- 4294967296)) ~n~0 (* (- 1) |thread2Thread1of1ForFork0_#t~post16#1|) 4294967293) 4294967296) 4294967296)))), Black: 327#(and (<= (+ 4294967292 ~n~0) (+ (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296) (* (div (+ (* (div (+ 4294967292 ~n~0) 4294967296) (- 4294967296)) (* (- 1) |thread2Thread1of1ForFork0_~i~1#1|) ~n~0 4294967293) 4294967296) 4294967296))) (<= 1 |thread2Thread1of1ForFork0_~i~1#1|)), 255#true, Black: 383#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< (div ~n~0 4294967296) (+ (div (+ 4294967292 ~n~0) 4294967296) (div |thread1Thread1of1ForFork1_~i~0#1| 4294967296)))), 322#true, 2349#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))) (<= (+ 4294967295 ~n~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)) (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~n~0 4294967296) 4294967296)))), 4177#(and (<= (+ 4294967292 ~n~0) (* (div (+ 4294967292 ~n~0) 4294967296) 4294967296)) (= |thread2Thread1of1ForFork0_~i~1#1| 3)), 852#true]) [2022-01-19 09:29:09,384 INFO L384 tUnfolder$Statistics]: this new event has 163 ancestors and is cut-off event [2022-01-19 09:29:09,384 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-01-19 09:29:09,384 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-01-19 09:29:09,384 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-01-19 09:29:12,168 INFO L129 PetriNetUnfolder]: 5911/26030 cut-off events. [2022-01-19 09:29:12,168 INFO L130 PetriNetUnfolder]: For 512566/513694 co-relation queries the response was YES. [2022-01-19 09:29:12,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134202 conditions, 26030 events. 5911/26030 cut-off events. For 512566/513694 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 316088 event pairs, 1059 based on Foata normal form. 389/25476 useless extension candidates. Maximal degree in co-relation 133927. Up to 2621 conditions per place. [2022-01-19 09:29:13,051 INFO L132 encePairwiseOnDemand]: 255/269 looper letters, 215 selfloop transitions, 107 changer transitions 15/2175 dead transitions. [2022-01-19 09:29:13,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 863 places, 2175 transitions, 22288 flow [2022-01-19 09:29:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 09:29:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 09:29:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2836 transitions. [2022-01-19 09:29:13,054 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8109808407206177 [2022-01-19 09:29:13,054 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2836 transitions. [2022-01-19 09:29:13,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2836 transitions. [2022-01-19 09:29:13,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:29:13,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2836 transitions. [2022-01-19 09:29:13,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 218.15384615384616) internal successors, (2836), 13 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:29:13,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 269.0) internal successors, (3766), 14 states have internal predecessors, (3766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:29:13,060 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 269.0) internal successors, (3766), 14 states have internal predecessors, (3766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:29:13,060 INFO L186 Difference]: Start difference. First operand has 852 places, 2053 transitions, 20029 flow. Second operand 13 states and 2836 transitions. [2022-01-19 09:29:13,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 863 places, 2175 transitions, 22288 flow [2022-01-19 09:29:17,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 856 places, 2175 transitions, 21981 flow, removed 40 selfloop flow, removed 7 redundant places. [2022-01-19 09:29:17,256 INFO L242 Difference]: Finished difference. Result has 857 places, 2053 transitions, 20008 flow [2022-01-19 09:29:17,258 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=19775, PETRI_DIFFERENCE_MINUEND_PLACES=844, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=20008, PETRI_PLACES=857, PETRI_TRANSITIONS=2053} [2022-01-19 09:29:17,258 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 616 predicate places. [2022-01-19 09:29:17,259 INFO L470 AbstractCegarLoop]: Abstraction has has 857 places, 2053 transitions, 20008 flow [2022-01-19 09:29:17,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 213.3) internal successors, (2133), 10 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:29:17,259 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:29:17,259 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:29:17,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-19 09:29:17,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:29:17,476 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:29:17,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:29:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 911783814, now seen corresponding path program 1 times [2022-01-19 09:29:17,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:29:17,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299881395] [2022-01-19 09:29:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:29:17,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:29:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:29:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:29:17,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:29:17,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299881395] [2022-01-19 09:29:17,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299881395] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:29:17,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430188745] [2022-01-19 09:29:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:29:17,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:29:17,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:29:17,880 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-01-19 09:29:17,895 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-01-19 09:29:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:29:18,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-19 09:29:18,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:29:19,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 09:29:19,833 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:29:19,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 13 [2022-01-19 09:29:19,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-01-19 09:29:19,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:29:20,797 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:29:20,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2022-01-19 09:29:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:29:22,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430188745] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:29:22,118 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:29:22,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 22] total 56 [2022-01-19 09:29:22,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616739889] [2022-01-19 09:29:22,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:29:22,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-19 09:29:22,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:29:22,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-19 09:29:22,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2845, Unknown=0, NotChecked=0, Total=3080 [2022-01-19 09:29:22,122 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 269 [2022-01-19 09:29:22,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 857 places, 2053 transitions, 20008 flow. Second operand has 56 states, 56 states have (on average 93.42857142857143) internal successors, (5232), 56 states have internal predecessors, (5232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:29:22,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:29:22,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 269 [2022-01-19 09:29:22,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:30:54,078 INFO L129 PetriNetUnfolder]: 66263/142541 cut-off events. [2022-01-19 09:30:54,078 INFO L130 PetriNetUnfolder]: For 3041018/3043374 co-relation queries the response was YES. [2022-01-19 09:31:05,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 779116 conditions, 142541 events. 66263/142541 cut-off events. For 3041018/3043374 co-relation queries the response was YES. Maximal size of possible extension queue 1961. Compared 1642974 event pairs, 13874 based on Foata normal form. 953/140475 useless extension candidates. Maximal degree in co-relation 778840. Up to 67228 conditions per place. [2022-01-19 09:31:05,846 INFO L132 encePairwiseOnDemand]: 193/269 looper letters, 2905 selfloop transitions, 776 changer transitions 8/3914 dead transitions. [2022-01-19 09:31:05,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 3914 transitions, 46535 flow [2022-01-19 09:31:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-01-19 09:31:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2022-01-19 09:31:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 14119 transitions. [2022-01-19 09:31:05,858 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.36449297810821973 [2022-01-19 09:31:05,858 INFO L72 ComplementDD]: Start complementDD. Operand 144 states and 14119 transitions. [2022-01-19 09:31:05,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 14119 transitions. [2022-01-19 09:31:05,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:31:05,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 144 states and 14119 transitions. [2022-01-19 09:31:05,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 145 states, 144 states have (on average 98.04861111111111) internal successors, (14119), 144 states have internal predecessors, (14119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:05,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 145 states, 145 states have (on average 269.0) internal successors, (39005), 145 states have internal predecessors, (39005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:05,909 INFO L81 ComplementDD]: Finished complementDD. Result has 145 states, 145 states have (on average 269.0) internal successors, (39005), 145 states have internal predecessors, (39005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:05,909 INFO L186 Difference]: Start difference. First operand has 857 places, 2053 transitions, 20008 flow. Second operand 144 states and 14119 transitions. [2022-01-19 09:31:05,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 3914 transitions, 46535 flow [2022-01-19 09:31:40,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 3914 transitions, 46236 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-01-19 09:31:40,553 INFO L242 Difference]: Finished difference. Result has 1090 places, 2425 transitions, 26630 flow [2022-01-19 09:31:40,555 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=19800, PETRI_DIFFERENCE_MINUEND_PLACES=846, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=434, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=144, PETRI_FLOW=26630, PETRI_PLACES=1090, PETRI_TRANSITIONS=2425} [2022-01-19 09:31:40,555 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 849 predicate places. [2022-01-19 09:31:40,555 INFO L470 AbstractCegarLoop]: Abstraction has has 1090 places, 2425 transitions, 26630 flow [2022-01-19 09:31:40,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 93.42857142857143) internal successors, (5232), 56 states have internal predecessors, (5232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:40,556 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:31:40,556 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:31:40,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 09:31:40,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:40,761 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:31:40,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:31:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash -507080454, now seen corresponding path program 1 times [2022-01-19 09:31:40,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:31:40,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86372060] [2022-01-19 09:31:40,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:40,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:31:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:31:40,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:31:40,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86372060] [2022-01-19 09:31:40,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86372060] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:31:40,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122982471] [2022-01-19 09:31:40,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:40,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:40,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:31:40,930 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-01-19 09:31:40,931 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-01-19 09:31:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:41,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-19 09:31:41,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:31:41,723 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 09:31:41,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-01-19 09:31:41,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-01-19 09:31:41,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:31:42,364 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 09:31:42,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-01-19 09:31:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:31:43,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122982471] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:31:43,072 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:31:43,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 36 [2022-01-19 09:31:43,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428437389] [2022-01-19 09:31:43,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:31:43,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-19 09:31:43,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:31:43,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-19 09:31:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2022-01-19 09:31:43,076 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 269 [2022-01-19 09:31:43,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1090 places, 2425 transitions, 26630 flow. Second operand has 36 states, 36 states have (on average 106.13888888888889) internal successors, (3821), 36 states have internal predecessors, (3821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:43,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:31:43,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 269 [2022-01-19 09:31:43,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand