/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-After.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 15:23:57,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 15:23:57,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 15:23:57,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 15:23:57,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 15:23:57,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 15:23:57,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 15:23:57,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 15:23:57,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 15:23:57,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 15:23:57,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 15:23:57,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 15:23:57,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 15:23:57,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 15:23:57,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 15:23:57,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 15:23:57,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 15:23:57,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 15:23:57,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 15:23:57,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 15:23:57,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 15:23:57,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 15:23:57,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 15:23:57,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 15:23:57,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 15:23:57,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 15:23:57,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 15:23:57,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 15:23:57,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 15:23:57,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 15:23:57,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 15:23:57,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 15:23:57,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 15:23:57,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 15:23:57,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 15:23:57,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 15:23:57,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 15:23:57,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 15:23:57,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 15:23:57,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 15:23:57,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 15:23:57,469 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-After.epf [2022-01-19 15:23:57,503 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 15:23:57,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 15:23:57,504 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 15:23:57,504 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 15:23:57,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 15:23:57,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 15:23:57,505 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 15:23:57,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 15:23:57,505 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 15:23:57,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 15:23:57,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 15:23:57,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 15:23:57,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 15:23:57,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 15:23:57,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 15:23:57,506 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 15:23:57,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 15:23:57,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 15:23:57,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 15:23:57,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 15:23:57,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 15:23:57,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 15:23:57,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 15:23:57,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 15:23:57,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 15:23:57,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 15:23:57,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 15:23:57,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 15:23:57,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 15:23:57,509 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 15:23:57,509 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 15:23:57,509 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 15:23:57,509 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 15:23:57,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 15:23:57,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 15:23:57,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 15:23:57,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 15:23:57,763 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 15:23:57,764 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 15:23:57,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dea7d72/5903d46b26c248558cc874a6a4faf0da/FLAG4b78e5816 [2022-01-19 15:23:58,203 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 15:23:58,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-01-19 15:23:58,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dea7d72/5903d46b26c248558cc874a6a4faf0da/FLAG4b78e5816 [2022-01-19 15:23:58,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dea7d72/5903d46b26c248558cc874a6a4faf0da [2022-01-19 15:23:58,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 15:23:58,231 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 15:23:58,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 15:23:58,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 15:23:58,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 15:23:58,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@590f5572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58, skipping insertion in model container [2022-01-19 15:23:58,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 15:23:58,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 15:23:58,447 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 15:23:58,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 15:23:58,469 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 15:23:58,493 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 15:23:58,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 15:23:58,510 INFO L208 MainTranslator]: Completed translation [2022-01-19 15:23:58,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58 WrapperNode [2022-01-19 15:23:58,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 15:23:58,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 15:23:58,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 15:23:58,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 15:23:58,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,549 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 204 [2022-01-19 15:23:58,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 15:23:58,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 15:23:58,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 15:23:58,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 15:23:58,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 15:23:58,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 15:23:58,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 15:23:58,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 15:23:58,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (1/1) ... [2022-01-19 15:23:58,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 15:23:58,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:23:58,637 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 15:23:58,649 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 15:23:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 15:23:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 15:23:58,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 15:23:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 15:23:58,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 15:23:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 15:23:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 15:23:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 15:23:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 15:23:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 15:23:58,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 15:23:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 15:23:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 15:23:58,674 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 15:23:58,741 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 15:23:58,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 15:23:59,040 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 15:23:59,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 15:23:59,050 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 15:23:59,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:23:59 BoogieIcfgContainer [2022-01-19 15:23:59,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 15:23:59,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 15:23:59,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 15:23:59,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 15:23:59,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 03:23:58" (1/3) ... [2022-01-19 15:23:59,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d23e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:23:59, skipping insertion in model container [2022-01-19 15:23:59,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:58" (2/3) ... [2022-01-19 15:23:59,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d23e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:23:59, skipping insertion in model container [2022-01-19 15:23:59,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:23:59" (3/3) ... [2022-01-19 15:23:59,072 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2022-01-19 15:23:59,088 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 15:23:59,088 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 15:23:59,088 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 15:23:59,172 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,173 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,173 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,175 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 15:23:59,176 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 15:23:59,176 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 15:23:59,176 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 15:23:59,176 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 15:23:59,176 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 15:23:59,176 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 15:23:59,177 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 15:23:59,177 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 15:23:59,177 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 15:23:59,177 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 15:23:59,177 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 15:23:59,177 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,179 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,179 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,179 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,179 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,179 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,179 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,180 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,180 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,180 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,180 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,187 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 15:23:59,188 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 15:23:59,188 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 15:23:59,188 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 15:23:59,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,190 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 15:23:59,190 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 15:23:59,190 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 15:23:59,190 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 15:23:59,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 15:23:59,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 15:23:59,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,192 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 15:23:59,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 15:23:59,192 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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,194 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 15:23:59,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,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 15:23:59,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 15:23:59,195 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 15:23:59,195 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 15:23:59,195 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 15:23:59,195 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 15:23:59,195 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 15:23:59,195 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 15:23:59,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 15:23:59,196 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 15:23:59,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 15:23:59,196 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 15:23:59,196 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 15:23:59,196 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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,199 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 15:23:59,199 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 15:23:59,199 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 15:23:59,199 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 15:23:59,200 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 15:23:59,200 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 15:23:59,200 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 15:23:59,200 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 15:23:59,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,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 15:23:59,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,202 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,203 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,204 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,206 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,209 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 15:23:59,210 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 15:23:59,210 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,210 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,210 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,210 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,211 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,211 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,211 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 15:23:59,211 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 15:23:59,211 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,211 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,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 15:23:59,212 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 15:23:59,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 15:23:59,212 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 15:23:59,212 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 15:23:59,212 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 15:23:59,212 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 15:23:59,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 15:23:59,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,214 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,215 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,215 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,215 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,215 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,215 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,215 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,216 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 15:23:59,216 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 15:23:59,216 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 15:23:59,216 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 15:23:59,216 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 15:23:59,216 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 15:23:59,217 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 15:23:59,217 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 15:23:59,217 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 15:23:59,217 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 15:23:59,217 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 15:23:59,217 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 15:23:59,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,220 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 15:23:59,220 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 15:23:59,221 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 15:23:59,221 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 15:23:59,221 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 15:23:59,221 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 15:23:59,221 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 15:23:59,221 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 15:23:59,221 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 15:23:59,221 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 15:23:59,222 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 15:23:59,222 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 15:23:59,222 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,222 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,222 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,224 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 15:23:59,224 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 15:23:59,224 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 15:23:59,225 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 15:23:59,225 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 15:23:59,225 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 15:23:59,225 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 15:23:59,225 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 15:23:59,225 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 15:23:59,225 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 15:23:59,225 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 15:23:59,226 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 15:23:59,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,228 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,228 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,228 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,230 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,231 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 15:23:59,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,232 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 15:23:59,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,236 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,236 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 15:23:59,236 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,236 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,236 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,236 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:59,236 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 15:23:59,239 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 15:23:59,295 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 15:23:59,304 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 15:23:59,306 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 15:23:59,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 252 places, 269 transitions, 554 flow [2022-01-19 15:23:59,465 INFO L129 PetriNetUnfolder]: 24/267 cut-off events. [2022-01-19 15:23:59,465 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 15:23:59,474 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 15:23:59,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 269 transitions, 554 flow [2022-01-19 15:23:59,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 258 transitions, 528 flow [2022-01-19 15:23:59,538 INFO L129 PetriNetUnfolder]: 20/215 cut-off events. [2022-01-19 15:23:59,539 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 15:23:59,539 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:59,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] [2022-01-19 15:23:59,556 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2100965146, now seen corresponding path program 1 times [2022-01-19 15:23:59,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:59,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12670455] [2022-01-19 15:23:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:59,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:59,839 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 15:23:59,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:59,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12670455] [2022-01-19 15:23:59,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12670455] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:59,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:59,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 15:23:59,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009048480] [2022-01-19 15:23:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:59,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 15:23:59,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 15:23:59,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 15:23:59,885 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 269 [2022-01-19 15:23:59,895 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 15:23:59,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:59,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 269 [2022-01-19 15:23:59,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:59,942 INFO L129 PetriNetUnfolder]: 7/241 cut-off events. [2022-01-19 15:23:59,942 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 15:23:59,944 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 15:23:59,945 INFO L132 encePairwiseOnDemand]: 252/269 looper letters, 4 selfloop transitions, 0 changer transitions 4/241 dead transitions. [2022-01-19 15:23:59,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 241 transitions, 502 flow [2022-01-19 15:23:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 15:23:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 15:23:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 515 transitions. [2022-01-19 15:23:59,958 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9572490706319703 [2022-01-19 15:23:59,959 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 515 transitions. [2022-01-19 15:23:59,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 515 transitions. [2022-01-19 15:23:59,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:59,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 515 transitions. [2022-01-19 15:23:59,966 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 15:23:59,972 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 15:23:59,973 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 15:23:59,975 INFO L186 Difference]: Start difference. First operand has 241 places, 258 transitions, 528 flow. Second operand 2 states and 515 transitions. [2022-01-19 15:23:59,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 241 transitions, 502 flow [2022-01-19 15:23:59,979 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 15:23:59,983 INFO L242 Difference]: Finished difference. Result has 238 places, 237 transitions, 478 flow [2022-01-19 15:23:59,985 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 15:23:59,988 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, -3 predicate places. [2022-01-19 15:23:59,988 INFO L470 AbstractCegarLoop]: Abstraction has has 238 places, 237 transitions, 478 flow [2022-01-19 15:23:59,989 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 15:23:59,989 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:59,989 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 15:23:59,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 15:23:59,990 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash -381179899, now seen corresponding path program 1 times [2022-01-19 15:23:59,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:59,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270036405] [2022-01-19 15:23:59,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:59,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:00,229 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 15:24:00,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:00,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270036405] [2022-01-19 15:24:00,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270036405] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:00,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:00,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 15:24:00,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928216879] [2022-01-19 15:24:00,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:00,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 15:24:00,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:00,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 15:24:00,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 15:24:00,234 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 269 [2022-01-19 15:24:00,236 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 15:24:00,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:00,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 269 [2022-01-19 15:24:00,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:00,441 INFO L129 PetriNetUnfolder]: 209/989 cut-off events. [2022-01-19 15:24:00,442 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-01-19 15:24:00,445 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 15:24:00,450 INFO L132 encePairwiseOnDemand]: 263/269 looper letters, 49 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2022-01-19 15:24:00,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 254 transitions, 622 flow [2022-01-19 15:24:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 15:24:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 15:24:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 911 transitions. [2022-01-19 15:24:00,454 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8466542750929368 [2022-01-19 15:24:00,454 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 911 transitions. [2022-01-19 15:24:00,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 911 transitions. [2022-01-19 15:24:00,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:00,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 911 transitions. [2022-01-19 15:24:00,457 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 15:24:00,461 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 15:24:00,462 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 15:24:00,462 INFO L186 Difference]: Start difference. First operand has 238 places, 237 transitions, 478 flow. Second operand 4 states and 911 transitions. [2022-01-19 15:24:00,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 254 transitions, 622 flow [2022-01-19 15:24:00,466 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 15:24:00,473 INFO L242 Difference]: Finished difference. Result has 239 places, 241 transitions, 512 flow [2022-01-19 15:24:00,473 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 15:24:00,474 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, -2 predicate places. [2022-01-19 15:24:00,474 INFO L470 AbstractCegarLoop]: Abstraction has has 239 places, 241 transitions, 512 flow [2022-01-19 15:24:00,475 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 15:24:00,475 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:00,475 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 15:24:00,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 15:24:00,476 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1599953335, now seen corresponding path program 1 times [2022-01-19 15:24:00,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:00,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321369841] [2022-01-19 15:24:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:00,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:00,709 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 15:24:00,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:00,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321369841] [2022-01-19 15:24:00,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321369841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:00,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:00,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 15:24:00,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871347060] [2022-01-19 15:24:00,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:00,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 15:24:00,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:00,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 15:24:00,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 15:24:00,713 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 269 [2022-01-19 15:24:00,714 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 15:24:00,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:00,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 269 [2022-01-19 15:24:00,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:00,953 INFO L129 PetriNetUnfolder]: 195/921 cut-off events. [2022-01-19 15:24:00,953 INFO L130 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-01-19 15:24:00,956 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 15:24:00,962 INFO L132 encePairwiseOnDemand]: 264/269 looper letters, 46 selfloop transitions, 4 changer transitions 0/250 dead transitions. [2022-01-19 15:24:00,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 250 transitions, 629 flow [2022-01-19 15:24:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 15:24:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 15:24:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 907 transitions. [2022-01-19 15:24:00,965 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8429368029739777 [2022-01-19 15:24:00,965 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 907 transitions. [2022-01-19 15:24:00,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 907 transitions. [2022-01-19 15:24:00,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:00,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 907 transitions. [2022-01-19 15:24:00,968 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 15:24:00,970 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 15:24:00,971 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 15:24:00,971 INFO L186 Difference]: Start difference. First operand has 239 places, 241 transitions, 512 flow. Second operand 4 states and 907 transitions. [2022-01-19 15:24:00,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 250 transitions, 629 flow [2022-01-19 15:24:00,974 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 15:24:00,978 INFO L242 Difference]: Finished difference. Result has 242 places, 240 transitions, 512 flow [2022-01-19 15:24:00,978 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 15:24:00,980 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 1 predicate places. [2022-01-19 15:24:00,980 INFO L470 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 512 flow [2022-01-19 15:24:00,981 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 15:24:00,981 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:00,981 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 15:24:00,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 15:24:00,982 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:00,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1706270672, now seen corresponding path program 1 times [2022-01-19 15:24:00,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:00,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668484288] [2022-01-19 15:24:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:00,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:01,643 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 15:24:01,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:01,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668484288] [2022-01-19 15:24:01,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668484288] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:01,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:01,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 15:24:01,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949951159] [2022-01-19 15:24:01,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:01,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 15:24:01,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:01,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 15:24:01,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 15:24:01,648 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 269 [2022-01-19 15:24:01,650 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 15:24:01,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:01,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 269 [2022-01-19 15:24:01,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:04,811 INFO L129 PetriNetUnfolder]: 577/2766 cut-off events. [2022-01-19 15:24:04,811 INFO L130 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-01-19 15:24:04,819 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 15:24:04,829 INFO L132 encePairwiseOnDemand]: 256/269 looper letters, 170 selfloop transitions, 35 changer transitions 0/401 dead transitions. [2022-01-19 15:24:04,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 401 transitions, 1311 flow [2022-01-19 15:24:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 15:24:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 15:24:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3571 transitions. [2022-01-19 15:24:04,878 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8296933085501859 [2022-01-19 15:24:04,878 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3571 transitions. [2022-01-19 15:24:04,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3571 transitions. [2022-01-19 15:24:04,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:04,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3571 transitions. [2022-01-19 15:24:04,887 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 15:24:04,895 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 15:24:04,897 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 15:24:04,897 INFO L186 Difference]: Start difference. First operand has 242 places, 240 transitions, 512 flow. Second operand 16 states and 3571 transitions. [2022-01-19 15:24:04,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 401 transitions, 1311 flow [2022-01-19 15:24:04,901 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 15:24:04,905 INFO L242 Difference]: Finished difference. Result has 264 places, 268 transitions, 739 flow [2022-01-19 15:24:04,906 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 15:24:04,907 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 23 predicate places. [2022-01-19 15:24:04,907 INFO L470 AbstractCegarLoop]: Abstraction has has 264 places, 268 transitions, 739 flow [2022-01-19 15:24:04,908 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 15:24:04,908 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:04,908 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 15:24:04,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 15:24:04,909 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1578631382, now seen corresponding path program 1 times [2022-01-19 15:24:04,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:04,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147941845] [2022-01-19 15:24:04,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:04,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:05,075 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 15:24:05,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:05,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147941845] [2022-01-19 15:24:05,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147941845] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:05,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:05,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 15:24:05,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451676330] [2022-01-19 15:24:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:05,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 15:24:05,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:05,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 15:24:05,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 15:24:05,078 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 15:24:05,079 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 15:24:05,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:05,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 15:24:05,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:05,843 INFO L129 PetriNetUnfolder]: 572/2836 cut-off events. [2022-01-19 15:24:05,843 INFO L130 PetriNetUnfolder]: For 2987/2987 co-relation queries the response was YES. [2022-01-19 15:24:05,854 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 15:24:05,866 INFO L132 encePairwiseOnDemand]: 261/269 looper letters, 118 selfloop transitions, 21 changer transitions 0/338 dead transitions. [2022-01-19 15:24:05,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 338 transitions, 1234 flow [2022-01-19 15:24:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 15:24:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 15:24:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1377 transitions. [2022-01-19 15:24:05,870 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8531598513011153 [2022-01-19 15:24:05,870 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1377 transitions. [2022-01-19 15:24:05,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1377 transitions. [2022-01-19 15:24:05,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:05,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1377 transitions. [2022-01-19 15:24:05,873 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 15:24:05,875 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 15:24:05,876 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 15:24:05,876 INFO L186 Difference]: Start difference. First operand has 264 places, 268 transitions, 739 flow. Second operand 6 states and 1377 transitions. [2022-01-19 15:24:05,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 338 transitions, 1234 flow [2022-01-19 15:24:05,890 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 15:24:05,895 INFO L242 Difference]: Finished difference. Result has 269 places, 270 transitions, 812 flow [2022-01-19 15:24:05,895 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 15:24:05,898 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 28 predicate places. [2022-01-19 15:24:05,898 INFO L470 AbstractCegarLoop]: Abstraction has has 269 places, 270 transitions, 812 flow [2022-01-19 15:24:05,899 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 15:24:05,899 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:05,899 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 15:24:05,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 15:24:05,899 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:05,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:05,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1765536420, now seen corresponding path program 2 times [2022-01-19 15:24:05,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:05,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119648049] [2022-01-19 15:24:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:05,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:06,129 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 15:24:06,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:06,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119648049] [2022-01-19 15:24:06,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119648049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:06,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:06,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 15:24:06,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829290971] [2022-01-19 15:24:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:06,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 15:24:06,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:06,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 15:24:06,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 15:24:06,132 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 269 [2022-01-19 15:24:06,134 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 15:24:06,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:06,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 269 [2022-01-19 15:24:06,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:06,642 INFO L129 PetriNetUnfolder]: 411/2207 cut-off events. [2022-01-19 15:24:06,642 INFO L130 PetriNetUnfolder]: For 3555/3744 co-relation queries the response was YES. [2022-01-19 15:24:06,651 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 15:24:06,659 INFO L132 encePairwiseOnDemand]: 257/269 looper letters, 71 selfloop transitions, 22 changer transitions 0/304 dead transitions. [2022-01-19 15:24:06,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 304 transitions, 1223 flow [2022-01-19 15:24:06,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 15:24:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 15:24:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2197 transitions. [2022-01-19 15:24:06,664 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.816728624535316 [2022-01-19 15:24:06,664 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2197 transitions. [2022-01-19 15:24:06,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2197 transitions. [2022-01-19 15:24:06,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:06,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2197 transitions. [2022-01-19 15:24:06,669 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 15:24:06,673 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 15:24:06,674 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 15:24:06,674 INFO L186 Difference]: Start difference. First operand has 269 places, 270 transitions, 812 flow. Second operand 10 states and 2197 transitions. [2022-01-19 15:24:06,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 304 transitions, 1223 flow [2022-01-19 15:24:06,684 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 15:24:06,688 INFO L242 Difference]: Finished difference. Result has 280 places, 273 transitions, 870 flow [2022-01-19 15:24:06,688 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 15:24:06,690 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 39 predicate places. [2022-01-19 15:24:06,690 INFO L470 AbstractCegarLoop]: Abstraction has has 280 places, 273 transitions, 870 flow [2022-01-19 15:24:06,691 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 15:24:06,691 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:06,691 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 15:24:06,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 15:24:06,692 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:06,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash 209163142, now seen corresponding path program 1 times [2022-01-19 15:24:06,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:06,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915383757] [2022-01-19 15:24:06,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:06,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:06,822 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 15:24:06,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915383757] [2022-01-19 15:24:06,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915383757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:06,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:06,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 15:24:06,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146380932] [2022-01-19 15:24:06,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:06,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 15:24:06,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 15:24:06,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 15:24:06,828 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 15:24:06,830 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 15:24:06,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:06,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 15:24:06,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:07,267 INFO L129 PetriNetUnfolder]: 590/2967 cut-off events. [2022-01-19 15:24:07,267 INFO L130 PetriNetUnfolder]: For 4084/4095 co-relation queries the response was YES. [2022-01-19 15:24:07,280 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 15:24:07,323 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 102 selfloop transitions, 24 changer transitions 0/326 dead transitions. [2022-01-19 15:24:07,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 326 transitions, 1332 flow [2022-01-19 15:24:07,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 15:24:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 15:24:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1148 transitions. [2022-01-19 15:24:07,326 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8535315985130112 [2022-01-19 15:24:07,326 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1148 transitions. [2022-01-19 15:24:07,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1148 transitions. [2022-01-19 15:24:07,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:07,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1148 transitions. [2022-01-19 15:24:07,329 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 15:24:07,331 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 15:24:07,332 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 15:24:07,332 INFO L186 Difference]: Start difference. First operand has 280 places, 273 transitions, 870 flow. Second operand 5 states and 1148 transitions. [2022-01-19 15:24:07,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 326 transitions, 1332 flow [2022-01-19 15:24:07,341 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 15:24:07,345 INFO L242 Difference]: Finished difference. Result has 281 places, 280 transitions, 970 flow [2022-01-19 15:24:07,345 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 15:24:07,346 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 40 predicate places. [2022-01-19 15:24:07,346 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 280 transitions, 970 flow [2022-01-19 15:24:07,346 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 15:24:07,346 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:07,347 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 15:24:07,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 15:24:07,347 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash -246940562, now seen corresponding path program 2 times [2022-01-19 15:24:07,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:07,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047636860] [2022-01-19 15:24:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:07,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:07,470 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 15:24:07,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:07,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047636860] [2022-01-19 15:24:07,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047636860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:07,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:07,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 15:24:07,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496006648] [2022-01-19 15:24:07,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:07,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 15:24:07,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:07,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 15:24:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 15:24:07,473 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 15:24:07,475 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 15:24:07,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:07,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 15:24:07,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:07,897 INFO L129 PetriNetUnfolder]: 608/3075 cut-off events. [2022-01-19 15:24:07,897 INFO L130 PetriNetUnfolder]: For 4475/4475 co-relation queries the response was YES. [2022-01-19 15:24:07,911 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 15:24:07,923 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 113 selfloop transitions, 27 changer transitions 0/340 dead transitions. [2022-01-19 15:24:07,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 340 transitions, 1458 flow [2022-01-19 15:24:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 15:24:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 15:24:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1371 transitions. [2022-01-19 15:24:07,926 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8494423791821561 [2022-01-19 15:24:07,926 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1371 transitions. [2022-01-19 15:24:07,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1371 transitions. [2022-01-19 15:24:07,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:07,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1371 transitions. [2022-01-19 15:24:07,929 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 15:24:07,932 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 15:24:07,932 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 15:24:07,933 INFO L186 Difference]: Start difference. First operand has 281 places, 280 transitions, 970 flow. Second operand 6 states and 1371 transitions. [2022-01-19 15:24:07,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 340 transitions, 1458 flow [2022-01-19 15:24:07,948 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 15:24:07,952 INFO L242 Difference]: Finished difference. Result has 287 places, 284 transitions, 1055 flow [2022-01-19 15:24:07,952 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 15:24:07,953 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 46 predicate places. [2022-01-19 15:24:07,953 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 1055 flow [2022-01-19 15:24:07,954 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 15:24:07,954 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:07,954 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 15:24:07,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 15:24:07,954 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash 632279702, now seen corresponding path program 3 times [2022-01-19 15:24:07,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:07,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184675313] [2022-01-19 15:24:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:07,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:08,045 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 15:24:08,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:08,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184675313] [2022-01-19 15:24:08,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184675313] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:08,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:08,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 15:24:08,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105797259] [2022-01-19 15:24:08,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:08,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 15:24:08,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:08,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 15:24:08,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 15:24:08,048 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 15:24:08,049 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 15:24:08,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:08,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 15:24:08,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:08,511 INFO L129 PetriNetUnfolder]: 616/3067 cut-off events. [2022-01-19 15:24:08,512 INFO L130 PetriNetUnfolder]: For 4863/4867 co-relation queries the response was YES. [2022-01-19 15:24:08,528 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 15:24:08,539 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 81 selfloop transitions, 19 changer transitions 0/300 dead transitions. [2022-01-19 15:24:08,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 300 transitions, 1311 flow [2022-01-19 15:24:08,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 15:24:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 15:24:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1124 transitions. [2022-01-19 15:24:08,543 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8356877323420074 [2022-01-19 15:24:08,543 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1124 transitions. [2022-01-19 15:24:08,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1124 transitions. [2022-01-19 15:24:08,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:08,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1124 transitions. [2022-01-19 15:24:08,546 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 15:24:08,548 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 15:24:08,548 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 15:24:08,548 INFO L186 Difference]: Start difference. First operand has 287 places, 284 transitions, 1055 flow. Second operand 5 states and 1124 transitions. [2022-01-19 15:24:08,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 300 transitions, 1311 flow [2022-01-19 15:24:08,560 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 15:24:08,564 INFO L242 Difference]: Finished difference. Result has 289 places, 283 transitions, 1038 flow [2022-01-19 15:24:08,564 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 15:24:08,565 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 48 predicate places. [2022-01-19 15:24:08,565 INFO L470 AbstractCegarLoop]: Abstraction has has 289 places, 283 transitions, 1038 flow [2022-01-19 15:24:08,565 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 15:24:08,565 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:08,565 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 15:24:08,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 15:24:08,566 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 272885954, now seen corresponding path program 4 times [2022-01-19 15:24:08,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:08,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140237355] [2022-01-19 15:24:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:08,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:08,710 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 15:24:08,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:08,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140237355] [2022-01-19 15:24:08,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140237355] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:08,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:08,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 15:24:08,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700511841] [2022-01-19 15:24:08,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:08,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 15:24:08,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:08,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 15:24:08,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 15:24:08,718 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 15:24:08,731 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 15:24:08,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:08,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 15:24:08,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:09,110 INFO L129 PetriNetUnfolder]: 659/3287 cut-off events. [2022-01-19 15:24:09,111 INFO L130 PetriNetUnfolder]: For 5001/5011 co-relation queries the response was YES. [2022-01-19 15:24:09,154 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 15:24:09,162 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 95 selfloop transitions, 25 changer transitions 0/320 dead transitions. [2022-01-19 15:24:09,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 320 transitions, 1452 flow [2022-01-19 15:24:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 15:24:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 15:24:09,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions. [2022-01-19 15:24:09,165 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8370508054522925 [2022-01-19 15:24:09,165 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions. [2022-01-19 15:24:09,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions. [2022-01-19 15:24:09,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:09,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions. [2022-01-19 15:24:09,169 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 15:24:09,172 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 15:24:09,172 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 15:24:09,172 INFO L186 Difference]: Start difference. First operand has 289 places, 283 transitions, 1038 flow. Second operand 6 states and 1351 transitions. [2022-01-19 15:24:09,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 320 transitions, 1452 flow [2022-01-19 15:24:09,184 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 15:24:09,188 INFO L242 Difference]: Finished difference. Result has 289 places, 289 transitions, 1098 flow [2022-01-19 15:24:09,188 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 15:24:09,189 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 48 predicate places. [2022-01-19 15:24:09,189 INFO L470 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 1098 flow [2022-01-19 15:24:09,189 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 15:24:09,190 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:09,190 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 15:24:09,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 15:24:09,190 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1353785088, now seen corresponding path program 5 times [2022-01-19 15:24:09,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:09,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435293342] [2022-01-19 15:24:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:09,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:09,338 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 15:24:09,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:09,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435293342] [2022-01-19 15:24:09,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435293342] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:09,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:09,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 15:24:09,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848682297] [2022-01-19 15:24:09,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:09,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 15:24:09,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:09,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 15:24:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 15:24:09,341 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 15:24:09,342 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 15:24:09,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:09,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 15:24:09,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:09,804 INFO L129 PetriNetUnfolder]: 693/3477 cut-off events. [2022-01-19 15:24:09,805 INFO L130 PetriNetUnfolder]: For 5380/5392 co-relation queries the response was YES. [2022-01-19 15:24:09,821 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 15:24:09,837 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 98 selfloop transitions, 23 changer transitions 0/321 dead transitions. [2022-01-19 15:24:09,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 321 transitions, 1507 flow [2022-01-19 15:24:09,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 15:24:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 15:24:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1345 transitions. [2022-01-19 15:24:09,841 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-01-19 15:24:09,841 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1345 transitions. [2022-01-19 15:24:09,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1345 transitions. [2022-01-19 15:24:09,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:09,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1345 transitions. [2022-01-19 15:24:09,845 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 15:24:09,847 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 15:24:09,848 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 15:24:09,848 INFO L186 Difference]: Start difference. First operand has 289 places, 289 transitions, 1098 flow. Second operand 6 states and 1345 transitions. [2022-01-19 15:24:09,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 321 transitions, 1507 flow [2022-01-19 15:24:09,860 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 15:24:09,864 INFO L242 Difference]: Finished difference. Result has 292 places, 292 transitions, 1147 flow [2022-01-19 15:24:09,864 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 15:24:09,864 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 51 predicate places. [2022-01-19 15:24:09,865 INFO L470 AbstractCegarLoop]: Abstraction has has 292 places, 292 transitions, 1147 flow [2022-01-19 15:24:09,865 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 15:24:09,865 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:09,865 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 15:24:09,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 15:24:09,865 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:09,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1682285936, now seen corresponding path program 6 times [2022-01-19 15:24:09,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:09,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578331011] [2022-01-19 15:24:09,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:09,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:10,000 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 15:24:10,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:10,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578331011] [2022-01-19 15:24:10,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578331011] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:10,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:10,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 15:24:10,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080566730] [2022-01-19 15:24:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:10,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 15:24:10,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:10,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 15:24:10,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 15:24:10,003 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 15:24:10,004 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 15:24:10,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:10,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 15:24:10,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:10,476 INFO L129 PetriNetUnfolder]: 685/3467 cut-off events. [2022-01-19 15:24:10,476 INFO L130 PetriNetUnfolder]: For 5253/5262 co-relation queries the response was YES. [2022-01-19 15:24:10,491 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 15:24:10,501 INFO L132 encePairwiseOnDemand]: 262/269 looper letters, 104 selfloop transitions, 29 changer transitions 0/333 dead transitions. [2022-01-19 15:24:10,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 333 transitions, 1584 flow [2022-01-19 15:24:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 15:24:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 15:24:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1573 transitions. [2022-01-19 15:24:10,505 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8353690918746681 [2022-01-19 15:24:10,505 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1573 transitions. [2022-01-19 15:24:10,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1573 transitions. [2022-01-19 15:24:10,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:10,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1573 transitions. [2022-01-19 15:24:10,509 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 15:24:10,512 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 15:24:10,512 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 15:24:10,512 INFO L186 Difference]: Start difference. First operand has 292 places, 292 transitions, 1147 flow. Second operand 7 states and 1573 transitions. [2022-01-19 15:24:10,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 333 transitions, 1584 flow [2022-01-19 15:24:10,524 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 15:24:10,528 INFO L242 Difference]: Finished difference. Result has 294 places, 291 transitions, 1135 flow [2022-01-19 15:24:10,529 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 15:24:10,530 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 53 predicate places. [2022-01-19 15:24:10,530 INFO L470 AbstractCegarLoop]: Abstraction has has 294 places, 291 transitions, 1135 flow [2022-01-19 15:24:10,530 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 15:24:10,530 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:10,531 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 15:24:10,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 15:24:10,531 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1561652115, now seen corresponding path program 1 times [2022-01-19 15:24:10,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:10,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093724378] [2022-01-19 15:24:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:10,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:10,681 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 15:24:10,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:10,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093724378] [2022-01-19 15:24:10,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093724378] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:24:10,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419263204] [2022-01-19 15:24:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:10,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:24:10,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:24:10,687 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 15:24:10,688 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 15:24:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:10,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 15:24:10,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:24:11,174 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 15:24:11,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 15:24:11,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419263204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:11,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 15:24:11,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-01-19 15:24:11,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282299174] [2022-01-19 15:24:11,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:11,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 15:24:11,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 15:24:11,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-19 15:24:11,177 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 269 [2022-01-19 15:24:11,178 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 15:24:11,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:11,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 269 [2022-01-19 15:24:11,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:11,663 INFO L129 PetriNetUnfolder]: 512/2605 cut-off events. [2022-01-19 15:24:11,663 INFO L130 PetriNetUnfolder]: For 1551/1565 co-relation queries the response was YES. [2022-01-19 15:24:11,678 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 15:24:11,685 INFO L132 encePairwiseOnDemand]: 247/269 looper letters, 55 selfloop transitions, 15 changer transitions 18/314 dead transitions. [2022-01-19 15:24:11,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 314 transitions, 1363 flow [2022-01-19 15:24:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 15:24:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 15:24:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1950 transitions. [2022-01-19 15:24:11,690 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.724907063197026 [2022-01-19 15:24:11,690 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1950 transitions. [2022-01-19 15:24:11,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1950 transitions. [2022-01-19 15:24:11,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:11,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1950 transitions. [2022-01-19 15:24:11,695 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 15:24:11,698 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 15:24:11,699 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 15:24:11,699 INFO L186 Difference]: Start difference. First operand has 294 places, 291 transitions, 1135 flow. Second operand 10 states and 1950 transitions. [2022-01-19 15:24:11,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 314 transitions, 1363 flow [2022-01-19 15:24:11,707 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 15:24:11,711 INFO L242 Difference]: Finished difference. Result has 301 places, 292 transitions, 1108 flow [2022-01-19 15:24:11,711 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 15:24:11,712 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 60 predicate places. [2022-01-19 15:24:11,712 INFO L470 AbstractCegarLoop]: Abstraction has has 301 places, 292 transitions, 1108 flow [2022-01-19 15:24:11,713 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 15:24:11,713 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:11,713 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 15:24:11,740 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 15:24:11,931 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 15:24:11,932 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash -140437133, now seen corresponding path program 1 times [2022-01-19 15:24:11,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:11,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190060975] [2022-01-19 15:24:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:11,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:12,079 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 15:24:12,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:12,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190060975] [2022-01-19 15:24:12,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190060975] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:24:12,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962280379] [2022-01-19 15:24:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:12,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:24:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:24:12,081 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 15:24:12,110 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 15:24:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:12,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-19 15:24:12,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:24:12,998 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 15:24:13,000 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 15:24:13,096 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 15:24:13,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:24:13,776 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 15:24:13,777 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 15:24:14,595 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 15:24:14,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962280379] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:24:14,595 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:24:14,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 18] total 35 [2022-01-19 15:24:14,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698487074] [2022-01-19 15:24:14,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:24:14,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-19 15:24:14,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-19 15:24:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2022-01-19 15:24:14,603 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 269 [2022-01-19 15:24:14,606 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 15:24:14,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:14,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 269 [2022-01-19 15:24:14,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:35,321 INFO L129 PetriNetUnfolder]: 33593/71215 cut-off events. [2022-01-19 15:24:35,322 INFO L130 PetriNetUnfolder]: For 74558/74656 co-relation queries the response was YES. [2022-01-19 15:24:35,712 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 15:24:35,951 INFO L132 encePairwiseOnDemand]: 186/269 looper letters, 2662 selfloop transitions, 739 changer transitions 524/4017 dead transitions. [2022-01-19 15:24:35,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 4017 transitions, 21367 flow [2022-01-19 15:24:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2022-01-19 15:24:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2022-01-19 15:24:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 22882 transitions. [2022-01-19 15:24:36,000 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4362215232103708 [2022-01-19 15:24:36,000 INFO L72 ComplementDD]: Start complementDD. Operand 195 states and 22882 transitions. [2022-01-19 15:24:36,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 22882 transitions. [2022-01-19 15:24:36,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:36,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 195 states and 22882 transitions. [2022-01-19 15:24:36,053 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 15:24:36,129 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 15:24:36,147 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 15:24:36,147 INFO L186 Difference]: Start difference. First operand has 301 places, 292 transitions, 1108 flow. Second operand 195 states and 22882 transitions. [2022-01-19 15:24:36,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 4017 transitions, 21367 flow [2022-01-19 15:24:37,230 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 15:24:37,259 INFO L242 Difference]: Finished difference. Result has 619 places, 1024 transitions, 7762 flow [2022-01-19 15:24:37,260 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 15:24:37,261 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 378 predicate places. [2022-01-19 15:24:37,261 INFO L470 AbstractCegarLoop]: Abstraction has has 619 places, 1024 transitions, 7762 flow [2022-01-19 15:24:37,262 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 15:24:37,262 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:37,262 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 15:24:37,287 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 15:24:37,484 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 15:24:37,485 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:37,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:37,486 INFO L85 PathProgramCache]: Analyzing trace with hash 605957215, now seen corresponding path program 2 times [2022-01-19 15:24:37,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:37,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59959702] [2022-01-19 15:24:37,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:37,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:37,719 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 15:24:37,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:37,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59959702] [2022-01-19 15:24:37,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59959702] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:37,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:37,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 15:24:37,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753095180] [2022-01-19 15:24:37,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:37,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 15:24:37,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 15:24:37,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-19 15:24:37,723 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 15:24:37,724 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 15:24:37,724 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:37,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 15:24:37,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:43,424 INFO L129 PetriNetUnfolder]: 3114/15258 cut-off events. [2022-01-19 15:24:43,425 INFO L130 PetriNetUnfolder]: For 161340/162913 co-relation queries the response was YES. [2022-01-19 15:24:43,724 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 15:24:43,790 INFO L132 encePairwiseOnDemand]: 252/269 looper letters, 235 selfloop transitions, 35 changer transitions 20/1203 dead transitions. [2022-01-19 15:24:43,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 1203 transitions, 10570 flow [2022-01-19 15:24:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 15:24:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 15:24:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3294 transitions. [2022-01-19 15:24:43,794 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8163568773234201 [2022-01-19 15:24:43,794 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3294 transitions. [2022-01-19 15:24:43,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3294 transitions. [2022-01-19 15:24:43,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:43,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3294 transitions. [2022-01-19 15:24:43,799 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 15:24:43,802 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 15:24:43,803 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 15:24:43,803 INFO L186 Difference]: Start difference. First operand has 619 places, 1024 transitions, 7762 flow. Second operand 15 states and 3294 transitions. [2022-01-19 15:24:43,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 1203 transitions, 10570 flow [2022-01-19 15:24:45,425 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 15:24:45,439 INFO L242 Difference]: Finished difference. Result has 574 places, 1050 transitions, 7592 flow [2022-01-19 15:24:45,440 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 15:24:45,440 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 333 predicate places. [2022-01-19 15:24:45,440 INFO L470 AbstractCegarLoop]: Abstraction has has 574 places, 1050 transitions, 7592 flow [2022-01-19 15:24:45,441 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 15:24:45,441 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:45,441 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 15:24:45,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 15:24:45,441 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2084020009, now seen corresponding path program 3 times [2022-01-19 15:24:45,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:45,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307688689] [2022-01-19 15:24:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:45,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:45,619 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 15:24:45,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:45,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307688689] [2022-01-19 15:24:45,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307688689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:24:45,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:24:45,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 15:24:45,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584133445] [2022-01-19 15:24:45,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:24:45,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 15:24:45,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:45,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 15:24:45,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-01-19 15:24:45,622 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 15:24:45,624 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 15:24:45,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:45,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 15:24:45,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:24:48,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 15:24:51,801 INFO L129 PetriNetUnfolder]: 3098/14892 cut-off events. [2022-01-19 15:24:51,802 INFO L130 PetriNetUnfolder]: For 134279/135517 co-relation queries the response was YES. [2022-01-19 15:24:52,102 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 15:24:52,148 INFO L132 encePairwiseOnDemand]: 251/269 looper letters, 207 selfloop transitions, 72 changer transitions 20/1212 dead transitions. [2022-01-19 15:24:52,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 1212 transitions, 9667 flow [2022-01-19 15:24:52,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 15:24:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 15:24:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3478 transitions. [2022-01-19 15:24:52,152 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8080855018587361 [2022-01-19 15:24:52,152 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3478 transitions. [2022-01-19 15:24:52,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3478 transitions. [2022-01-19 15:24:52,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:24:52,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3478 transitions. [2022-01-19 15:24:52,157 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 15:24:52,159 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 15:24:52,160 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 15:24:52,161 INFO L186 Difference]: Start difference. First operand has 574 places, 1050 transitions, 7592 flow. Second operand 16 states and 3478 transitions. [2022-01-19 15:24:52,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 1212 transitions, 9667 flow [2022-01-19 15:24:52,946 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 15:24:52,960 INFO L242 Difference]: Finished difference. Result has 596 places, 1075 transitions, 8087 flow [2022-01-19 15:24:52,961 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 15:24:52,961 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 355 predicate places. [2022-01-19 15:24:52,961 INFO L470 AbstractCegarLoop]: Abstraction has has 596 places, 1075 transitions, 8087 flow [2022-01-19 15:24:52,962 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 15:24:52,962 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:24:52,962 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 15:24:52,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 15:24:52,963 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:24:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:24:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash -49083619, now seen corresponding path program 4 times [2022-01-19 15:24:52,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:24:52,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965025385] [2022-01-19 15:24:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:24:52,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:24:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:53,161 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 15:24:53,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:53,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965025385] [2022-01-19 15:24:53,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965025385] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:24:53,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860246599] [2022-01-19 15:24:53,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 15:24:53,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:24:53,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:24:53,168 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 15:24:53,171 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 15:24:53,255 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 15:24:53,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:24:53,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-19 15:24:53,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:24:54,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 15:24:54,439 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:24:54,439 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 15:24:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 15:24:54,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:24:54,704 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 15:24:54,704 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 15:24:55,691 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 15:24:55,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860246599] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:24:55,692 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:24:55,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23, 18] total 40 [2022-01-19 15:24:55,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78076284] [2022-01-19 15:24:55,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:24:55,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-19 15:24:55,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:55,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-19 15:24:55,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2022-01-19 15:24:55,696 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 269 [2022-01-19 15:24:55,697 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 15:24:55,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:55,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 269 [2022-01-19 15:24:55,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:25:42,588 INFO L129 PetriNetUnfolder]: 54001/112627 cut-off events. [2022-01-19 15:25:42,589 INFO L130 PetriNetUnfolder]: For 1248896/1249618 co-relation queries the response was YES. [2022-01-19 15:25:46,798 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 15:25:47,224 INFO L132 encePairwiseOnDemand]: 195/269 looper letters, 2731 selfloop transitions, 1084 changer transitions 15/3921 dead transitions. [2022-01-19 15:25:47,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 758 places, 3921 transitions, 46826 flow [2022-01-19 15:25:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-01-19 15:25:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2022-01-19 15:25:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 17299 transitions. [2022-01-19 15:25:47,248 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3945309827354209 [2022-01-19 15:25:47,248 INFO L72 ComplementDD]: Start complementDD. Operand 163 states and 17299 transitions. [2022-01-19 15:25:47,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 17299 transitions. [2022-01-19 15:25:47,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:25:47,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 163 states and 17299 transitions. [2022-01-19 15:25:47,281 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 15:25:47,317 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 15:25:47,326 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 15:25:47,326 INFO L186 Difference]: Start difference. First operand has 596 places, 1075 transitions, 8087 flow. Second operand 163 states and 17299 transitions. [2022-01-19 15:25:47,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 758 places, 3921 transitions, 46826 flow [2022-01-19 15:26:00,819 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 15:26:00,856 INFO L242 Difference]: Finished difference. Result has 854 places, 2011 transitions, 26705 flow [2022-01-19 15:26:00,857 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 15:26:00,857 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 613 predicate places. [2022-01-19 15:26:00,857 INFO L470 AbstractCegarLoop]: Abstraction has has 854 places, 2011 transitions, 26705 flow [2022-01-19 15:26:00,858 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 15:26:00,858 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:26:00,858 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 15:26:00,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-19 15:26:01,058 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 15:26:01,059 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:26:01,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:26:01,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2118121773, now seen corresponding path program 5 times [2022-01-19 15:26:01,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:26:01,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639029234] [2022-01-19 15:26:01,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:26:01,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:26:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:26:01,559 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 15:26:01,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:26:01,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639029234] [2022-01-19 15:26:01,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639029234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:26:01,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:26:01,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 15:26:01,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625064702] [2022-01-19 15:26:01,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:26:01,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 15:26:01,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:26:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 15:26:01,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-19 15:26:01,563 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 269 [2022-01-19 15:26:01,564 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 15:26:01,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:26:01,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 269 [2022-01-19 15:26:01,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:26:16,773 INFO L129 PetriNetUnfolder]: 7198/29868 cut-off events. [2022-01-19 15:26:16,774 INFO L130 PetriNetUnfolder]: For 658034/659266 co-relation queries the response was YES. [2022-01-19 15:26:17,743 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 15:26:17,847 INFO L132 encePairwiseOnDemand]: 253/269 looper letters, 598 selfloop transitions, 180 changer transitions 3/2232 dead transitions. [2022-01-19 15:26:17,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 867 places, 2232 transitions, 30888 flow [2022-01-19 15:26:17,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 15:26:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 15:26:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3462 transitions. [2022-01-19 15:26:17,850 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.804368029739777 [2022-01-19 15:26:17,850 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3462 transitions. [2022-01-19 15:26:17,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3462 transitions. [2022-01-19 15:26:17,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:26:17,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3462 transitions. [2022-01-19 15:26:17,854 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 15:26:17,856 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 15:26:17,857 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 15:26:17,857 INFO L186 Difference]: Start difference. First operand has 854 places, 2011 transitions, 26705 flow. Second operand 16 states and 3462 transitions. [2022-01-19 15:26:17,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 867 places, 2232 transitions, 30888 flow [2022-01-19 15:26:25,258 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 15:26:25,285 INFO L242 Difference]: Finished difference. Result has 852 places, 2053 transitions, 20029 flow [2022-01-19 15:26:25,287 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 15:26:25,287 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 611 predicate places. [2022-01-19 15:26:25,287 INFO L470 AbstractCegarLoop]: Abstraction has has 852 places, 2053 transitions, 20029 flow [2022-01-19 15:26:25,288 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 15:26:25,288 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:26:25,288 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 15:26:25,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 15:26:25,288 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:26:25,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:26:25,288 INFO L85 PathProgramCache]: Analyzing trace with hash -538122925, now seen corresponding path program 6 times [2022-01-19 15:26:25,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:26:25,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005637222] [2022-01-19 15:26:25,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:26:25,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:26:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:26:25,508 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 15:26:25,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:26:25,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005637222] [2022-01-19 15:26:25,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005637222] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:26:25,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879352743] [2022-01-19 15:26:25,509 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-19 15:26:25,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:26:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:26:25,510 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 15:26:25,511 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 15:26:25,633 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-01-19 15:26:25,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:26:25,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 15:26:25,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:26:26,063 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 15:26:26,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 15:26:26,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879352743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:26:26,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 15:26:26,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 14 [2022-01-19 15:26:26,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347280463] [2022-01-19 15:26:26,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:26:26,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 15:26:26,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:26:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 15:26:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-01-19 15:26:26,066 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 269 [2022-01-19 15:26:26,067 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 15:26:26,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:26:26,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 269 [2022-01-19 15:26:26,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:26:34,637 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 15:26:34,640 INFO L384 tUnfolder$Statistics]: this new event has 163 ancestors and is cut-off event [2022-01-19 15:26:34,640 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-01-19 15:26:34,640 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-01-19 15:26:34,640 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-01-19 15:26:37,951 INFO L129 PetriNetUnfolder]: 5911/26030 cut-off events. [2022-01-19 15:26:37,952 INFO L130 PetriNetUnfolder]: For 512566/513694 co-relation queries the response was YES. [2022-01-19 15:26:39,520 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 15:26:39,630 INFO L132 encePairwiseOnDemand]: 255/269 looper letters, 215 selfloop transitions, 107 changer transitions 15/2175 dead transitions. [2022-01-19 15:26:39,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 863 places, 2175 transitions, 22288 flow [2022-01-19 15:26:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 15:26:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 15:26:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2836 transitions. [2022-01-19 15:26:39,653 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8109808407206177 [2022-01-19 15:26:39,653 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2836 transitions. [2022-01-19 15:26:39,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2836 transitions. [2022-01-19 15:26:39,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:26:39,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2836 transitions. [2022-01-19 15:26:39,656 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 15:26:39,658 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 15:26:39,658 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 15:26:39,658 INFO L186 Difference]: Start difference. First operand has 852 places, 2053 transitions, 20029 flow. Second operand 13 states and 2836 transitions. [2022-01-19 15:26:39,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 863 places, 2175 transitions, 22288 flow [2022-01-19 15:26:44,492 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 15:26:44,519 INFO L242 Difference]: Finished difference. Result has 857 places, 2053 transitions, 20008 flow [2022-01-19 15:26:44,520 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 15:26:44,521 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 616 predicate places. [2022-01-19 15:26:44,521 INFO L470 AbstractCegarLoop]: Abstraction has has 857 places, 2053 transitions, 20008 flow [2022-01-19 15:26:44,521 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 15:26:44,521 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:26:44,521 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 15:26:44,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 15:26:44,739 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 15:26:44,740 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:26:44,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:26:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash 911783814, now seen corresponding path program 1 times [2022-01-19 15:26:44,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:26:44,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036619907] [2022-01-19 15:26:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:26:44,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:26:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:26:45,078 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 15:26:45,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:26:45,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036619907] [2022-01-19 15:26:45,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036619907] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:26:45,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170641695] [2022-01-19 15:26:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:26:45,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:26:45,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:26:45,080 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 15:26:45,083 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 15:26:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:26:45,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-19 15:26:45,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:26:46,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 15:26:46,856 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:26:46,856 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 15:26:46,987 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 15:26:46,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:26:47,857 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:26:47,857 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 15:26:49,206 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 15:26:49,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170641695] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:26:49,206 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:26:49,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 22] total 56 [2022-01-19 15:26:49,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597312101] [2022-01-19 15:26:49,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:26:49,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-19 15:26:49,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:26:49,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-19 15:26:49,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2845, Unknown=0, NotChecked=0, Total=3080 [2022-01-19 15:26:49,210 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 269 [2022-01-19 15:26:49,212 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 15:26:49,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:26:49,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 269 [2022-01-19 15:26:49,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:28:26,991 INFO L129 PetriNetUnfolder]: 66263/142541 cut-off events. [2022-01-19 15:28:26,992 INFO L130 PetriNetUnfolder]: For 3041018/3043374 co-relation queries the response was YES. [2022-01-19 15:28:37,740 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 15:28:38,329 INFO L132 encePairwiseOnDemand]: 193/269 looper letters, 2905 selfloop transitions, 776 changer transitions 8/3914 dead transitions. [2022-01-19 15:28:38,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 3914 transitions, 46535 flow [2022-01-19 15:28:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-01-19 15:28:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2022-01-19 15:28:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 14119 transitions. [2022-01-19 15:28:38,342 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.36449297810821973 [2022-01-19 15:28:38,342 INFO L72 ComplementDD]: Start complementDD. Operand 144 states and 14119 transitions. [2022-01-19 15:28:38,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 14119 transitions. [2022-01-19 15:28:38,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:28:38,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 144 states and 14119 transitions. [2022-01-19 15:28:38,359 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 15:28:38,386 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 15:28:38,393 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 15:28:38,394 INFO L186 Difference]: Start difference. First operand has 857 places, 2053 transitions, 20008 flow. Second operand 144 states and 14119 transitions. [2022-01-19 15:28:38,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 3914 transitions, 46535 flow [2022-01-19 15:29:21,418 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 15:29:21,462 INFO L242 Difference]: Finished difference. Result has 1090 places, 2425 transitions, 26630 flow [2022-01-19 15:29:21,464 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 15:29:21,464 INFO L334 CegarLoopForPetriNet]: 241 programPoint places, 849 predicate places. [2022-01-19 15:29:21,464 INFO L470 AbstractCegarLoop]: Abstraction has has 1090 places, 2425 transitions, 26630 flow [2022-01-19 15:29:21,465 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 15:29:21,465 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:29:21,465 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 15:29:21,485 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 15:29:21,679 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 15:29:21,680 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:29:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:29:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -507080454, now seen corresponding path program 1 times [2022-01-19 15:29:21,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:29:21,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142716544] [2022-01-19 15:29:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:29:21,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:29:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:29:21,859 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 15:29:21,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:29:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142716544] [2022-01-19 15:29:21,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142716544] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:29:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224648097] [2022-01-19 15:29:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:29:21,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:29:21,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:29:21,864 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 15:29:21,865 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 15:29:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:29:21,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-19 15:29:21,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:29:22,571 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 15:29:22,571 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 15:29:22,642 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 15:29:22,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:29:23,245 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 15:29:23,245 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 15:29:23,931 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 15:29:23,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224648097] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:29:23,932 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:29:23,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 36 [2022-01-19 15:29:23,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971179716] [2022-01-19 15:29:23,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:29:23,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-19 15:29:23,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:29:23,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-19 15:29:23,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2022-01-19 15:29:23,935 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 269 [2022-01-19 15:29:23,937 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 15:29:23,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:29:23,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 269 [2022-01-19 15:29:23,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand