/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:06:16,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:06:16,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:06:16,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:06:16,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:06:16,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:06:16,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:06:16,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:06:16,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:06:16,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:06:16,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:06:16,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:06:16,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:06:16,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:06:16,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:06:16,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:06:16,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:06:16,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:06:16,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:06:16,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:06:16,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:06:16,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:06:16,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:06:16,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:06:16,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:06:16,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:06:16,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:06:16,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:06:16,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:06:16,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:06:16,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:06:16,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:06:16,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:06:16,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:06:16,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:06:16,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:06:16,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:06:16,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:06:16,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:06:16,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:06:16,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:06:16,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:06:16,711 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:06:16,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:06:16,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:06:16,712 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:06:16,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:06:16,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:06:16,713 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:06:16,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:06:16,713 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:06:16,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:06:16,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:06:16,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:06:16,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:06:16,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:06:16,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:06:16,714 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:06:16,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:06:16,714 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:06:16,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:06:16,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:06:16,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:06:16,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:06:16,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:06:16,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:06:16,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:06:16,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:06:16,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:06:16,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:06:16,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:06:16,716 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:06:16,716 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:06:16,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:06:16,716 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-03-15 19:06:16,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:06:16,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:06:16,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:06:16,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:06:16,907 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:06:16,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2022-03-15 19:06:16,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16b9219d/cbb969003b9145838b2f3a07bd9dc017/FLAG90d2c69cc [2022-03-15 19:06:17,323 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:06:17,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2022-03-15 19:06:17,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16b9219d/cbb969003b9145838b2f3a07bd9dc017/FLAG90d2c69cc [2022-03-15 19:06:17,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16b9219d/cbb969003b9145838b2f3a07bd9dc017 [2022-03-15 19:06:17,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:06:17,356 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:06:17,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:06:17,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:06:17,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:06:17,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b7795c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17, skipping insertion in model container [2022-03-15 19:06:17,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:06:17,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:06:17,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c[2865,2878] [2022-03-15 19:06:17,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:06:17,601 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:06:17,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c[2865,2878] [2022-03-15 19:06:17,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:06:17,641 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:06:17,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17 WrapperNode [2022-03-15 19:06:17,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:06:17,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:06:17,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:06:17,642 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:06:17,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,690 INFO L137 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 16, calls inlined = 22, statements flattened = 275 [2022-03-15 19:06:17,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:06:17,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:06:17,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:06:17,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:06:17,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:06:17,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:06:17,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:06:17,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:06:17,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (1/1) ... [2022-03-15 19:06:17,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:06:17,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:17,745 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-03-15 19:06:17,751 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-03-15 19:06:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:06:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:06:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:06:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:06:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:06:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:06:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:06:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:06:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:06:17,773 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:06:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:06:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:06:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:06:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:06:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:06:17,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:06:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:06:17,774 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:06:17,865 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:06:17,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:06:18,243 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:06:18,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:06:18,313 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-03-15 19:06:18,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:06:18 BoogieIcfgContainer [2022-03-15 19:06:18,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:06:18,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:06:18,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:06:18,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:06:18,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:06:17" (1/3) ... [2022-03-15 19:06:18,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7704b416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:06:18, skipping insertion in model container [2022-03-15 19:06:18,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:06:17" (2/3) ... [2022-03-15 19:06:18,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7704b416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:06:18, skipping insertion in model container [2022-03-15 19:06:18,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:06:18" (3/3) ... [2022-03-15 19:06:18,320 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2022-03-15 19:06:18,326 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:06:18,326 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:06:18,326 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:06:18,326 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:06:18,360 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,360 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,362 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,363 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,363 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,363 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,363 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,364 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,364 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,364 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,366 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,366 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,366 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,366 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,367 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,367 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,367 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,367 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,367 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,367 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,367 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,369 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,369 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,369 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,369 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,370 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,370 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,374 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,376 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,376 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,377 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,383 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,384 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,384 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,396 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,397 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,400 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,400 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,400 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,400 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,400 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,401 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,401 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,401 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,401 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,401 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,421 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,421 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,421 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,421 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,421 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,421 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,421 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:18,435 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:06:18,483 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:06:18,489 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:06:18,490 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:06:18,502 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:06:18,507 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 242 places, 257 transitions, 538 flow [2022-03-15 19:06:18,509 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 257 transitions, 538 flow [2022-03-15 19:06:18,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 242 places, 257 transitions, 538 flow [2022-03-15 19:06:18,597 INFO L129 PetriNetUnfolder]: 25/254 cut-off events. [2022-03-15 19:06:18,597 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:06:18,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 254 events. 25/254 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 325 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 196. Up to 2 conditions per place. [2022-03-15 19:06:18,607 INFO L116 LiptonReduction]: Number of co-enabled transitions 7560 [2022-03-15 19:06:25,082 INFO L131 LiptonReduction]: Checked pairs total: 8649 [2022-03-15 19:06:25,082 INFO L133 LiptonReduction]: Total number of compositions: 274 [2022-03-15 19:06:25,087 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 100 flow [2022-03-15 19:06:25,124 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 314 states, 313 states have (on average 3.7891373801916934) internal successors, (1186), 313 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 314 states, 313 states have (on average 3.7891373801916934) internal successors, (1186), 313 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:06:25,140 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:25,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:25,141 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2107172912, now seen corresponding path program 1 times [2022-03-15 19:06:25,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:25,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831991140] [2022-03-15 19:06:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:25,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:25,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831991140] [2022-03-15 19:06:25,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831991140] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:25,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:06:25,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:06:25,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557502558] [2022-03-15 19:06:25,397 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:25,401 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:25,430 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 245 transitions. [2022-03-15 19:06:25,430 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:25,927 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:06:25,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:06:25,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:25,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:06:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:06:25,944 INFO L87 Difference]: Start difference. First operand has 314 states, 313 states have (on average 3.7891373801916934) internal successors, (1186), 313 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:26,022 INFO L93 Difference]: Finished difference Result 316 states and 1189 transitions. [2022-03-15 19:06:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:06:26,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:06:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:26,038 INFO L225 Difference]: With dead ends: 316 [2022-03-15 19:06:26,038 INFO L226 Difference]: Without dead ends: 315 [2022-03-15 19:06:26,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:06:26,042 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:26,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-03-15 19:06:26,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-03-15 19:06:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 3.7802547770700636) internal successors, (1187), 314 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1187 transitions. [2022-03-15 19:06:26,100 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1187 transitions. Word has length 21 [2022-03-15 19:06:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:26,100 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 1187 transitions. [2022-03-15 19:06:26,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1187 transitions. [2022-03-15 19:06:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:06:26,103 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:26,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:26,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:06:26,103 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:26,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:26,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1264408274, now seen corresponding path program 1 times [2022-03-15 19:06:26,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:26,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671772225] [2022-03-15 19:06:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:26,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:26,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671772225] [2022-03-15 19:06:26,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671772225] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:26,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968238836] [2022-03-15 19:06:26,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:26,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:26,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:26,191 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-03-15 19:06:26,195 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-03-15 19:06:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:26,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:06:26,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:26,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:26,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968238836] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:26,461 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:06:26,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-03-15 19:06:26,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374582928] [2022-03-15 19:06:26,462 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:26,464 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:26,479 INFO L252 McrAutomatonBuilder]: Finished intersection with 109 states and 246 transitions. [2022-03-15 19:06:26,479 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:26,895 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:06:26,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:06:26,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:26,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:06:26,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:06:26,897 INFO L87 Difference]: Start difference. First operand 315 states and 1187 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:26,968 INFO L93 Difference]: Finished difference Result 367 states and 1381 transitions. [2022-03-15 19:06:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:06:26,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:06:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:26,972 INFO L225 Difference]: With dead ends: 367 [2022-03-15 19:06:26,972 INFO L226 Difference]: Without dead ends: 367 [2022-03-15 19:06:26,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:06:26,973 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:26,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 7 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:06:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-03-15 19:06:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-03-15 19:06:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 3.773224043715847) internal successors, (1381), 366 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1381 transitions. [2022-03-15 19:06:27,000 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1381 transitions. Word has length 22 [2022-03-15 19:06:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:27,002 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 1381 transitions. [2022-03-15 19:06:27,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1381 transitions. [2022-03-15 19:06:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:06:27,006 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:27,006 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:06:27,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 19:06:27,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:27,219 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash 838960753, now seen corresponding path program 1 times [2022-03-15 19:06:27,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:27,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796493257] [2022-03-15 19:06:27,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:27,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:27,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:27,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796493257] [2022-03-15 19:06:27,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796493257] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:27,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744488885] [2022-03-15 19:06:27,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:27,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:27,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:27,321 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-03-15 19:06:27,357 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-03-15 19:06:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:27,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:06:27,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:27,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:27,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744488885] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:27,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:06:27,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-03-15 19:06:27,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604430421] [2022-03-15 19:06:27,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:27,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:27,576 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 352 transitions. [2022-03-15 19:06:27,576 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:28,711 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3218#(or (< 0 ~M~0) (< ~M~0 ~N~0)), 3217#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 3216#(< 0 ~M~0), 3215#(or (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)), 3213#(< |thread2Thread1of1ForFork0_~i~1#1| ~M~0), 3214#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))] [2022-03-15 19:06:28,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:06:28,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:28,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:06:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:06:28,712 INFO L87 Difference]: Start difference. First operand 367 states and 1381 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:28,979 INFO L93 Difference]: Finished difference Result 439 states and 1649 transitions. [2022-03-15 19:06:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:06:28,979 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:06:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:28,982 INFO L225 Difference]: With dead ends: 439 [2022-03-15 19:06:28,982 INFO L226 Difference]: Without dead ends: 439 [2022-03-15 19:06:28,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 148 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:06:28,983 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 127 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:28,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 28 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-03-15 19:06:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2022-03-15 19:06:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.7648401826484017) internal successors, (1649), 438 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1649 transitions. [2022-03-15 19:06:28,992 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1649 transitions. Word has length 24 [2022-03-15 19:06:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:28,993 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 1649 transitions. [2022-03-15 19:06:28,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1649 transitions. [2022-03-15 19:06:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:06:28,994 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:28,994 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:06:29,023 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-03-15 19:06:29,223 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,SelfDestructingSolverStorable2 [2022-03-15 19:06:29,223 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1248849634, now seen corresponding path program 1 times [2022-03-15 19:06:29,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:29,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234970756] [2022-03-15 19:06:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:29,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:29,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234970756] [2022-03-15 19:06:29,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234970756] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:29,336 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:06:29,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:06:29,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [564630479] [2022-03-15 19:06:29,336 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:29,349 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:29,395 INFO L252 McrAutomatonBuilder]: Finished intersection with 222 states and 570 transitions. [2022-03-15 19:06:29,395 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:31,504 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:06:31,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:06:31,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:31,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:06:31,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:06:31,506 INFO L87 Difference]: Start difference. First operand 439 states and 1649 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:31,552 INFO L93 Difference]: Finished difference Result 856 states and 3242 transitions. [2022-03-15 19:06:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:06:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:06:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:31,557 INFO L225 Difference]: With dead ends: 856 [2022-03-15 19:06:31,557 INFO L226 Difference]: Without dead ends: 849 [2022-03-15 19:06:31,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:06:31,559 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:31,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:06:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-03-15 19:06:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 709. [2022-03-15 19:06:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 3.84180790960452) internal successors, (2720), 708 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 2720 transitions. [2022-03-15 19:06:31,579 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 2720 transitions. Word has length 26 [2022-03-15 19:06:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:31,579 INFO L470 AbstractCegarLoop]: Abstraction has 709 states and 2720 transitions. [2022-03-15 19:06:31,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 2720 transitions. [2022-03-15 19:06:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:06:31,582 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:31,582 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:06:31,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:06:31,582 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:31,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:31,583 INFO L85 PathProgramCache]: Analyzing trace with hash 445875125, now seen corresponding path program 1 times [2022-03-15 19:06:31,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:31,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666952057] [2022-03-15 19:06:31,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:31,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:31,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:31,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666952057] [2022-03-15 19:06:31,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666952057] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:31,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:06:31,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:06:31,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [672875101] [2022-03-15 19:06:31,705 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:31,716 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:31,775 INFO L252 McrAutomatonBuilder]: Finished intersection with 260 states and 679 transitions. [2022-03-15 19:06:31,776 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:33,529 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [6831#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 6830#(< |thread3Thread1of1ForFork1_~j~2#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 6832#(or (<= ~size~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))))] [2022-03-15 19:06:33,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:06:33,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:33,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:06:33,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:06:33,530 INFO L87 Difference]: Start difference. First operand 709 states and 2720 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:33,675 INFO L93 Difference]: Finished difference Result 1403 states and 5272 transitions. [2022-03-15 19:06:33,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:06:33,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:06:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:33,683 INFO L225 Difference]: With dead ends: 1403 [2022-03-15 19:06:33,683 INFO L226 Difference]: Without dead ends: 1383 [2022-03-15 19:06:33,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:06:33,684 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 76 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:33,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 19 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-03-15 19:06:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1261. [2022-03-15 19:06:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1260 states have (on average 3.865873015873016) internal successors, (4871), 1260 states have internal predecessors, (4871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 4871 transitions. [2022-03-15 19:06:33,712 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 4871 transitions. Word has length 27 [2022-03-15 19:06:33,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:33,713 INFO L470 AbstractCegarLoop]: Abstraction has 1261 states and 4871 transitions. [2022-03-15 19:06:33,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 4871 transitions. [2022-03-15 19:06:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:06:33,716 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:33,716 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:06:33,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:06:33,716 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:33,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1643489722, now seen corresponding path program 1 times [2022-03-15 19:06:33,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:33,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591452625] [2022-03-15 19:06:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:33,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:33,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:33,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591452625] [2022-03-15 19:06:33,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591452625] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:33,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041094503] [2022-03-15 19:06:33,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:33,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:33,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:33,812 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-03-15 19:06:33,813 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-03-15 19:06:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:33,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:06:33,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:33,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:34,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:06:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:34,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041094503] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:34,053 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:34,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 19:06:34,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2059040405] [2022-03-15 19:06:34,054 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:34,057 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:34,141 INFO L252 McrAutomatonBuilder]: Finished intersection with 261 states and 680 transitions. [2022-03-15 19:06:34,142 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:36,234 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [10936#(< |thread3Thread1of1ForFork1_~j~2#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 10937#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 10938#(or (<= ~size~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))))] [2022-03-15 19:06:36,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:06:36,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:06:36,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:06:36,235 INFO L87 Difference]: Start difference. First operand 1261 states and 4871 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:36,442 INFO L93 Difference]: Finished difference Result 2067 states and 7735 transitions. [2022-03-15 19:06:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:06:36,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:06:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:36,453 INFO L225 Difference]: With dead ends: 2067 [2022-03-15 19:06:36,453 INFO L226 Difference]: Without dead ends: 2047 [2022-03-15 19:06:36,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 231 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:06:36,454 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 174 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:36,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 24 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2022-03-15 19:06:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1262. [2022-03-15 19:06:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 3.864393338620143) internal successors, (4873), 1261 states have internal predecessors, (4873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 4873 transitions. [2022-03-15 19:06:36,501 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 4873 transitions. Word has length 28 [2022-03-15 19:06:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:36,501 INFO L470 AbstractCegarLoop]: Abstraction has 1262 states and 4873 transitions. [2022-03-15 19:06:36,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 4873 transitions. [2022-03-15 19:06:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:06:36,507 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:36,507 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:06:36,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:36,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:36,723 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:36,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1988267248, now seen corresponding path program 1 times [2022-03-15 19:06:36,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:36,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449769034] [2022-03-15 19:06:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:36,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:36,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:36,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449769034] [2022-03-15 19:06:36,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449769034] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:36,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:06:36,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:06:36,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1559887535] [2022-03-15 19:06:36,782 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:36,785 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:36,849 INFO L252 McrAutomatonBuilder]: Finished intersection with 288 states and 764 transitions. [2022-03-15 19:06:36,849 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:39,592 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [15547#(or (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (<= ~size~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 15546#(or (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (<= ~size~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 15544#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 15543#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 15545#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))] [2022-03-15 19:06:39,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:06:39,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:39,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:06:39,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:06:39,593 INFO L87 Difference]: Start difference. First operand 1262 states and 4873 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:39,861 INFO L93 Difference]: Finished difference Result 2198 states and 8343 transitions. [2022-03-15 19:06:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:06:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:06:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:39,873 INFO L225 Difference]: With dead ends: 2198 [2022-03-15 19:06:39,873 INFO L226 Difference]: Without dead ends: 2165 [2022-03-15 19:06:39,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:06:39,874 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 113 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:39,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 39 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2022-03-15 19:06:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1807. [2022-03-15 19:06:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1806 states have (on average 3.89922480620155) internal successors, (7042), 1806 states have internal predecessors, (7042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 7042 transitions. [2022-03-15 19:06:39,925 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 7042 transitions. Word has length 28 [2022-03-15 19:06:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:39,926 INFO L470 AbstractCegarLoop]: Abstraction has 1807 states and 7042 transitions. [2022-03-15 19:06:39,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 7042 transitions. [2022-03-15 19:06:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:06:39,931 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:39,931 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:06:39,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 19:06:39,931 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:39,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1511303506, now seen corresponding path program 2 times [2022-03-15 19:06:39,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:39,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672031544] [2022-03-15 19:06:39,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:39,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:40,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:40,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672031544] [2022-03-15 19:06:40,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672031544] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:40,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:06:40,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 19:06:40,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [221615769] [2022-03-15 19:06:40,085 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:40,089 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:40,141 INFO L252 McrAutomatonBuilder]: Finished intersection with 226 states and 574 transitions. [2022-03-15 19:06:40,141 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:41,620 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [21373#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 21374#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 21375#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))] [2022-03-15 19:06:41,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:06:41,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:41,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:06:41,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:06:41,620 INFO L87 Difference]: Start difference. First operand 1807 states and 7042 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:41,831 INFO L93 Difference]: Finished difference Result 2209 states and 8357 transitions. [2022-03-15 19:06:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:06:41,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:06:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:41,867 INFO L225 Difference]: With dead ends: 2209 [2022-03-15 19:06:41,868 INFO L226 Difference]: Without dead ends: 2195 [2022-03-15 19:06:41,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:06:41,868 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 86 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:41,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 38 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2022-03-15 19:06:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1804. [2022-03-15 19:06:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 3.9007210205213534) internal successors, (7033), 1803 states have internal predecessors, (7033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 7033 transitions. [2022-03-15 19:06:41,910 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 7033 transitions. Word has length 28 [2022-03-15 19:06:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:41,910 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 7033 transitions. [2022-03-15 19:06:41,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 7033 transitions. [2022-03-15 19:06:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:06:41,914 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:41,914 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:06:41,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 19:06:41,914 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:41,915 INFO L85 PathProgramCache]: Analyzing trace with hash -467585150, now seen corresponding path program 3 times [2022-03-15 19:06:41,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:41,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274808955] [2022-03-15 19:06:41,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:42,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:42,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274808955] [2022-03-15 19:06:42,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274808955] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:42,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:06:42,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 19:06:42,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2014487292] [2022-03-15 19:06:42,017 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:42,020 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:42,046 INFO L252 McrAutomatonBuilder]: Finished intersection with 136 states and 300 transitions. [2022-03-15 19:06:42,046 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:42,601 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [27207#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 27208#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 27209#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))] [2022-03-15 19:06:42,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:06:42,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:42,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:06:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:06:42,602 INFO L87 Difference]: Start difference. First operand 1804 states and 7033 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:42,851 INFO L93 Difference]: Finished difference Result 2170 states and 8234 transitions. [2022-03-15 19:06:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:06:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:06:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:42,877 INFO L225 Difference]: With dead ends: 2170 [2022-03-15 19:06:42,877 INFO L226 Difference]: Without dead ends: 2170 [2022-03-15 19:06:42,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:06:42,878 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 111 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:42,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 42 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2022-03-15 19:06:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1792. [2022-03-15 19:06:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1791 states have (on average 3.9011725293132327) internal successors, (6987), 1791 states have internal predecessors, (6987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 6987 transitions. [2022-03-15 19:06:42,917 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 6987 transitions. Word has length 28 [2022-03-15 19:06:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:42,917 INFO L470 AbstractCegarLoop]: Abstraction has 1792 states and 6987 transitions. [2022-03-15 19:06:42,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 6987 transitions. [2022-03-15 19:06:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:06:42,921 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:42,922 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:06:42,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 19:06:42,922 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:42,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1539914750, now seen corresponding path program 4 times [2022-03-15 19:06:42,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:42,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163097372] [2022-03-15 19:06:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:43,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:43,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163097372] [2022-03-15 19:06:43,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163097372] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:43,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:06:43,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 19:06:43,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1492699363] [2022-03-15 19:06:43,040 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:43,043 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:43,092 INFO L252 McrAutomatonBuilder]: Finished intersection with 219 states and 560 transitions. [2022-03-15 19:06:43,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:44,529 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [32979#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 32981#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 32980#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))] [2022-03-15 19:06:44,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:06:44,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:06:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:06:44,530 INFO L87 Difference]: Start difference. First operand 1792 states and 6987 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:44,748 INFO L93 Difference]: Finished difference Result 1984 states and 7464 transitions. [2022-03-15 19:06:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:06:44,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:06:44,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:44,758 INFO L225 Difference]: With dead ends: 1984 [2022-03-15 19:06:44,759 INFO L226 Difference]: Without dead ends: 1972 [2022-03-15 19:06:44,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:06:44,759 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 113 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:44,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 31 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:44,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2022-03-15 19:06:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2022-03-15 19:06:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1606 states have (on average 3.8729763387297633) internal successors, (6220), 1606 states have internal predecessors, (6220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 6220 transitions. [2022-03-15 19:06:44,811 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 6220 transitions. Word has length 28 [2022-03-15 19:06:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:44,812 INFO L470 AbstractCegarLoop]: Abstraction has 1607 states and 6220 transitions. [2022-03-15 19:06:44,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 6220 transitions. [2022-03-15 19:06:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:06:44,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:44,816 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:44,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 19:06:44,817 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1989290539, now seen corresponding path program 2 times [2022-03-15 19:06:44,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:44,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135057054] [2022-03-15 19:06:44,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:44,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:45,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:45,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135057054] [2022-03-15 19:06:45,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135057054] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:45,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545928739] [2022-03-15 19:06:45,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:06:45,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:45,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:45,080 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-03-15 19:06:45,081 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-03-15 19:06:45,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:06:45,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:45,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:06:45,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:45,522 INFO L353 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-03-15 19:06:45,522 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 13 [2022-03-15 19:06:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:45,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:45,672 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:06:45,673 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 24 [2022-03-15 19:06:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:45,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545928739] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:45,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:45,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 33 [2022-03-15 19:06:45,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1468860609] [2022-03-15 19:06:45,866 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:45,869 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:45,933 INFO L252 McrAutomatonBuilder]: Finished intersection with 262 states and 681 transitions. [2022-03-15 19:06:45,933 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:56,737 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [38409#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= ~N~0 0) (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 1 ~N~0)), 38396#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 38407#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 38401#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 38393#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 38402#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= (select (select |#memory_int| ~A~0.base) 0) 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 38412#(or (= ~A~0.offset 0) (<= ~N~0 0) (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 1 ~N~0)), 38405#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= ~N~0 1))), 38400#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 38390#(or (<= ~N~0 0) (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 1 ~N~0)), 38395#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 38392#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0))), 38398#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 38399#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)))), 38404#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (<= (+ ~M~0 1) 0))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= ~N~0 1))), 38389#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 38386#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0), 38388#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))), 38403#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= ~N~0 1)) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 38411#(and (or (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 0) (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 1 ~N~0)) (or (= ~A~0.offset 0) (< 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0)) (not (< 0 ~N~0))) (or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (< 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0)) (not (< 0 ~N~0)))), 38391#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0))), 38410#(and (or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0)) (not (< 0 ~N~0))) (or (= ~A~0.offset 0) (< 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0)) (not (< 0 ~N~0)))), 38394#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 38406#(and (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0)) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= ~N~0 1)) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 38387#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 38408#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))), 38397#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))))] [2022-03-15 19:06:56,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:06:56,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:56,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:06:56,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=3246, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:06:56,739 INFO L87 Difference]: Start difference. First operand 1607 states and 6220 transitions. Second operand has 39 states, 39 states have (on average 5.153846153846154) internal successors, (201), 38 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:13,511 INFO L93 Difference]: Finished difference Result 10592 states and 41570 transitions. [2022-03-15 19:07:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2022-03-15 19:07:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.153846153846154) internal successors, (201), 38 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:07:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:13,563 INFO L225 Difference]: With dead ends: 10592 [2022-03-15 19:07:13,564 INFO L226 Difference]: Without dead ends: 10592 [2022-03-15 19:07:13,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 200 SyntacticMatches, 40 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24120 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=8326, Invalid=56954, Unknown=0, NotChecked=0, Total=65280 [2022-03-15 19:07:13,575 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 1348 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 7946 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 8326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 7946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:13,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1348 Valid, 702 Invalid, 8326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 7946 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 19:07:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10592 states. [2022-03-15 19:07:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10592 to 2571. [2022-03-15 19:07:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2570 states have (on average 4.065758754863813) internal successors, (10449), 2570 states have internal predecessors, (10449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 10449 transitions. [2022-03-15 19:07:13,751 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 10449 transitions. Word has length 29 [2022-03-15 19:07:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:13,751 INFO L470 AbstractCegarLoop]: Abstraction has 2571 states and 10449 transitions. [2022-03-15 19:07:13,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.153846153846154) internal successors, (201), 38 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 10449 transitions. [2022-03-15 19:07:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:07:13,763 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:13,763 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:13,786 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-03-15 19:07:13,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:13,985 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:13,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1386798517, now seen corresponding path program 3 times [2022-03-15 19:07:13,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:13,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084533086] [2022-03-15 19:07:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:07:14,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:14,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084533086] [2022-03-15 19:07:14,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084533086] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:14,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092272482] [2022-03-15 19:07:14,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:07:14,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:14,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:14,301 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-03-15 19:07:14,302 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-03-15 19:07:14,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:07:14,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:14,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:07:14,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:14,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:14,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:07:14,701 INFO L353 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-03-15 19:07:14,701 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 13 [2022-03-15 19:07:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:07:14,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:14,893 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_427 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_427) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0))) is different from false [2022-03-15 19:07:14,913 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:07:14,913 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 42 treesize of output 42 [2022-03-15 19:07:14,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-03-15 19:07:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:07:15,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092272482] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:15,129 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:15,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 32 [2022-03-15 19:07:15,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2053071486] [2022-03-15 19:07:15,129 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:15,163 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:15,195 INFO L252 McrAutomatonBuilder]: Finished intersection with 157 states and 354 transitions. [2022-03-15 19:07:15,195 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:19,378 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [54738#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0), 54746#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 1))), 54745#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0))), 54744#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0))), 54740#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 54741#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 54743#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 54747#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0))), 54742#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))), 54739#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|)))] [2022-03-15 19:07:19,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:07:19,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:19,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:07:19,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1499, Unknown=1, NotChecked=80, Total=1806 [2022-03-15 19:07:19,380 INFO L87 Difference]: Start difference. First operand 2571 states and 10449 transitions. Second operand has 23 states, 23 states have (on average 5.130434782608695) internal successors, (118), 22 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:21,781 INFO L93 Difference]: Finished difference Result 7082 states and 28446 transitions. [2022-03-15 19:07:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:07:21,782 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.130434782608695) internal successors, (118), 22 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:07:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:21,807 INFO L225 Difference]: With dead ends: 7082 [2022-03-15 19:07:21,807 INFO L226 Difference]: Without dead ends: 7082 [2022-03-15 19:07:21,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 130 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=777, Invalid=4776, Unknown=1, NotChecked=146, Total=5700 [2022-03-15 19:07:21,809 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 276 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 2749 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:21,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 227 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2749 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:07:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7082 states. [2022-03-15 19:07:21,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7082 to 2684. [2022-03-15 19:07:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2684 states, 2683 states have (on average 4.096906448005964) internal successors, (10992), 2683 states have internal predecessors, (10992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 10992 transitions. [2022-03-15 19:07:21,932 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 10992 transitions. Word has length 29 [2022-03-15 19:07:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:21,932 INFO L470 AbstractCegarLoop]: Abstraction has 2684 states and 10992 transitions. [2022-03-15 19:07:21,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.130434782608695) internal successors, (118), 22 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 10992 transitions. [2022-03-15 19:07:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:07:21,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:21,939 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:21,960 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-03-15 19:07:22,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 19:07:22,161 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1053986171, now seen corresponding path program 4 times [2022-03-15 19:07:22,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:22,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921447395] [2022-03-15 19:07:22,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:22,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:07:22,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:22,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921447395] [2022-03-15 19:07:22,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921447395] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:22,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977882614] [2022-03-15 19:07:22,496 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:07:22,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:22,500 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-03-15 19:07:22,500 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-03-15 19:07:22,597 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:07:22,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:22,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:07:22,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:22,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:22,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:07:22,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:22,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:07:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:07:23,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:23,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_485) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 0)) is different from false [2022-03-15 19:07:23,163 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:07:23,163 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 158 treesize of output 150 [2022-03-15 19:07:23,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 106 [2022-03-15 19:07:23,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2022-03-15 19:07:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:07:23,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977882614] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:23,433 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:23,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 19:07:23,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [314681570] [2022-03-15 19:07:23,433 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:23,437 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:23,491 INFO L252 McrAutomatonBuilder]: Finished intersection with 148 states and 336 transitions. [2022-03-15 19:07:23,491 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:27,981 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [67468#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 67469#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 67474#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))), 67475#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 67467#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0), 67470#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 67473#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 67476#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (not (= (select (select |#memory_int| ~A~0.base) 0) 1))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 67471#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 67472#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)))] [2022-03-15 19:07:27,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:07:27,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:27,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:07:27,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1708, Unknown=4, NotChecked=84, Total=1980 [2022-03-15 19:07:27,982 INFO L87 Difference]: Start difference. First operand 2684 states and 10992 transitions. Second operand has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:30,445 INFO L93 Difference]: Finished difference Result 6197 states and 24660 transitions. [2022-03-15 19:07:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 19:07:30,446 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:07:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:30,471 INFO L225 Difference]: With dead ends: 6197 [2022-03-15 19:07:30,471 INFO L226 Difference]: Without dead ends: 6197 [2022-03-15 19:07:30,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 103 SyntacticMatches, 37 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=709, Invalid=4841, Unknown=4, NotChecked=146, Total=5700 [2022-03-15 19:07:30,472 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 331 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:30,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 226 Invalid, 2725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:07:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2022-03-15 19:07:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 3072. [2022-03-15 19:07:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3071 states have (on average 4.085314229892544) internal successors, (12546), 3071 states have internal predecessors, (12546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 12546 transitions. [2022-03-15 19:07:30,567 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 12546 transitions. Word has length 29 [2022-03-15 19:07:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:30,567 INFO L470 AbstractCegarLoop]: Abstraction has 3072 states and 12546 transitions. [2022-03-15 19:07:30,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 12546 transitions. [2022-03-15 19:07:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:07:30,574 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:30,574 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:07:30,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:30,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:30,791 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1642466431, now seen corresponding path program 1 times [2022-03-15 19:07:30,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:30,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072459546] [2022-03-15 19:07:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:30,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:30,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:30,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072459546] [2022-03-15 19:07:30,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072459546] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:30,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112572397] [2022-03-15 19:07:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:30,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:30,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:30,871 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:30,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:07:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:30,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:07:30,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:31,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:31,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:07:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:31,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112572397] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:31,102 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:31,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-03-15 19:07:31,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873452675] [2022-03-15 19:07:31,102 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:31,106 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:31,173 INFO L252 McrAutomatonBuilder]: Finished intersection with 289 states and 765 transitions. [2022-03-15 19:07:31,173 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:33,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [80062#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 80064#(or (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (<= ~size~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 80066#(or (<= ~size~0 1) (<= ~size~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 80061#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 80065#(or (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (<= ~size~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 80063#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))] [2022-03-15 19:07:33,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:07:33,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:33,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:07:33,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:07:33,962 INFO L87 Difference]: Start difference. First operand 3072 states and 12546 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:34,291 INFO L93 Difference]: Finished difference Result 3776 states and 14926 transitions. [2022-03-15 19:07:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:07:34,293 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:07:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:34,305 INFO L225 Difference]: With dead ends: 3776 [2022-03-15 19:07:34,305 INFO L226 Difference]: Without dead ends: 3743 [2022-03-15 19:07:34,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 299 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:07:34,306 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 209 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:34,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 46 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:07:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2022-03-15 19:07:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 2913. [2022-03-15 19:07:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2913 states, 2912 states have (on average 4.055631868131868) internal successors, (11810), 2912 states have internal predecessors, (11810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 11810 transitions. [2022-03-15 19:07:34,401 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 11810 transitions. Word has length 29 [2022-03-15 19:07:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:34,401 INFO L470 AbstractCegarLoop]: Abstraction has 2913 states and 11810 transitions. [2022-03-15 19:07:34,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 11810 transitions. [2022-03-15 19:07:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:07:34,409 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:34,409 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:07:34,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:34,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:34,627 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:34,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:34,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1857104323, now seen corresponding path program 2 times [2022-03-15 19:07:34,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:34,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446743461] [2022-03-15 19:07:34,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:34,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:34,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:34,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446743461] [2022-03-15 19:07:34,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446743461] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:34,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179777894] [2022-03-15 19:07:34,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:07:34,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:34,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:34,730 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:34,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:07:34,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:07:34,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:34,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:07:34,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:34,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:34,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:07:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:34,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:34,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_590 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) |c_thread1Thread1of1ForFork2_~j~0#1|)) is different from false [2022-03-15 19:07:34,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-03-15 19:07:34,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-03-15 19:07:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:35,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179777894] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:35,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:35,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-03-15 19:07:35,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745910791] [2022-03-15 19:07:35,054 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:35,058 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:35,106 INFO L252 McrAutomatonBuilder]: Finished intersection with 227 states and 575 transitions. [2022-03-15 19:07:35,106 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:36,549 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [89866#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 89864#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 89865#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))] [2022-03-15 19:07:36,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:07:36,550 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:36,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:07:36,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2022-03-15 19:07:36,550 INFO L87 Difference]: Start difference. First operand 2913 states and 11810 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:36,804 INFO L93 Difference]: Finished difference Result 3787 states and 14940 transitions. [2022-03-15 19:07:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:07:36,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:07:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:36,813 INFO L225 Difference]: With dead ends: 3787 [2022-03-15 19:07:36,813 INFO L226 Difference]: Without dead ends: 3773 [2022-03-15 19:07:36,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=445, Unknown=1, NotChecked=44, Total=600 [2022-03-15 19:07:36,814 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 159 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:36,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 39 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:07:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3773 states. [2022-03-15 19:07:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3773 to 2878. [2022-03-15 19:07:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2877 states have (on average 4.064303093500174) internal successors, (11693), 2877 states have internal predecessors, (11693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 11693 transitions. [2022-03-15 19:07:36,884 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 11693 transitions. Word has length 29 [2022-03-15 19:07:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:36,884 INFO L470 AbstractCegarLoop]: Abstraction has 2878 states and 11693 transitions. [2022-03-15 19:07:36,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 11693 transitions. [2022-03-15 19:07:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:07:36,890 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:36,890 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:07:36,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:37,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:07:37,095 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash -813385967, now seen corresponding path program 3 times [2022-03-15 19:07:37,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:37,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520810721] [2022-03-15 19:07:37,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:37,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:37,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:37,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520810721] [2022-03-15 19:07:37,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520810721] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:37,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35150082] [2022-03-15 19:07:37,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:07:37,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:37,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:37,216 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:37,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:07:37,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:07:37,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:37,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:37,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:37,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:37,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:07:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:37,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:37,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_643) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) |c_thread1Thread1of1ForFork2_~j~0#1|)) is different from false [2022-03-15 19:07:37,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-03-15 19:07:37,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-03-15 19:07:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:37,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35150082] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:37,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:37,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-03-15 19:07:37,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [421710780] [2022-03-15 19:07:37,581 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:37,584 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:37,611 INFO L252 McrAutomatonBuilder]: Finished intersection with 137 states and 301 transitions. [2022-03-15 19:07:37,611 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:38,182 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [99609#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 99608#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 99610#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))] [2022-03-15 19:07:38,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:07:38,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:07:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=388, Unknown=1, NotChecked=40, Total=506 [2022-03-15 19:07:38,183 INFO L87 Difference]: Start difference. First operand 2878 states and 11693 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:38,524 INFO L93 Difference]: Finished difference Result 3740 states and 14792 transitions. [2022-03-15 19:07:38,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:07:38,524 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:07:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:38,534 INFO L225 Difference]: With dead ends: 3740 [2022-03-15 19:07:38,534 INFO L226 Difference]: Without dead ends: 3740 [2022-03-15 19:07:38,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=574, Unknown=1, NotChecked=50, Total=756 [2022-03-15 19:07:38,534 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 218 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:38,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 54 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:07:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2022-03-15 19:07:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 2864. [2022-03-15 19:07:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2863 states have (on average 4.067062521830248) internal successors, (11644), 2863 states have internal predecessors, (11644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 11644 transitions. [2022-03-15 19:07:38,590 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 11644 transitions. Word has length 29 [2022-03-15 19:07:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:38,590 INFO L470 AbstractCegarLoop]: Abstraction has 2864 states and 11644 transitions. [2022-03-15 19:07:38,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 11644 transitions. [2022-03-15 19:07:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:07:38,597 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:38,597 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:07:38,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:38,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:07:38,815 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1885715567, now seen corresponding path program 4 times [2022-03-15 19:07:38,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:38,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580357711] [2022-03-15 19:07:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:38,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:38,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580357711] [2022-03-15 19:07:38,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580357711] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:38,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55592855] [2022-03-15 19:07:38,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:07:38,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:38,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:38,964 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:38,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:07:39,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:07:39,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:39,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:07:39,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:39,229 INFO L353 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-03-15 19:07:39,229 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 13 [2022-03-15 19:07:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:39,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:39,367 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:07:39,368 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 23 treesize of output 23 [2022-03-15 19:07:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:07:39,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55592855] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:39,590 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:39,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-03-15 19:07:39,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1596612436] [2022-03-15 19:07:39,590 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:39,594 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:39,642 INFO L252 McrAutomatonBuilder]: Finished intersection with 220 states and 561 transitions. [2022-03-15 19:07:39,643 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:41,087 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [109284#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 109283#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 109285#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))] [2022-03-15 19:07:41,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:07:41,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:41,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:07:41,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:07:41,088 INFO L87 Difference]: Start difference. First operand 2864 states and 11644 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:41,421 INFO L93 Difference]: Finished difference Result 3477 states and 13734 transitions. [2022-03-15 19:07:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:07:41,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:07:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:41,432 INFO L225 Difference]: With dead ends: 3477 [2022-03-15 19:07:41,432 INFO L226 Difference]: Without dead ends: 3465 [2022-03-15 19:07:41,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:07:41,435 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 156 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:41,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 49 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:07:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2022-03-15 19:07:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2657. [2022-03-15 19:07:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2656 states have (on average 4.072665662650603) internal successors, (10817), 2656 states have internal predecessors, (10817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 10817 transitions. [2022-03-15 19:07:41,497 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 10817 transitions. Word has length 29 [2022-03-15 19:07:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:41,497 INFO L470 AbstractCegarLoop]: Abstraction has 2657 states and 10817 transitions. [2022-03-15 19:07:41,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 10817 transitions. [2022-03-15 19:07:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:07:41,503 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:41,503 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:41,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:41,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 19:07:41,719 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:41,720 INFO L85 PathProgramCache]: Analyzing trace with hash -487424304, now seen corresponding path program 5 times [2022-03-15 19:07:41,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:41,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064688664] [2022-03-15 19:07:41,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:41,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:07:42,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:42,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064688664] [2022-03-15 19:07:42,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064688664] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:42,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425417782] [2022-03-15 19:07:42,206 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:07:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:42,207 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:42,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:07:42,307 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:07:42,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:42,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:07:42,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:42,522 INFO L353 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-03-15 19:07:42,522 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 13 [2022-03-15 19:07:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:07:42,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:42,688 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:07:42,688 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 23 treesize of output 23 [2022-03-15 19:07:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:07:42,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425417782] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:42,841 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:42,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 10] total 33 [2022-03-15 19:07:42,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [479163396] [2022-03-15 19:07:42,841 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:42,845 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:42,932 INFO L252 McrAutomatonBuilder]: Finished intersection with 290 states and 766 transitions. [2022-03-15 19:07:42,932 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:05,281 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 121 new interpolants: [118361#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118306#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 118299#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0))), 118334#(and (or (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 118307#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 118319#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 118301#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 118337#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0))), 118305#(< |thread2Thread1of1ForFork0_~i~1#1| ~M~0), 118351#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~j~0#1| 0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0))), 118310#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)), 118339#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 118340#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 118391#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (<= 1 ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= ~M~0 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 118298#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118321#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)), 118368#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 118367#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118323#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0))), 118408#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< 0 ~M~0) (= |thread1Thread1of1ForFork2_~j~0#1| 0)) (or (< 0 ~M~0) (<= 1 ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0))), 118393#(and (or (<= 1 ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0)) (= ~A~0.offset 0) (or (<= 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (<= ~M~0 0))), 118403#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< 0 ~M~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< 0 ~M~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 118373#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 118304#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 118405#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 118389#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< 0 ~M~0))), 118316#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118379#(and (or (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 0 ~M~0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 118404#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< 0 ~M~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< 0 ~M~0) (= |thread1Thread1of1ForFork2_~j~0#1| 0))), 118385#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 118402#(and (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 118302#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0))), 118350#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0))), 118346#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= ~M~0 0)) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 118376#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (<= 1 ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 118370#(or (< 0 ~M~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 118383#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 118374#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 118356#(and (or (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 118400#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= 1 ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0))), 118329#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (<= 1 ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 118303#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 118352#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 118333#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= ~N~0 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (< 1 ~N~0)), 118355#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= 1 ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 118224#(or (not (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 118342#(or (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))), 118357#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 118341#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= ~M~0 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 118372#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0))), 118394#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= ~M~0 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 118365#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 118330#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (<= 1 ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 118363#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)), 118317#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118345#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0))), 118382#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0))), 118348#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= ~M~0 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 118377#(or (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 0 ~M~0) (<= ~N~0 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (< 1 ~N~0)), 118390#(and (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= ~M~0 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 118313#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118398#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (<= ~M~0 0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 118384#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 118293#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0), 118297#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118388#(or (< 0 ~M~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 118364#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 118336#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 118358#(< 0 ~M~0), 118360#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))), 118396#(and (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= ~M~0 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (<= 1 ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 118332#(or (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= ~N~0 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (< 1 ~N~0)), 118294#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))), 118343#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 118381#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 0 ~M~0)) (or (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0))), 118392#(and (or (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (<= ~M~0 0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 118349#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= ~M~0 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 118344#(and (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0))), 118314#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)), 118378#(or (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0) (<= ~N~0 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (< 1 ~N~0)), 118315#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 118371#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 0 ~M~0)) (or (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0))), 118366#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118325#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 118309#(or (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (< 1 ~N~0)), 118387#(and (or (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 0 ~M~0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 118347#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= ~M~0 0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 118410#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0))), 118320#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)), 118399#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (<= ~M~0 0))), 118308#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)), 118295#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118362#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 118327#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 118406#(and (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (<= 1 ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 118328#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 118354#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 118338#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0))), 118220#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 118353#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= 1 ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 118409#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0))), 118311#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))), 118331#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (< 1 ~N~0)), 118359#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0)), 118300#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 118411#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0)) (= ~A~0.offset 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0))), 118296#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 118407#(or (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 0 ~M~0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))), 118369#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)), 118380#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 118397#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~M~0 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0))), 118335#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 118322#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~j~2#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)), 118375#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 118386#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= 1 ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 118326#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 118312#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118401#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 118318#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 118324#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0))), 118395#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~M~0 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~j~0#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0)))] [2022-03-15 19:08:05,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 140 states [2022-03-15 19:08:05,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:05,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2022-03-15 19:08:05,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=22028, Unknown=0, NotChecked=0, Total=23256 [2022-03-15 19:08:05,283 INFO L87 Difference]: Start difference. First operand 2657 states and 10817 transitions. Second operand has 140 states, 140 states have (on average 3.392857142857143) internal successors, (475), 139 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:09,214 INFO L93 Difference]: Finished difference Result 12541 states and 50428 transitions. [2022-03-15 19:12:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1192 states. [2022-03-15 19:12:09,215 INFO L78 Accepts]: Start accepts. Automaton has has 140 states, 140 states have (on average 3.392857142857143) internal successors, (475), 139 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:12:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:09,260 INFO L225 Difference]: With dead ends: 12541 [2022-03-15 19:12:09,260 INFO L226 Difference]: Without dead ends: 12541 [2022-03-15 19:12:09,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1516 GetRequests, 169 SyntacticMatches, 14 SemanticMatches, 1333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728739 ImplicationChecksByTransitivity, 205.2s TimeCoverageRelationStatistics Valid=165991, Invalid=1614899, Unknown=0, NotChecked=0, Total=1780890 [2022-03-15 19:12:09,505 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 3924 mSDsluCounter, 7313 mSDsCounter, 0 mSdLazyCounter, 59874 mSolverCounterSat, 1797 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3924 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 61671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1797 IncrementalHoareTripleChecker+Valid, 59874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:09,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3924 Valid, 1973 Invalid, 61671 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1797 Valid, 59874 Invalid, 0 Unknown, 0 Unchecked, 32.4s Time] [2022-03-15 19:12:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12541 states. [2022-03-15 19:12:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12541 to 3809. [2022-03-15 19:12:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3809 states, 3808 states have (on average 4.086134453781512) internal successors, (15560), 3808 states have internal predecessors, (15560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 15560 transitions. [2022-03-15 19:12:09,682 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 15560 transitions. Word has length 30 [2022-03-15 19:12:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:09,682 INFO L470 AbstractCegarLoop]: Abstraction has 3809 states and 15560 transitions. [2022-03-15 19:12:09,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 140 states, 140 states have (on average 3.392857142857143) internal successors, (475), 139 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 15560 transitions. [2022-03-15 19:12:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:12:09,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:09,691 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:09,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:09,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:12:09,907 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:12:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1299924932, now seen corresponding path program 5 times [2022-03-15 19:12:09,909 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:09,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4104449] [2022-03-15 19:12:09,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:12:09,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:09,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4104449] [2022-03-15 19:12:09,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4104449] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:09,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649821033] [2022-03-15 19:12:09,984 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:12:09,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:09,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:10,000 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:10,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:12:10,119 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:12:10,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:10,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:12:10,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:12:10,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:10,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:12:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:12:10,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649821033] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:10,305 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:10,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-03-15 19:12:10,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1528248451] [2022-03-15 19:12:10,305 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:10,309 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:10,348 INFO L252 McrAutomatonBuilder]: Finished intersection with 168 states and 388 transitions. [2022-03-15 19:12:10,348 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:11,811 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [141126#(< |thread3Thread1of1ForFork1_~j~2#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 141129#(or (<= ~size~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 141128#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 141127#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))))] [2022-03-15 19:12:11,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:12:11,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:12:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:12:11,812 INFO L87 Difference]: Start difference. First operand 3809 states and 15560 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:12,172 INFO L93 Difference]: Finished difference Result 7800 states and 31497 transitions. [2022-03-15 19:12:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:12:12,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:12:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:12,194 INFO L225 Difference]: With dead ends: 7800 [2022-03-15 19:12:12,194 INFO L226 Difference]: Without dead ends: 7800 [2022-03-15 19:12:12,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 173 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:12:12,195 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 294 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:12,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 44 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:12:12,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7800 states. [2022-03-15 19:12:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7800 to 6560. [2022-03-15 19:12:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6560 states, 6559 states have (on average 4.146516237231285) internal successors, (27197), 6559 states have internal predecessors, (27197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 27197 transitions. [2022-03-15 19:12:12,511 INFO L78 Accepts]: Start accepts. Automaton has 6560 states and 27197 transitions. Word has length 30 [2022-03-15 19:12:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:12,511 INFO L470 AbstractCegarLoop]: Abstraction has 6560 states and 27197 transitions. [2022-03-15 19:12:12,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6560 states and 27197 transitions. [2022-03-15 19:12:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:12:12,527 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:12,527 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:12:12,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:12,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:12,744 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:12:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1044513917, now seen corresponding path program 1 times [2022-03-15 19:12:12,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:12,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93151887] [2022-03-15 19:12:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:12:12,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:12,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93151887] [2022-03-15 19:12:12,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93151887] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:12,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068575933] [2022-03-15 19:12:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:12,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:12,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:12,818 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:12,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:12:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:12,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:12:12,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:12:13,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:12:13,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068575933] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:13,097 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:13,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-03-15 19:12:13,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [133677779] [2022-03-15 19:12:13,097 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:13,107 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:13,245 INFO L252 McrAutomatonBuilder]: Finished intersection with 480 states and 1353 transitions. [2022-03-15 19:12:13,245 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:20,648 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [162272#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 ~M~0)), 162258#(or (<= ~M~0 0) (< 1 ~M~0)), 162259#(< |thread3Thread1of1ForFork1_~i~2#1| ~N~0), 162256#(< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0), 162262#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 162267#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|)), 162269#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 162282#(or (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0) (< 1 ~M~0)), 162279#(or (<= ~M~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ ~M~0 1) ~N~0) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= ~N~0 ~M~0)), 162270#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0)), 162263#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 162280#(or (<= ~M~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= ~N~0 ~M~0)), 162286#(or (<= ~N~0 ~M~0) (<= ~M~0 0) (< 1 ~M~0)), 162275#(or (<= ~M~0 |thread2Thread1of1ForFork0_~i~1#1|) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 162260#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 162273#(or (< (+ ~M~0 1) ~N~0) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= ~N~0 ~M~0)), 162284#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0) (<= ~M~0 0) (< 1 ~M~0)), 162281#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= ~M~0 0) (< 1 ~M~0)), 162271#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0)), 162268#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 162274#(or (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= ~N~0 ~M~0)), 162261#(< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0), 162265#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 162266#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 162257#(or (<= ~M~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 162283#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0) (< 1 ~M~0)), 162264#(or (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 162276#(or (<= ~M~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 162278#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= ~M~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 162255#(< |thread2Thread1of1ForFork0_~i~1#1| ~M~0), 162285#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= ~M~0 0) (< 1 ~M~0)), 162277#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= ~M~0 |thread2Thread1of1ForFork0_~i~1#1|) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))] [2022-03-15 19:12:20,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:12:20,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:20,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:12:20,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2066, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:12:20,649 INFO L87 Difference]: Start difference. First operand 6560 states and 27197 transitions. Second operand has 41 states, 41 states have (on average 5.878048780487805) internal successors, (241), 40 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:22,255 INFO L93 Difference]: Finished difference Result 12725 states and 51455 transitions. [2022-03-15 19:12:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 19:12:22,256 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 5.878048780487805) internal successors, (241), 40 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:12:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:22,288 INFO L225 Difference]: With dead ends: 12725 [2022-03-15 19:12:22,288 INFO L226 Difference]: Without dead ends: 9825 [2022-03-15 19:12:22,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 464 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=909, Invalid=4061, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 19:12:22,289 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 679 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 2825 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:22,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [679 Valid, 220 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2825 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:12:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9825 states. [2022-03-15 19:12:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9825 to 8465. [2022-03-15 19:12:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8465 states, 8464 states have (on average 4.229914933837429) internal successors, (35802), 8464 states have internal predecessors, (35802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8465 states to 8465 states and 35802 transitions. [2022-03-15 19:12:22,500 INFO L78 Accepts]: Start accepts. Automaton has 8465 states and 35802 transitions. Word has length 30 [2022-03-15 19:12:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:22,501 INFO L470 AbstractCegarLoop]: Abstraction has 8465 states and 35802 transitions. [2022-03-15 19:12:22,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 5.878048780487805) internal successors, (241), 40 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 8465 states and 35802 transitions. [2022-03-15 19:12:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:12:22,522 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:22,522 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:22,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:22,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-03-15 19:12:22,723 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:12:22,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1909292425, now seen corresponding path program 6 times [2022-03-15 19:12:22,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:22,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181199482] [2022-03-15 19:12:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:22,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:22,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181199482] [2022-03-15 19:12:22,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181199482] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:22,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866045607] [2022-03-15 19:12:22,805 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:12:22,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:22,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:22,806 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:22,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:12:22,919 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:12:22,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:22,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:12:22,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:23,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:23,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866045607] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:23,134 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:23,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-03-15 19:12:23,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [939560590] [2022-03-15 19:12:23,134 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:23,138 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:23,201 INFO L252 McrAutomatonBuilder]: Finished intersection with 263 states and 682 transitions. [2022-03-15 19:12:23,202 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:25,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [192182#(or (<= ~N~0 0) (<= 2 ~N~0)), 192181#(or (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 2) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|)), 192180#(<= (+ |thread1Thread1of1ForFork2_~i~0#1| 2) ~N~0)] [2022-03-15 19:12:25,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:12:25,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:12:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:12:25,396 INFO L87 Difference]: Start difference. First operand 8465 states and 35802 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:25,707 INFO L93 Difference]: Finished difference Result 10087 states and 42323 transitions. [2022-03-15 19:12:25,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:12:25,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:12:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:25,736 INFO L225 Difference]: With dead ends: 10087 [2022-03-15 19:12:25,736 INFO L226 Difference]: Without dead ends: 10087 [2022-03-15 19:12:25,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 263 SyntacticMatches, 13 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:12:25,737 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 98 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:25,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 67 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:12:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10087 states. [2022-03-15 19:12:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10087 to 9241. [2022-03-15 19:12:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9241 states, 9240 states have (on average 4.216017316017316) internal successors, (38956), 9240 states have internal predecessors, (38956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 38956 transitions. [2022-03-15 19:12:25,942 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 38956 transitions. Word has length 30 [2022-03-15 19:12:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:25,943 INFO L470 AbstractCegarLoop]: Abstraction has 9241 states and 38956 transitions. [2022-03-15 19:12:25,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 38956 transitions. [2022-03-15 19:12:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:12:25,965 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:25,965 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:25,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:26,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:26,167 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:12:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1392939019, now seen corresponding path program 7 times [2022-03-15 19:12:26,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:26,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102380340] [2022-03-15 19:12:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:12:26,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:26,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102380340] [2022-03-15 19:12:26,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102380340] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:26,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234817744] [2022-03-15 19:12:26,690 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:12:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:26,691 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:26,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:12:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:26,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:12:26,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:27,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:27,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:12:27,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:27,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:12:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:12:27,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:27,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_977 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_977) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 0)) is different from false [2022-03-15 19:12:27,292 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_976) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_977) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 0)) is different from false [2022-03-15 19:12:27,300 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:27,300 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 158 treesize of output 150 [2022-03-15 19:12:27,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 106 [2022-03-15 19:12:27,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2022-03-15 19:12:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 1 not checked. [2022-03-15 19:12:27,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234817744] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:27,631 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:27,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2022-03-15 19:12:27,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1010901374] [2022-03-15 19:12:27,631 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:27,635 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:27,743 INFO L252 McrAutomatonBuilder]: Finished intersection with 169 states and 389 transitions. [2022-03-15 19:12:27,744 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:34,148 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [220978#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2))), 220979#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 220985#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (not (= 2 (select (select |#memory_int| ~A~0.base) 0)))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 220984#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 220977#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 220976#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0), 220987#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 220980#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 220982#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 220988#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (not (= 2 (select (select |#memory_int| ~A~0.base) 0)))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 220986#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 220983#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 220981#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|)))] [2022-03-15 19:12:34,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:12:34,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:34,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:12:34,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2173, Unknown=2, NotChecked=190, Total=2550 [2022-03-15 19:12:34,149 INFO L87 Difference]: Start difference. First operand 9241 states and 38956 transitions. Second operand has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:37,688 INFO L93 Difference]: Finished difference Result 13109 states and 54506 transitions. [2022-03-15 19:12:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:12:37,689 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:12:37,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:37,731 INFO L225 Difference]: With dead ends: 13109 [2022-03-15 19:12:37,732 INFO L226 Difference]: Without dead ends: 13109 [2022-03-15 19:12:37,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 120 SyntacticMatches, 45 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=883, Invalid=6095, Unknown=2, NotChecked=330, Total=7310 [2022-03-15 19:12:37,733 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 495 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 3014 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 3108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:37,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 255 Invalid, 3108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3014 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:12:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13109 states. [2022-03-15 19:12:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13109 to 9333. [2022-03-15 19:12:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9333 states, 9332 states have (on average 4.222674667809687) internal successors, (39406), 9332 states have internal predecessors, (39406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9333 states to 9333 states and 39406 transitions. [2022-03-15 19:12:37,985 INFO L78 Accepts]: Start accepts. Automaton has 9333 states and 39406 transitions. Word has length 31 [2022-03-15 19:12:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:37,986 INFO L470 AbstractCegarLoop]: Abstraction has 9333 states and 39406 transitions. [2022-03-15 19:12:37,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9333 states and 39406 transitions. [2022-03-15 19:12:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:12:38,007 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:38,007 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:38,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:38,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:38,209 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:12:38,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1416479684, now seen corresponding path program 8 times [2022-03-15 19:12:38,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:38,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236383121] [2022-03-15 19:12:38,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:38,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:38,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236383121] [2022-03-15 19:12:38,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236383121] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:38,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435832601] [2022-03-15 19:12:38,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:12:38,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:38,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:38,312 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:38,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:12:38,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:12:38,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:38,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:12:38,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:38,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:38,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435832601] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:38,694 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:38,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 19:12:38,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1343169734] [2022-03-15 19:12:38,695 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:38,698 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:38,840 INFO L252 McrAutomatonBuilder]: Finished intersection with 338 states and 899 transitions. [2022-03-15 19:12:38,840 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:41,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [253031#(< |thread3Thread1of1ForFork1_~i~2#1| ~N~0), 253032#(< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0), 253034#(or (<= ~N~0 (+ |thread3Thread1of1ForFork1_~i~2#1| 1)) (< (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)), 253033#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 253035#(or (<= ~N~0 (+ ~M~0 1)) (< (+ 2 ~M~0) ~N~0))] [2022-03-15 19:12:41,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:12:41,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:41,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:12:41,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:12:41,514 INFO L87 Difference]: Start difference. First operand 9333 states and 39406 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:41,794 INFO L93 Difference]: Finished difference Result 10251 states and 40815 transitions. [2022-03-15 19:12:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:12:41,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:12:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:41,821 INFO L225 Difference]: With dead ends: 10251 [2022-03-15 19:12:41,821 INFO L226 Difference]: Without dead ends: 9671 [2022-03-15 19:12:41,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 318 SyntacticMatches, 36 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:12:41,821 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 195 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:41,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 40 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:12:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9671 states. [2022-03-15 19:12:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9671 to 7454. [2022-03-15 19:12:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7454 states, 7453 states have (on average 4.011136455118744) internal successors, (29895), 7453 states have internal predecessors, (29895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7454 states to 7454 states and 29895 transitions. [2022-03-15 19:12:41,992 INFO L78 Accepts]: Start accepts. Automaton has 7454 states and 29895 transitions. Word has length 31 [2022-03-15 19:12:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:41,992 INFO L470 AbstractCegarLoop]: Abstraction has 7454 states and 29895 transitions. [2022-03-15 19:12:41,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 7454 states and 29895 transitions. [2022-03-15 19:12:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:12:42,008 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:42,008 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:42,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:42,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 19:12:42,208 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:12:42,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1839009401, now seen corresponding path program 1 times [2022-03-15 19:12:42,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:42,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999662790] [2022-03-15 19:12:42,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:42,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:42,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:42,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999662790] [2022-03-15 19:12:42,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999662790] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:42,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937715741] [2022-03-15 19:12:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:42,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:42,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:42,341 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:42,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:12:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:42,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:12:42,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:42,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-15 19:12:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:42,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:42,727 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:42,727 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 20 treesize of output 21 [2022-03-15 19:12:42,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:42,737 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:42,737 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 12 [2022-03-15 19:12:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:42,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937715741] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:42,790 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:42,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 12 [2022-03-15 19:12:42,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381169220] [2022-03-15 19:12:42,790 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:42,794 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:42,874 INFO L252 McrAutomatonBuilder]: Finished intersection with 340 states and 913 transitions. [2022-03-15 19:12:42,874 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:45,540 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:12:45,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:12:45,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:45,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:12:45,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:12:45,541 INFO L87 Difference]: Start difference. First operand 7454 states and 29895 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:45,841 INFO L93 Difference]: Finished difference Result 13921 states and 56155 transitions. [2022-03-15 19:12:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:12:45,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:12:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:45,881 INFO L225 Difference]: With dead ends: 13921 [2022-03-15 19:12:45,881 INFO L226 Difference]: Without dead ends: 13833 [2022-03-15 19:12:45,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 308 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:12:45,882 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 119 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:45,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 30 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:12:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2022-03-15 19:12:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 9336. [2022-03-15 19:12:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9336 states, 9335 states have (on average 4.103910016068559) internal successors, (38310), 9335 states have internal predecessors, (38310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9336 states to 9336 states and 38310 transitions. [2022-03-15 19:12:46,106 INFO L78 Accepts]: Start accepts. Automaton has 9336 states and 38310 transitions. Word has length 31 [2022-03-15 19:12:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:46,106 INFO L470 AbstractCegarLoop]: Abstraction has 9336 states and 38310 transitions. [2022-03-15 19:12:46,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 9336 states and 38310 transitions. [2022-03-15 19:12:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:12:46,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:46,125 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:46,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 19:12:46,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:46,325 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:12:46,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash 912190805, now seen corresponding path program 2 times [2022-03-15 19:12:46,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:46,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856568864] [2022-03-15 19:12:46,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:46,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:46,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:46,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856568864] [2022-03-15 19:12:46,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856568864] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:46,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872332576] [2022-03-15 19:12:46,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:12:46,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:46,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:46,466 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:46,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:12:46,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:12:46,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:46,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:12:46,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:46,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-15 19:12:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:46,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:46,911 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:46,911 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 23 treesize of output 24 [2022-03-15 19:12:46,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:46,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:46,922 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-03-15 19:12:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:47,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872332576] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:47,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:47,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 11 [2022-03-15 19:12:47,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2029197798] [2022-03-15 19:12:47,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:47,010 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:47,098 INFO L252 McrAutomatonBuilder]: Finished intersection with 340 states and 913 transitions. [2022-03-15 19:12:47,098 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:50,298 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [311184#(and (= ~B~0.offset 0) (<= ~res1~0 (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res2~0)) (<= (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res2~0) ~res1~0))] [2022-03-15 19:12:50,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:12:50,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:50,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:12:50,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:12:50,299 INFO L87 Difference]: Start difference. First operand 9336 states and 38310 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:50,620 INFO L93 Difference]: Finished difference Result 15543 states and 63571 transitions. [2022-03-15 19:12:50,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:12:50,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:12:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:50,673 INFO L225 Difference]: With dead ends: 15543 [2022-03-15 19:12:50,674 INFO L226 Difference]: Without dead ends: 15486 [2022-03-15 19:12:50,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:12:50,674 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 104 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:50,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 40 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:12:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15486 states. [2022-03-15 19:12:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15486 to 9612. [2022-03-15 19:12:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9612 states, 9611 states have (on average 4.1402559567162625) internal successors, (39792), 9611 states have internal predecessors, (39792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9612 states to 9612 states and 39792 transitions. [2022-03-15 19:12:50,954 INFO L78 Accepts]: Start accepts. Automaton has 9612 states and 39792 transitions. Word has length 31 [2022-03-15 19:12:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:50,955 INFO L470 AbstractCegarLoop]: Abstraction has 9612 states and 39792 transitions. [2022-03-15 19:12:50,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 9612 states and 39792 transitions. [2022-03-15 19:12:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:12:50,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:50,978 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:51,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:51,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:51,179 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:12:51,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash -142832807, now seen corresponding path program 3 times [2022-03-15 19:12:51,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:51,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908162011] [2022-03-15 19:12:51,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:51,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:51,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:51,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908162011] [2022-03-15 19:12:51,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908162011] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:51,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909518085] [2022-03-15 19:12:51,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:12:51,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:51,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:51,336 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:51,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:12:51,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:12:51,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:51,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:12:51,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:51,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-03-15 19:12:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:51,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:51,809 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:51,809 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 23 treesize of output 24 [2022-03-15 19:12:51,820 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-03-15 19:12:51,821 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-03-15 19:12:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:51,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909518085] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:51,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:51,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 10 [2022-03-15 19:12:51,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1320745391] [2022-03-15 19:12:51,906 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:51,910 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:52,085 INFO L252 McrAutomatonBuilder]: Finished intersection with 340 states and 913 transitions. [2022-03-15 19:12:52,085 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:55,026 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:12:55,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:12:55,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:12:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:12:55,027 INFO L87 Difference]: Start difference. First operand 9612 states and 39792 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:55,323 INFO L93 Difference]: Finished difference Result 13855 states and 56980 transitions. [2022-03-15 19:12:55,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:12:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:12:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:55,362 INFO L225 Difference]: With dead ends: 13855 [2022-03-15 19:12:55,362 INFO L226 Difference]: Without dead ends: 13812 [2022-03-15 19:12:55,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 299 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:12:55,362 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 88 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:55,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 34 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:12:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13812 states. [2022-03-15 19:12:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13812 to 10200. [2022-03-15 19:12:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10200 states, 10199 states have (on average 4.170604961270713) internal successors, (42536), 10199 states have internal predecessors, (42536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10200 states to 10200 states and 42536 transitions. [2022-03-15 19:12:55,591 INFO L78 Accepts]: Start accepts. Automaton has 10200 states and 42536 transitions. Word has length 31 [2022-03-15 19:12:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:55,591 INFO L470 AbstractCegarLoop]: Abstraction has 10200 states and 42536 transitions. [2022-03-15 19:12:55,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 10200 states and 42536 transitions. [2022-03-15 19:12:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:12:55,611 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:55,611 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:55,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:55,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:55,818 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:12:55,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:55,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1585593262, now seen corresponding path program 9 times [2022-03-15 19:12:55,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:55,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867477640] [2022-03-15 19:12:55,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:55,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:55,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:55,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867477640] [2022-03-15 19:12:55,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867477640] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:55,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607372285] [2022-03-15 19:12:55,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:12:55,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:55,862 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:55,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:12:55,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:12:55,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:55,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:12:55,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:56,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:12:56,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607372285] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:56,163 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:56,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 19:12:56,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [856671440] [2022-03-15 19:12:56,163 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:56,167 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:56,252 INFO L252 McrAutomatonBuilder]: Finished intersection with 340 states and 913 transitions. [2022-03-15 19:12:56,253 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:58,346 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [380605#(and (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|)) (or (<= ~N~0 1) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|))), 380554#(<= ~N~0 (+ |thread1Thread1of1ForFork2_~i~0#1| 1))] [2022-03-15 19:12:58,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:12:58,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:58,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:12:58,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:12:58,347 INFO L87 Difference]: Start difference. First operand 10200 states and 42536 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:58,522 INFO L93 Difference]: Finished difference Result 8633 states and 33860 transitions. [2022-03-15 19:12:58,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:12:58,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:12:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:58,544 INFO L225 Difference]: With dead ends: 8633 [2022-03-15 19:12:58,544 INFO L226 Difference]: Without dead ends: 8116 [2022-03-15 19:12:58,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:12:58,544 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 107 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:58,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 27 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:12:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8116 states. [2022-03-15 19:12:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8116 to 7238. [2022-03-15 19:12:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7238 states, 7237 states have (on average 3.9186126848141494) internal successors, (28359), 7237 states have internal predecessors, (28359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 28359 transitions. [2022-03-15 19:12:58,696 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 28359 transitions. Word has length 31 [2022-03-15 19:12:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:58,696 INFO L470 AbstractCegarLoop]: Abstraction has 7238 states and 28359 transitions. [2022-03-15 19:12:58,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:12:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 28359 transitions. [2022-03-15 19:12:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:12:58,710 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:58,710 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:58,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:58,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:12:58,919 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:12:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -147621243, now seen corresponding path program 4 times [2022-03-15 19:12:58,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:58,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488868094] [2022-03-15 19:12:58,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:59,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:59,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488868094] [2022-03-15 19:12:59,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488868094] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:59,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967660106] [2022-03-15 19:12:59,051 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:12:59,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:59,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:59,052 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:59,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:12:59,179 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:12:59,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:59,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:12:59,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:59,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-03-15 19:12:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:59,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:59,396 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:59,396 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 20 treesize of output 21 [2022-03-15 19:12:59,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:59,405 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:59,405 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 12 [2022-03-15 19:12:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:59,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967660106] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:59,465 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:59,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 10 [2022-03-15 19:12:59,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28017268] [2022-03-15 19:12:59,465 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:59,469 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:59,619 INFO L252 McrAutomatonBuilder]: Finished intersection with 340 states and 913 transitions. [2022-03-15 19:12:59,619 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:02,817 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:13:02,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:13:02,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:02,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:13:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:13:02,818 INFO L87 Difference]: Start difference. First operand 7238 states and 28359 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:03,090 INFO L93 Difference]: Finished difference Result 10665 states and 42175 transitions. [2022-03-15 19:13:03,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:13:03,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:13:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:03,119 INFO L225 Difference]: With dead ends: 10665 [2022-03-15 19:13:03,119 INFO L226 Difference]: Without dead ends: 10604 [2022-03-15 19:13:03,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 321 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:13:03,120 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 88 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:03,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 45 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:13:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10604 states. [2022-03-15 19:13:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10604 to 7454. [2022-03-15 19:13:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7454 states, 7453 states have (on average 3.9408291962967934) internal successors, (29371), 7453 states have internal predecessors, (29371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7454 states to 7454 states and 29371 transitions. [2022-03-15 19:13:03,336 INFO L78 Accepts]: Start accepts. Automaton has 7454 states and 29371 transitions. Word has length 31 [2022-03-15 19:13:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:03,337 INFO L470 AbstractCegarLoop]: Abstraction has 7454 states and 29371 transitions. [2022-03-15 19:13:03,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 7454 states and 29371 transitions. [2022-03-15 19:13:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:13:03,351 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:03,351 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:03,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:03,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:13:03,567 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:03,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1382788459, now seen corresponding path program 5 times [2022-03-15 19:13:03,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:03,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233580363] [2022-03-15 19:13:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:03,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:03,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:03,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233580363] [2022-03-15 19:13:03,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233580363] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:03,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323110799] [2022-03-15 19:13:03,723 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:13:03,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:03,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:03,724 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:03,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:13:03,862 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:13:03,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:03,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:13:03,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:04,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-15 19:13:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:04,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:04,097 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:13:04,097 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 23 treesize of output 24 [2022-03-15 19:13:04,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:04,107 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:13:04,107 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-03-15 19:13:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:13:04,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323110799] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:04,182 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:04,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 11 [2022-03-15 19:13:04,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1718231582] [2022-03-15 19:13:04,183 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:04,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:04,274 INFO L252 McrAutomatonBuilder]: Finished intersection with 340 states and 913 transitions. [2022-03-15 19:13:04,274 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:08,349 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [429679#(and (= ~B~0.offset 0) (<= ~res1~0 (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res2~0)) (<= (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res2~0) ~res1~0)), 429680#(and (<= 0 ~res2~0) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~res2~0 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0))] [2022-03-15 19:13:08,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:13:08,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:08,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:13:08,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:13:08,350 INFO L87 Difference]: Start difference. First operand 7454 states and 29371 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:08,650 INFO L93 Difference]: Finished difference Result 10091 states and 39447 transitions. [2022-03-15 19:13:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:13:08,651 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:13:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:08,676 INFO L225 Difference]: With dead ends: 10091 [2022-03-15 19:13:08,676 INFO L226 Difference]: Without dead ends: 10010 [2022-03-15 19:13:08,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 330 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:13:08,677 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 106 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:08,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 48 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:13:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10010 states. [2022-03-15 19:13:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10010 to 7360. [2022-03-15 19:13:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7360 states, 7359 states have (on average 3.927435792906645) internal successors, (28902), 7359 states have internal predecessors, (28902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7360 states to 7360 states and 28902 transitions. [2022-03-15 19:13:08,825 INFO L78 Accepts]: Start accepts. Automaton has 7360 states and 28902 transitions. Word has length 31 [2022-03-15 19:13:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:08,825 INFO L470 AbstractCegarLoop]: Abstraction has 7360 states and 28902 transitions. [2022-03-15 19:13:08,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 7360 states and 28902 transitions. [2022-03-15 19:13:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:13:08,840 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:08,840 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:08,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:09,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:13:09,040 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:09,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1857155225, now seen corresponding path program 6 times [2022-03-15 19:13:09,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:09,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451880611] [2022-03-15 19:13:09,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:09,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:09,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:09,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451880611] [2022-03-15 19:13:09,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451880611] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:09,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994358881] [2022-03-15 19:13:09,181 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:13:09,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:09,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:09,183 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:09,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:13:09,318 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:13:09,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:09,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:13:09,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:09,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 19:13:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:09,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:09,522 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:13:09,522 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 23 treesize of output 24 [2022-03-15 19:13:09,534 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-03-15 19:13:09,534 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-03-15 19:13:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:13:09,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994358881] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:09,613 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:09,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 10 [2022-03-15 19:13:09,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682541663] [2022-03-15 19:13:09,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:09,617 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:09,733 INFO L252 McrAutomatonBuilder]: Finished intersection with 340 states and 913 transitions. [2022-03-15 19:13:09,733 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:12,888 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [454692#(and (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork2_~j~0#1| 0) (= ~res2~0 0))] [2022-03-15 19:13:12,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:13:12,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:13:12,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:13:12,889 INFO L87 Difference]: Start difference. First operand 7360 states and 28902 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:13,161 INFO L93 Difference]: Finished difference Result 9977 states and 39324 transitions. [2022-03-15 19:13:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:13:13,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:13:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:13,191 INFO L225 Difference]: With dead ends: 9977 [2022-03-15 19:13:13,191 INFO L226 Difference]: Without dead ends: 9916 [2022-03-15 19:13:13,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 317 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:13:13,192 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 120 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:13,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 34 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:13:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2022-03-15 19:13:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 7128. [2022-03-15 19:13:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7128 states, 7127 states have (on average 3.8897151676722324) internal successors, (27722), 7127 states have internal predecessors, (27722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7128 states to 7128 states and 27722 transitions. [2022-03-15 19:13:13,354 INFO L78 Accepts]: Start accepts. Automaton has 7128 states and 27722 transitions. Word has length 31 [2022-03-15 19:13:13,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:13,354 INFO L470 AbstractCegarLoop]: Abstraction has 7128 states and 27722 transitions. [2022-03-15 19:13:13,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 7128 states and 27722 transitions. [2022-03-15 19:13:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:13:13,367 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:13,367 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:13,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:13,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:13,568 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:13,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:13,568 INFO L85 PathProgramCache]: Analyzing trace with hash 151239363, now seen corresponding path program 7 times [2022-03-15 19:13:13,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:13,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648287090] [2022-03-15 19:13:13,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:13,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:13,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:13,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648287090] [2022-03-15 19:13:13,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648287090] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:13,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824473600] [2022-03-15 19:13:13,733 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:13:13,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:13,735 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:13,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:13:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:13,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:13:13,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:14,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:14,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:13:14,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-15 19:13:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:14,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:14,284 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1482 (Array Int Int))) (< (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1482) c_~B~0.base) c_~B~0.offset)) (+ c_~res1~0 1))) (forall ((v_ArrVal_1482 (Array Int Int))) (<= c_~res1~0 (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1482) c_~B~0.base) c_~B~0.offset))))) is different from false [2022-03-15 19:13:14,302 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:13:14,303 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 48 treesize of output 40 [2022-03-15 19:13:14,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-03-15 19:13:14,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:13:14,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:14,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-03-15 19:13:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-03-15 19:13:14,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824473600] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:14,477 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:14,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-03-15 19:13:14,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [261151143] [2022-03-15 19:13:14,477 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:14,480 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:14,555 INFO L252 McrAutomatonBuilder]: Finished intersection with 165 states and 368 transitions. [2022-03-15 19:13:14,555 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:16,459 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:13:16,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:13:16,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:16,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:13:16,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=379, Unknown=1, NotChecked=40, Total=506 [2022-03-15 19:13:16,460 INFO L87 Difference]: Start difference. First operand 7128 states and 27722 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:16,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:16,736 INFO L93 Difference]: Finished difference Result 10931 states and 42675 transitions. [2022-03-15 19:13:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:13:16,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:13:16,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:16,765 INFO L225 Difference]: With dead ends: 10931 [2022-03-15 19:13:16,765 INFO L226 Difference]: Without dead ends: 10796 [2022-03-15 19:13:16,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 151 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=491, Unknown=1, NotChecked=46, Total=650 [2022-03-15 19:13:16,765 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 140 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:16,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 31 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:13:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10796 states. [2022-03-15 19:13:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10796 to 7170. [2022-03-15 19:13:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7169 states have (on average 3.881433951736644) internal successors, (27826), 7169 states have internal predecessors, (27826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 27826 transitions. [2022-03-15 19:13:16,923 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 27826 transitions. Word has length 31 [2022-03-15 19:13:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:16,923 INFO L470 AbstractCegarLoop]: Abstraction has 7170 states and 27826 transitions. [2022-03-15 19:13:16,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 27826 transitions. [2022-03-15 19:13:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:13:16,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:16,937 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:16,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:17,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:17,139 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:17,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash -698922095, now seen corresponding path program 8 times [2022-03-15 19:13:17,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:17,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88052859] [2022-03-15 19:13:17,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:17,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:17,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88052859] [2022-03-15 19:13:17,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88052859] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:17,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897626352] [2022-03-15 19:13:17,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:13:17,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:17,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:17,346 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:17,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:13:17,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:13:17,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:17,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 19:13:17,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:17,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:17,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:13:17,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:17,750 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:13:17,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-15 19:13:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:17,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:17,918 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1540 (Array Int Int))) (<= c_~res1~0 (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1540) c_~B~0.base) c_~B~0.offset)))) (forall ((v_ArrVal_1540 (Array Int Int))) (< (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1540) c_~B~0.base) c_~B~0.offset)) (+ c_~res1~0 1)))) is different from false [2022-03-15 19:13:17,946 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (<= c_~res1~0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1540) c_~B~0.base) c_~B~0.offset) c_~res2~0))) (forall ((v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1540) c_~B~0.base) c_~B~0.offset) c_~res2~0) (+ c_~res1~0 1)))) is different from false [2022-03-15 19:13:17,959 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:13:17,959 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 100 treesize of output 76 [2022-03-15 19:13:17,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-03-15 19:13:17,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-03-15 19:13:17,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:13:17,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:13:18,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:18,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2022-03-15 19:13:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-03-15 19:13:18,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897626352] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:18,137 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:18,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2022-03-15 19:13:18,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [383269356] [2022-03-15 19:13:18,137 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:18,140 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:18,172 INFO L252 McrAutomatonBuilder]: Finished intersection with 152 states and 342 transitions. [2022-03-15 19:13:18,172 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:19,954 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:13:19,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:13:19,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:13:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=418, Unknown=2, NotChecked=86, Total=600 [2022-03-15 19:13:19,956 INFO L87 Difference]: Start difference. First operand 7170 states and 27826 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:20,303 INFO L93 Difference]: Finished difference Result 10831 states and 42289 transitions. [2022-03-15 19:13:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:13:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:13:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:20,336 INFO L225 Difference]: With dead ends: 10831 [2022-03-15 19:13:20,336 INFO L226 Difference]: Without dead ends: 10694 [2022-03-15 19:13:20,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=536, Unknown=2, NotChecked=98, Total=756 [2022-03-15 19:13:20,337 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 154 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:20,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 41 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:13:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10694 states. [2022-03-15 19:13:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10694 to 7048. [2022-03-15 19:13:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7048 states, 7047 states have (on average 3.888463175819498) internal successors, (27402), 7047 states have internal predecessors, (27402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 27402 transitions. [2022-03-15 19:13:20,524 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 27402 transitions. Word has length 31 [2022-03-15 19:13:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:20,524 INFO L470 AbstractCegarLoop]: Abstraction has 7048 states and 27402 transitions. [2022-03-15 19:13:20,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 27402 transitions. [2022-03-15 19:13:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:13:20,539 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:20,539 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 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-03-15 19:13:20,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:20,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-03-15 19:13:20,740 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 617678764, now seen corresponding path program 10 times [2022-03-15 19:13:20,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:20,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012169892] [2022-03-15 19:13:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:20,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:20,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012169892] [2022-03-15 19:13:20,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012169892] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:20,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621182428] [2022-03-15 19:13:20,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:13:20,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:20,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:20,843 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:20,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:13:21,019 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:13:21,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:21,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:13:21,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:21,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:21,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:13:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:21,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621182428] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:21,281 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:21,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-03-15 19:13:21,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [284436275] [2022-03-15 19:13:21,282 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:21,285 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:21,343 INFO L252 McrAutomatonBuilder]: Finished intersection with 189 states and 441 transitions. [2022-03-15 19:13:21,343 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:23,295 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [529760#(< |thread3Thread1of1ForFork1_~j~2#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 529763#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ 2 |thread3Thread1of1ForFork1_~j~2#1|)) (< (+ 3 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 529764#(or (<= ~size~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 3 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 529761#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 529762#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1)))] [2022-03-15 19:13:23,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:13:23,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:23,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:13:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:13:23,296 INFO L87 Difference]: Start difference. First operand 7048 states and 27402 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:23,892 INFO L93 Difference]: Finished difference Result 14006 states and 52785 transitions. [2022-03-15 19:13:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:13:23,892 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:13:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:23,936 INFO L225 Difference]: With dead ends: 14006 [2022-03-15 19:13:23,936 INFO L226 Difference]: Without dead ends: 13866 [2022-03-15 19:13:23,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 191 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:13:23,937 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 350 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:23,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 69 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:13:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13866 states. [2022-03-15 19:13:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13866 to 9634. [2022-03-15 19:13:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9634 states, 9633 states have (on average 3.9639779923180734) internal successors, (38185), 9633 states have internal predecessors, (38185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 38185 transitions. [2022-03-15 19:13:24,205 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 38185 transitions. Word has length 32 [2022-03-15 19:13:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:24,205 INFO L470 AbstractCegarLoop]: Abstraction has 9634 states and 38185 transitions. [2022-03-15 19:13:24,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 38185 transitions. [2022-03-15 19:13:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:13:24,223 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:24,223 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:24,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:24,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-03-15 19:13:24,424 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash -123676322, now seen corresponding path program 6 times [2022-03-15 19:13:24,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:24,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896970] [2022-03-15 19:13:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:24,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:24,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896970] [2022-03-15 19:13:24,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896970] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:24,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035201812] [2022-03-15 19:13:24,555 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:13:24,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:24,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:24,556 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:24,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:13:24,716 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:13:24,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:24,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:13:24,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:24,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:24,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:13:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:24,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035201812] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:24,939 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:24,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-03-15 19:13:24,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [723711539] [2022-03-15 19:13:24,939 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:24,942 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:25,062 INFO L252 McrAutomatonBuilder]: Finished intersection with 356 states and 960 transitions. [2022-03-15 19:13:25,062 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:29,130 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [563269#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 2) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))), 563270#(or (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~size~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 563266#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 563271#(or (< 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (<= ~size~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 563268#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 563272#(or (<= ~size~0 2) (<= ~size~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 563267#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))] [2022-03-15 19:13:29,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:13:29,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:29,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:13:29,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:13:29,131 INFO L87 Difference]: Start difference. First operand 9634 states and 38185 transitions. Second operand has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:29,674 INFO L93 Difference]: Finished difference Result 15922 states and 61261 transitions. [2022-03-15 19:13:29,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:13:29,675 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:13:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:29,729 INFO L225 Difference]: With dead ends: 15922 [2022-03-15 19:13:29,729 INFO L226 Difference]: Without dead ends: 15489 [2022-03-15 19:13:29,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 359 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=922, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:13:29,730 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 417 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:29,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 63 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:13:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15489 states. [2022-03-15 19:13:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15489 to 10621. [2022-03-15 19:13:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10621 states, 10620 states have (on average 3.973258003766478) internal successors, (42196), 10620 states have internal predecessors, (42196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10621 states to 10621 states and 42196 transitions. [2022-03-15 19:13:30,113 INFO L78 Accepts]: Start accepts. Automaton has 10621 states and 42196 transitions. Word has length 32 [2022-03-15 19:13:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:30,113 INFO L470 AbstractCegarLoop]: Abstraction has 10621 states and 42196 transitions. [2022-03-15 19:13:30,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 10621 states and 42196 transitions. [2022-03-15 19:13:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:13:30,136 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:30,136 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:30,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:30,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:30,336 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash 660344128, now seen corresponding path program 7 times [2022-03-15 19:13:30,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:30,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021640086] [2022-03-15 19:13:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:30,489 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:30,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021640086] [2022-03-15 19:13:30,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021640086] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:30,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562564010] [2022-03-15 19:13:30,489 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:13:30,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:30,490 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:30,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 19:13:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:30,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 19:13:30,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:30,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:30,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:13:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:30,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:30,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1713) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) |c_thread1Thread1of1ForFork2_~j~0#1|)) is different from false [2022-03-15 19:13:30,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1713) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ |c_thread1Thread1of1ForFork2_~j~0#1| 1))) is different from false [2022-03-15 19:13:30,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-03-15 19:13:30,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-03-15 19:13:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-03-15 19:13:30,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562564010] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:30,918 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:30,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 19:13:30,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967553590] [2022-03-15 19:13:30,918 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:30,921 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:31,007 INFO L252 McrAutomatonBuilder]: Finished intersection with 236 states and 590 transitions. [2022-03-15 19:13:31,007 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:32,540 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [600666#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 600665#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 600667#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))] [2022-03-15 19:13:32,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:13:32,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:32,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:13:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=507, Unknown=2, NotChecked=94, Total=702 [2022-03-15 19:13:32,541 INFO L87 Difference]: Start difference. First operand 10621 states and 42196 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:33,113 INFO L93 Difference]: Finished difference Result 16605 states and 64294 transitions. [2022-03-15 19:13:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:13:33,113 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:13:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:33,168 INFO L225 Difference]: With dead ends: 16605 [2022-03-15 19:13:33,168 INFO L226 Difference]: Without dead ends: 16279 [2022-03-15 19:13:33,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=934, Unknown=2, NotChecked=130, Total=1260 [2022-03-15 19:13:33,169 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 234 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:33,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 80 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:13:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16279 states. [2022-03-15 19:13:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16279 to 10597. [2022-03-15 19:13:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10597 states, 10596 states have (on average 3.977066817667044) internal successors, (42141), 10596 states have internal predecessors, (42141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10597 states to 10597 states and 42141 transitions. [2022-03-15 19:13:33,465 INFO L78 Accepts]: Start accepts. Automaton has 10597 states and 42141 transitions. Word has length 32 [2022-03-15 19:13:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:33,465 INFO L470 AbstractCegarLoop]: Abstraction has 10597 states and 42141 transitions. [2022-03-15 19:13:33,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 10597 states and 42141 transitions. [2022-03-15 19:13:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:13:33,535 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:33,535 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:33,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 19:13:33,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:33,768 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 401716720, now seen corresponding path program 8 times [2022-03-15 19:13:33,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:33,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147476040] [2022-03-15 19:13:33,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:33,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:33,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147476040] [2022-03-15 19:13:33,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147476040] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:33,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793734513] [2022-03-15 19:13:33,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:13:33,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:33,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:33,868 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:33,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 19:13:34,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:13:34,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:34,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 19:13:34,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:34,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:34,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:13:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:34,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:34,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1770 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1770) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ |c_thread1Thread1of1ForFork2_~j~0#1| 1))) is different from false [2022-03-15 19:13:34,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-03-15 19:13:34,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-03-15 19:13:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:34,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793734513] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:34,297 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:34,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2022-03-15 19:13:34,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1579186031] [2022-03-15 19:13:34,297 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:34,300 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:34,339 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 316 transitions. [2022-03-15 19:13:34,339 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:34,951 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [638697#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 638696#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 638695#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 638698#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 2) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))] [2022-03-15 19:13:34,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:13:34,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:34,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:13:34,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=598, Unknown=1, NotChecked=50, Total=756 [2022-03-15 19:13:34,952 INFO L87 Difference]: Start difference. First operand 10597 states and 42141 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:35,534 INFO L93 Difference]: Finished difference Result 16459 states and 63912 transitions. [2022-03-15 19:13:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:13:35,535 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:13:35,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:35,578 INFO L225 Difference]: With dead ends: 16459 [2022-03-15 19:13:35,578 INFO L226 Difference]: Without dead ends: 16459 [2022-03-15 19:13:35,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=1047, Unknown=1, NotChecked=68, Total=1332 [2022-03-15 19:13:35,579 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 260 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:35,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 86 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:13:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16459 states. [2022-03-15 19:13:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16459 to 10582. [2022-03-15 19:13:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10582 states, 10581 states have (on average 3.978735469237312) internal successors, (42099), 10581 states have internal predecessors, (42099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10582 states to 10582 states and 42099 transitions. [2022-03-15 19:13:35,841 INFO L78 Accepts]: Start accepts. Automaton has 10582 states and 42099 transitions. Word has length 32 [2022-03-15 19:13:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:35,841 INFO L470 AbstractCegarLoop]: Abstraction has 10582 states and 42099 transitions. [2022-03-15 19:13:35,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 10582 states and 42099 transitions. [2022-03-15 19:13:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:13:35,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:35,865 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:35,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:36,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:36,083 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:36,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:36,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1022151856, now seen corresponding path program 9 times [2022-03-15 19:13:36,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:36,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856024474] [2022-03-15 19:13:36,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:36,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:36,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:36,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856024474] [2022-03-15 19:13:36,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856024474] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:36,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190640020] [2022-03-15 19:13:36,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:13:36,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:36,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:36,243 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:36,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 19:13:36,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:13:36,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:36,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:13:36,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:36,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:36,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:13:36,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:36,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:13:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:13:36,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:36,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1828) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) |c_thread1Thread1of1ForFork2_~j~0#1|)) is different from false [2022-03-15 19:13:36,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1828) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ |c_thread1Thread1of1ForFork2_~j~0#1| 1))) is different from false [2022-03-15 19:13:36,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1827 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1828) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ |c_thread1Thread1of1ForFork2_~j~0#1| 1))) is different from false [2022-03-15 19:13:36,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2022-03-15 19:13:36,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2022-03-15 19:13:36,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-03-15 19:13:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-03-15 19:13:36,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190640020] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:36,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:36,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 19:13:36,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [203571295] [2022-03-15 19:13:36,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:36,806 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:36,864 INFO L252 McrAutomatonBuilder]: Finished intersection with 229 states and 576 transitions. [2022-03-15 19:13:36,864 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:38,386 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [676555#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))), 676556#(and (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))), 676554#(or (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 676552#(< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))), 676553#(< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))] [2022-03-15 19:13:38,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:13:38,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:38,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:13:38,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=648, Unknown=3, NotChecked=162, Total=930 [2022-03-15 19:13:38,387 INFO L87 Difference]: Start difference. First operand 10582 states and 42099 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:38,932 INFO L93 Difference]: Finished difference Result 14029 states and 54103 transitions. [2022-03-15 19:13:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:13:38,933 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:13:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:38,972 INFO L225 Difference]: With dead ends: 14029 [2022-03-15 19:13:38,972 INFO L226 Difference]: Without dead ends: 13703 [2022-03-15 19:13:38,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=1053, Unknown=3, NotChecked=210, Total=1482 [2022-03-15 19:13:38,973 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 275 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:38,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 74 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:13:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13703 states. [2022-03-15 19:13:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13703 to 9427. [2022-03-15 19:13:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9427 states, 9426 states have (on average 3.9530023339698706) internal successors, (37261), 9426 states have internal predecessors, (37261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9427 states to 9427 states and 37261 transitions. [2022-03-15 19:13:39,198 INFO L78 Accepts]: Start accepts. Automaton has 9427 states and 37261 transitions. Word has length 32 [2022-03-15 19:13:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:39,199 INFO L470 AbstractCegarLoop]: Abstraction has 9427 states and 37261 transitions. [2022-03-15 19:13:39,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 9427 states and 37261 transitions. [2022-03-15 19:13:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:13:39,216 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:39,216 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:39,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:39,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 19:13:39,417 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:39,418 INFO L85 PathProgramCache]: Analyzing trace with hash -77415225, now seen corresponding path program 2 times [2022-03-15 19:13:39,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:39,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573836666] [2022-03-15 19:13:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:13:39,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:39,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573836666] [2022-03-15 19:13:39,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573836666] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:39,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486011006] [2022-03-15 19:13:39,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:13:39,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:39,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:39,482 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:39,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 19:13:39,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:13:39,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:39,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:13:39,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:13:39,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:13:39,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486011006] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:39,809 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:39,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 19:13:39,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1383046195] [2022-03-15 19:13:39,809 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:39,812 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:40,042 INFO L252 McrAutomatonBuilder]: Finished intersection with 610 states and 1747 transitions. [2022-03-15 19:13:40,043 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:47,801 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [709669#(and (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0))), 709671#(<= (+ ~N~0 ~M~0) (+ |thread3Thread1of1ForFork1_~i~2#1| 1)), 709673#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0) (<= ~M~0 0)), 709661#(< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0), 709670#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)), 709665#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= ~M~0 0))), 709667#(and (or (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), 709668#(or (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~M~0 0)), 709664#(<= ~M~0 0), 709666#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= ~M~0 0)), 709662#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 709663#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0)), 709672#(and (or (< (+ ~M~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 ~M~0)) (or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0) (<= ~M~0 0))), 709660#(< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)] [2022-03-15 19:13:47,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:13:47,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:47,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:13:47,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:13:47,802 INFO L87 Difference]: Start difference. First operand 9427 states and 37261 transitions. Second operand has 22 states, 22 states have (on average 7.545454545454546) internal successors, (166), 21 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:48,323 INFO L93 Difference]: Finished difference Result 7587 states and 29403 transitions. [2022-03-15 19:13:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:13:48,323 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.545454545454546) internal successors, (166), 21 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:13:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:48,345 INFO L225 Difference]: With dead ends: 7587 [2022-03-15 19:13:48,345 INFO L226 Difference]: Without dead ends: 7380 [2022-03-15 19:13:48,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 615 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=308, Invalid=1252, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:13:48,346 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 222 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:48,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 99 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:13:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7380 states. [2022-03-15 19:13:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7380 to 7224. [2022-03-15 19:13:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7224 states, 7223 states have (on average 3.9179011491070193) internal successors, (28299), 7223 states have internal predecessors, (28299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7224 states to 7224 states and 28299 transitions. [2022-03-15 19:13:48,501 INFO L78 Accepts]: Start accepts. Automaton has 7224 states and 28299 transitions. Word has length 32 [2022-03-15 19:13:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:48,502 INFO L470 AbstractCegarLoop]: Abstraction has 7224 states and 28299 transitions. [2022-03-15 19:13:48,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.545454545454546) internal successors, (166), 21 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 7224 states and 28299 transitions. [2022-03-15 19:13:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:13:48,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:48,517 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:48,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:48,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 19:13:48,731 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash -610768080, now seen corresponding path program 11 times [2022-03-15 19:13:48,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:48,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764030035] [2022-03-15 19:13:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 19:13:48,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:48,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764030035] [2022-03-15 19:13:48,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764030035] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:48,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958608046] [2022-03-15 19:13:48,815 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:13:48,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:48,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:48,816 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:48,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 19:13:48,975 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:13:48,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:48,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:13:48,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:13:49,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:13:49,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958608046] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:49,188 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:49,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-03-15 19:13:49,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [307155098] [2022-03-15 19:13:49,188 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:49,191 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:49,277 INFO L252 McrAutomatonBuilder]: Finished intersection with 341 states and 914 transitions. [2022-03-15 19:13:49,277 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:52,940 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [731941#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 731938#(or (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)), 731936#(< 0 ~M~0), 731940#(or (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 731932#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 731944#(or (< 0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 731934#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)), 731943#(or (< 0 ~M~0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 731931#(< |thread2Thread1of1ForFork0_~i~1#1| ~M~0), 731937#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 731942#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ 2 ~M~0) ~N~0)), 731939#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)), 731933#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)), 731935#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0))] [2022-03-15 19:13:52,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:13:52,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:52,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:13:52,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:13:52,941 INFO L87 Difference]: Start difference. First operand 7224 states and 28299 transitions. Second operand has 24 states, 24 states have (on average 6.291666666666667) internal successors, (151), 23 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:54,185 INFO L93 Difference]: Finished difference Result 13292 states and 53962 transitions. [2022-03-15 19:13:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:13:54,185 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.291666666666667) internal successors, (151), 23 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:13:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:54,222 INFO L225 Difference]: With dead ends: 13292 [2022-03-15 19:13:54,222 INFO L226 Difference]: Without dead ends: 13292 [2022-03-15 19:13:54,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 338 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=541, Invalid=2765, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:13:54,223 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 341 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:54,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 199 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:13:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13292 states. [2022-03-15 19:13:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13292 to 9604. [2022-03-15 19:13:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9604 states, 9603 states have (on average 3.958867020722691) internal successors, (38017), 9603 states have internal predecessors, (38017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 38017 transitions. [2022-03-15 19:13:54,426 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 38017 transitions. Word has length 32 [2022-03-15 19:13:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:54,426 INFO L470 AbstractCegarLoop]: Abstraction has 9604 states and 38017 transitions. [2022-03-15 19:13:54,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.291666666666667) internal successors, (151), 23 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 38017 transitions. [2022-03-15 19:13:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:13:54,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:54,444 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 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-03-15 19:13:54,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:54,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 19:13:54,645 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:13:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1405343813, now seen corresponding path program 12 times [2022-03-15 19:13:54,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:54,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890565421] [2022-03-15 19:13:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:13:55,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:55,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890565421] [2022-03-15 19:13:55,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890565421] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:55,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124750125] [2022-03-15 19:13:55,048 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:13:55,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:55,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:55,049 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:55,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 19:13:55,305 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:13:55,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:55,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:13:55,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:55,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:55,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:13:55,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:55,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:13:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:13:55,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:55,933 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2002 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2002) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 2)) (not (< c_~M~0 c_~N~0))) is different from false [2022-03-15 19:13:55,956 WARN L838 $PredicateComparison]: unable to prove that (or (not (< c_~M~0 c_~N~0)) (forall ((v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2001) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2002) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 2))) is different from false [2022-03-15 19:13:55,964 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:13:55,965 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 80 treesize of output 80 [2022-03-15 19:13:55,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-03-15 19:13:55,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-03-15 19:13:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2022-03-15 19:13:56,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124750125] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:56,268 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:56,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2022-03-15 19:13:56,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889997638] [2022-03-15 19:13:56,268 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:56,272 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:56,322 INFO L252 McrAutomatonBuilder]: Finished intersection with 190 states and 442 transitions. [2022-03-15 19:13:56,322 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:14:06,220 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 61 new interpolants: [764739#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ 2 |thread3Thread1of1ForFork1_~j~2#1|)) (< (+ 3 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 764741#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 764752#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0), 764783#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= 1 ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0))), 764764#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 3 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 764770#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< 3 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 764731#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~j~2#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)), 764754#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 764745#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 764761#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0))), 764766#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 3 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 764768#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 3 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 764774#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= 1 ~N~0))), 764736#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 764742#(< 0 ~M~0), 764734#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 764785#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0))), 764756#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 764781#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0))), 764746#(or (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 764788#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0))), 764786#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= ~M~0 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0))), 764757#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= 1 ~N~0))), 764749#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 764787#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0))), 764769#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0) (<= 1 ~N~0))), 764776#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= ~M~0 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0))), 764730#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 764751#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< 0 ~M~0) (<= 1 ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 764750#(or (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ 2 |thread3Thread1of1ForFork1_~j~2#1|)) (< (+ 3 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 764728#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 764744#(or (< 0 ~M~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 764743#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 764767#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 764779#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 764780#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0))), 764733#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 764771#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0))), 764773#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0))), 764748#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 764765#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2) (< 3 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 764759#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 764753#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 764747#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|)) (or (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|) (<= 1 ~N~0))), 764782#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0))), 764755#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 764760#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0))), 764762#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0))), 764772#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2) (< 3 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 764729#(< |thread2Thread1of1ForFork0_~i~1#1| ~M~0), 764758#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)), 764732#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0))), 764737#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 764738#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) |thread3Thread1of1ForFork1_~j~2#1|) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0))), 764740#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ 2 |thread3Thread1of1ForFork1_~j~2#1|)) (< (+ 3 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 764777#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0))), 764763#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0))), 764735#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) |thread3Thread1of1ForFork1_~j~2#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 764778#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0)), 764775#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0))), 764784#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 0) (< 0 ~M~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0)))] [2022-03-15 19:14:06,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-03-15 19:14:06,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:14:06,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-03-15 19:14:06,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=912, Invalid=9396, Unknown=2, NotChecked=402, Total=10712 [2022-03-15 19:14:06,222 INFO L87 Difference]: Start difference. First operand 9604 states and 38017 transitions. Second operand has 78 states, 78 states have (on average 3.5128205128205128) internal successors, (274), 77 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:14:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:14:20,487 INFO L93 Difference]: Finished difference Result 25020 states and 101315 transitions. [2022-03-15 19:14:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2022-03-15 19:14:20,488 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.5128205128205128) internal successors, (274), 77 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:14:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:14:20,581 INFO L225 Difference]: With dead ends: 25020 [2022-03-15 19:14:20,581 INFO L226 Difference]: Without dead ends: 24852 [2022-03-15 19:14:20,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 123 SyntacticMatches, 11 SemanticMatches, 240 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 17144 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=8185, Invalid=49181, Unknown=2, NotChecked=954, Total=58322 [2022-03-15 19:14:20,584 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 1066 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 15689 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 15998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 15689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:14:20,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1066 Valid, 721 Invalid, 15998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 15689 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-03-15 19:14:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24852 states. [2022-03-15 19:14:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24852 to 11436. [2022-03-15 19:14:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11436 states, 11435 states have (on average 3.975426322693485) internal successors, (45459), 11435 states have internal predecessors, (45459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:14:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11436 states to 11436 states and 45459 transitions. [2022-03-15 19:14:20,969 INFO L78 Accepts]: Start accepts. Automaton has 11436 states and 45459 transitions. Word has length 33 [2022-03-15 19:14:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:14:20,969 INFO L470 AbstractCegarLoop]: Abstraction has 11436 states and 45459 transitions. [2022-03-15 19:14:20,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.5128205128205128) internal successors, (274), 77 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:14:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 11436 states and 45459 transitions. [2022-03-15 19:14:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:14:20,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:14:20,991 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:14:21,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 19:14:21,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:14:21,192 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:14:21,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:14:21,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1483470271, now seen corresponding path program 9 times [2022-03-15 19:14:21,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:14:21,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519692249] [2022-03-15 19:14:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:14:21,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:14:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:14:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:14:21,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:14:21,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519692249] [2022-03-15 19:14:21,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519692249] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:14:21,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250262850] [2022-03-15 19:14:21,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:14:21,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:14:21,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:14:21,597 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:14:21,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 19:14:21,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:14:21,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:14:21,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:14:21,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:14:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:14:22,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:14:22,269 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:14:22,269 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 24 [2022-03-15 19:14:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:14:22,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250262850] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:14:22,565 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:14:22,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2022-03-15 19:14:22,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184132543] [2022-03-15 19:14:22,566 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:14:22,569 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:14:22,700 INFO L252 McrAutomatonBuilder]: Finished intersection with 391 states and 1061 transitions. [2022-03-15 19:14:22,700 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:14:58,889 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 46 new interpolants: [813211#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)), 813210#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)), 813191#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))), 813213#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 813208#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1)) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 813218#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 813196#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 813200#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 813221#(or (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= ~N~0 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (< 1 ~N~0)), 813223#(and (or (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (< 1 ~N~0)) (or (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 813190#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 813220#(or (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (< 1 ~N~0)), 813216#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= ~N~0 1)) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|))), 813226#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 813204#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 813188#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2))), 813206#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 813198#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 813189#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1)) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 813227#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0))), 813225#(or (= ~A~0.offset 0) (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (< 1 ~N~0)), 813207#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 813195#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 813192#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 813212#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (<= |thread3Thread1of1ForFork1_~j~2#1| 2) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 813222#(and (or (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 813187#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 813194#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1)) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 813214#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 813197#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 813228#(and (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (<= (+ ~M~0 1) 0))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= ~N~0 1))), 813219#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= ~N~0 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0))), 813199#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1)) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 813224#(and (or (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0))) (or (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (< 1 ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 0 ~N~0)))), 813203#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 813193#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 813230#(and (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= ~N~0 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 813205#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 813202#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 813231#(and (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= ~N~0 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0)) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0)) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1))) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 813201#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 813229#(and (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= ~N~0 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 813215#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 813217#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 813209#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 813186#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)] [2022-03-15 19:14:58,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 19:14:58,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:14:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 19:14:58,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=6292, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 19:14:58,890 INFO L87 Difference]: Start difference. First operand 11436 states and 45459 transitions. Second operand has 61 states, 61 states have (on average 5.049180327868853) internal successors, (308), 60 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:15:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:15:20,981 INFO L93 Difference]: Finished difference Result 17802 states and 65868 transitions. [2022-03-15 19:15:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2022-03-15 19:15:20,981 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 5.049180327868853) internal successors, (308), 60 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:15:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:15:21,036 INFO L225 Difference]: With dead ends: 17802 [2022-03-15 19:15:21,036 INFO L226 Difference]: Without dead ends: 17434 [2022-03-15 19:15:21,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 298 SyntacticMatches, 57 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21462 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=7599, Invalid=55151, Unknown=0, NotChecked=0, Total=62750 [2022-03-15 19:15:21,040 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 957 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 10045 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 10475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 10045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:15:21,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [957 Valid, 1287 Invalid, 10475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 10045 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-03-15 19:15:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17434 states. [2022-03-15 19:15:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17434 to 11580. [2022-03-15 19:15:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11580 states, 11579 states have (on average 3.964245617065377) internal successors, (45902), 11579 states have internal predecessors, (45902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:15:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11580 states to 11580 states and 45902 transitions. [2022-03-15 19:15:21,365 INFO L78 Accepts]: Start accepts. Automaton has 11580 states and 45902 transitions. Word has length 33 [2022-03-15 19:15:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:15:21,365 INFO L470 AbstractCegarLoop]: Abstraction has 11580 states and 45902 transitions. [2022-03-15 19:15:21,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 5.049180327868853) internal successors, (308), 60 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:15:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 11580 states and 45902 transitions. [2022-03-15 19:15:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:15:21,389 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:15:21,389 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:15:21,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 19:15:21,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:15:21,590 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:15:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:15:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2146698899, now seen corresponding path program 10 times [2022-03-15 19:15:21,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:15:21,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127941048] [2022-03-15 19:15:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:15:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:15:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:15:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:15:21,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:15:21,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127941048] [2022-03-15 19:15:21,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127941048] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:15:21,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340154768] [2022-03-15 19:15:21,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:15:21,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:15:21,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:15:21,983 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:15:21,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 19:15:22,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:15:22,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:15:22,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:15:22,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:15:22,292 INFO L353 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-03-15 19:15:22,292 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 13 [2022-03-15 19:15:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:15:22,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:15:22,409 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:15:22,410 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 23 treesize of output 23 [2022-03-15 19:15:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:15:22,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340154768] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:15:22,500 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:15:22,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2022-03-15 19:15:22,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273999281] [2022-03-15 19:15:22,500 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:15:22,503 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:15:22,613 INFO L252 McrAutomatonBuilder]: Finished intersection with 357 states and 961 transitions. [2022-03-15 19:15:22,613 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:15:47,144 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [854751#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 854757#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))), 854779#(or (< 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (<= ~N~0 0) (< 1 ~N~0)), 854759#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 854669#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 854785#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|)) (or (not (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (<= (+ ~M~0 1) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ (- 1) ~N~0) 0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (not (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)))), 854784#(and (or (not (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|))), 854763#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 854752#(or (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 854764#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 854762#(and (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) 0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 854770#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 854758#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 854754#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 854776#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 2) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 2))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (not (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 2))) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 854775#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 2))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 2))) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 2))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 2))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 2))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 854778#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|)), 854782#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (<= ~N~0 0) (< 1 ~N~0)), 854774#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 2) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))), 854773#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 2) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))), 854766#(and (or (not (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 854765#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 854780#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|)), 854760#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))))), 854772#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) 0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 854753#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0), 854771#(and (or (not (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), 854786#(or (= ~A~0.offset 0) (< 2 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (<= ~N~0 0) (< 1 ~N~0)), 854761#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (= (+ (- 1) ~N~0) 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= 2 (select (select |#memory_int| ~A~0.base) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 854756#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))))), 854755#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))))), 854768#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))), 854767#(and (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) 0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1)))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 1))))), 854781#(and (or (not (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (- 1) ~N~0) 0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (not (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (not (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))) (or (not (< 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (= ~A~0.offset 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)))), 854783#(and (or (not (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2)) (= |thread3Thread1of1ForFork1_~j~2#1| 0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (= ~A~0.offset 0) (not (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2)) (< 1 ~N~0) (not (< 0 ~N~0))) (or (not (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2)) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 1 ~N~0) (not (< 0 ~N~0)))), 854769#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 854777#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork2_~j~0#1| 2) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) 0)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 2))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 2))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) (+ |thread1Thread1of1ForFork2_~j~0#1| 2))) (not (< (+ |thread1Thread1of1ForFork2_~j~0#1| 1) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))))] [2022-03-15 19:15:47,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 19:15:47,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:15:47,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 19:15:47,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=3788, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 19:15:47,145 INFO L87 Difference]: Start difference. First operand 11580 states and 45902 transitions. Second operand has 51 states, 51 states have (on average 5.098039215686274) internal successors, (260), 50 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:16:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:16:13,959 INFO L93 Difference]: Finished difference Result 20184 states and 74151 transitions. [2022-03-15 19:16:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2022-03-15 19:16:13,959 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.098039215686274) internal successors, (260), 50 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:16:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:16:14,021 INFO L225 Difference]: With dead ends: 20184 [2022-03-15 19:16:14,021 INFO L226 Difference]: Without dead ends: 20070 [2022-03-15 19:16:14,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 292 SyntacticMatches, 46 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37740 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=14364, Invalid=87716, Unknown=0, NotChecked=0, Total=102080 [2022-03-15 19:16:14,029 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 812 mSDsluCounter, 2681 mSDsCounter, 0 mSdLazyCounter, 9987 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 10501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 9987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:16:14,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [812 Valid, 1101 Invalid, 10501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 9987 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-03-15 19:16:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20070 states. [2022-03-15 19:16:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20070 to 12010. [2022-03-15 19:16:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12010 states, 12009 states have (on average 3.957032225830627) internal successors, (47520), 12009 states have internal predecessors, (47520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:16:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12010 states to 12010 states and 47520 transitions. [2022-03-15 19:16:14,360 INFO L78 Accepts]: Start accepts. Automaton has 12010 states and 47520 transitions. Word has length 33 [2022-03-15 19:16:14,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:16:14,360 INFO L470 AbstractCegarLoop]: Abstraction has 12010 states and 47520 transitions. [2022-03-15 19:16:14,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.098039215686274) internal successors, (260), 50 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:16:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 12010 states and 47520 transitions. [2022-03-15 19:16:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:16:14,383 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:16:14,383 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:16:14,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 19:16:14,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 19:16:14,583 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:16:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:16:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1243327485, now seen corresponding path program 10 times [2022-03-15 19:16:14,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:16:14,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570933116] [2022-03-15 19:16:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:16:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:16:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:16:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:16:15,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:16:15,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570933116] [2022-03-15 19:16:15,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570933116] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:16:15,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765319518] [2022-03-15 19:16:15,097 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:16:15,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:16:15,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:16:15,098 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:16:15,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 19:16:15,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:16:15,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:16:15,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:16:15,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:16:15,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:15,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:16:15,619 INFO L353 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-03-15 19:16:15,620 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 13 [2022-03-15 19:16:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:16:15,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:16:15,799 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ 2 c_~M~0) c_~N~0) (forall ((v_ArrVal_2183 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2183) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 1))) is different from false [2022-03-15 19:16:15,811 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:16:15,811 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 42 treesize of output 42 [2022-03-15 19:16:15,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-03-15 19:16:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 1 not checked. [2022-03-15 19:16:16,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765319518] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:16:16,046 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:16:16,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 44 [2022-03-15 19:16:16,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1512967947] [2022-03-15 19:16:16,046 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:16:16,049 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:16:16,100 INFO L252 McrAutomatonBuilder]: Finished intersection with 186 states and 421 transitions. [2022-03-15 19:16:16,100 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:16:27,147 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 61 new interpolants: [899765#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 899783#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0))), 899742#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 899774#(and (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0))), 899749#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~j~2#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)), 899772#(and (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0))), 899779#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0)), 899756#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 899778#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 899794#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 ~M~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< 0 ~M~0))), 899789#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0))), 899750#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 899747#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 899771#(and (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0))), 899782#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0))), 899795#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) (<= |thread1Thread1of1ForFork2_~j~0#1| 1)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 899762#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 899757#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 2)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 899776#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< 0 ~M~0))), 899786#(and (= ~A~0.offset 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), 899773#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 899787#(and (= ~A~0.offset 0) (<= 1 ~N~0) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), 899766#(and (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0))), 899797#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~j~0#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 899753#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0))), 899748#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 899746#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 899791#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1) (<= |thread1Thread1of1ForFork2_~j~0#1| 1)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 899744#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 899754#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0))), 899761#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 899796#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= |thread1Thread1of1ForFork2_~j~0#1| 0)) (or (< 0 ~M~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 899763#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0))), 899785#(and (= ~A~0.offset 0) (<= 1 ~N~0) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1))) (<= ~M~0 0)), 899781#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2))), 899759#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 899741#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0), 899792#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= 1 ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0))), 899760#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 899739#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 899775#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (< 0 ~M~0) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 899768#(or (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 899793#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~j~0#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 899788#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= ~M~0 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 899751#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 899755#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)), 899764#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 899738#(< |thread2Thread1of1ForFork0_~i~1#1| ~M~0), 899784#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0))), 899769#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 899770#(and (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< 0 ~M~0))), 899758#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 899790#(and (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0))), 899767#(or (< 0 ~M~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 899745#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 899740#(< 0 ~M~0), 899798#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= |thread1Thread1of1ForFork2_~j~0#1| 0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 1)))), 899752#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 2)) (or (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0))), 899743#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 2)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (<= 1 ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), 899780#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 899777#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (<= 1 ~N~0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (+ (- 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) 0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)))] [2022-03-15 19:16:27,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-03-15 19:16:27,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:16:27,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-03-15 19:16:27,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=10024, Unknown=1, NotChecked=206, Total=11130 [2022-03-15 19:16:27,149 INFO L87 Difference]: Start difference. First operand 12010 states and 47520 transitions. Second operand has 79 states, 79 states have (on average 3.3164556962025316) internal successors, (262), 78 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:16:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:16:53,377 INFO L93 Difference]: Finished difference Result 27031 states and 108075 transitions. [2022-03-15 19:16:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2022-03-15 19:16:53,377 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 3.3164556962025316) internal successors, (262), 78 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:16:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:16:53,478 INFO L225 Difference]: With dead ends: 27031 [2022-03-15 19:16:53,479 INFO L226 Difference]: Without dead ends: 26835 [2022-03-15 19:16:53,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 114 SyntacticMatches, 12 SemanticMatches, 340 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38482 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=14124, Invalid=101819, Unknown=1, NotChecked=678, Total=116622 [2022-03-15 19:16:53,484 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 2166 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 17320 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 17998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 17320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:16:53,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2166 Valid, 1166 Invalid, 17998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 17320 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-03-15 19:16:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26835 states. [2022-03-15 19:16:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26835 to 13130. [2022-03-15 19:16:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13130 states, 13129 states have (on average 3.9519384568512455) internal successors, (51885), 13129 states have internal predecessors, (51885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:16:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13130 states to 13130 states and 51885 transitions. [2022-03-15 19:16:54,024 INFO L78 Accepts]: Start accepts. Automaton has 13130 states and 51885 transitions. Word has length 33 [2022-03-15 19:16:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:16:54,025 INFO L470 AbstractCegarLoop]: Abstraction has 13130 states and 51885 transitions. [2022-03-15 19:16:54,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 3.3164556962025316) internal successors, (262), 78 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:16:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 13130 states and 51885 transitions. [2022-03-15 19:16:54,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:16:54,053 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:16:54,053 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:16:54,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 19:16:54,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:16:54,270 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:16:54,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:16:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1092715221, now seen corresponding path program 11 times [2022-03-15 19:16:54,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:16:54,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958982857] [2022-03-15 19:16:54,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:16:54,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:16:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:16:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:16:54,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:16:54,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958982857] [2022-03-15 19:16:54,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958982857] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:16:54,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874009732] [2022-03-15 19:16:54,698 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:16:54,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:16:54,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:16:54,699 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:16:54,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 19:16:54,860 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:16:54,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:16:54,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:16:54,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:16:55,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:55,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:16:55,229 INFO L353 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-03-15 19:16:55,229 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 13 [2022-03-15 19:16:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:16:55,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:16:55,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_2244 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2244) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))) is different from false [2022-03-15 19:16:55,399 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:16:55,399 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 41 treesize of output 41 [2022-03-15 19:16:55,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-03-15 19:16:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2022-03-15 19:16:55,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874009732] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:16:55,641 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:16:55,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 34 [2022-03-15 19:16:55,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271660041] [2022-03-15 19:16:55,641 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:16:55,644 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:16:55,683 INFO L252 McrAutomatonBuilder]: Finished intersection with 154 states and 331 transitions. [2022-03-15 19:16:55,684 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:00,394 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [953794#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= 2 (select (select |#memory_int| ~A~0.base) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 953704#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 953791#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))))), 953708#(or (not (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 953790#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 953793#(or (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))), 953789#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0), 953792#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))))] [2022-03-15 19:17:00,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:17:00,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:00,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:17:00,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1350, Unknown=1, NotChecked=76, Total=1640 [2022-03-15 19:17:00,395 INFO L87 Difference]: Start difference. First operand 13130 states and 51885 transitions. Second operand has 23 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:05,094 INFO L93 Difference]: Finished difference Result 16520 states and 62937 transitions. [2022-03-15 19:17:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 19:17:05,095 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:17:05,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:05,144 INFO L225 Difference]: With dead ends: 16520 [2022-03-15 19:17:05,144 INFO L226 Difference]: Without dead ends: 16430 [2022-03-15 19:17:05,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 101 SyntacticMatches, 57 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4067 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1891, Invalid=9032, Unknown=1, NotChecked=206, Total=11130 [2022-03-15 19:17:05,146 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 306 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 2881 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:05,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 324 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2881 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:17:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16430 states. [2022-03-15 19:17:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16430 to 13024. [2022-03-15 19:17:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13024 states, 13023 states have (on average 3.9604545803578284) internal successors, (51577), 13023 states have internal predecessors, (51577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13024 states to 13024 states and 51577 transitions. [2022-03-15 19:17:05,477 INFO L78 Accepts]: Start accepts. Automaton has 13024 states and 51577 transitions. Word has length 33 [2022-03-15 19:17:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:05,477 INFO L470 AbstractCegarLoop]: Abstraction has 13024 states and 51577 transitions. [2022-03-15 19:17:05,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 13024 states and 51577 transitions. [2022-03-15 19:17:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:17:05,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:05,504 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:05,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-03-15 19:17:05,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:05,711 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:17:05,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:05,713 INFO L85 PathProgramCache]: Analyzing trace with hash 960696721, now seen corresponding path program 11 times [2022-03-15 19:17:05,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:05,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181969768] [2022-03-15 19:17:05,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:05,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:17:06,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:06,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181969768] [2022-03-15 19:17:06,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181969768] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:06,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326791437] [2022-03-15 19:17:06,080 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:17:06,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:06,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:06,081 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:17:06,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 19:17:06,253 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:17:06,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:06,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:17:06,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:06,585 INFO L353 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-03-15 19:17:06,585 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 13 [2022-03-15 19:17:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:17:06,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:06,723 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:17:06,723 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 26 treesize of output 26 [2022-03-15 19:17:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:17:06,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326791437] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:06,974 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:06,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 37 [2022-03-15 19:17:06,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [145667015] [2022-03-15 19:17:06,974 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:06,977 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:07,044 INFO L252 McrAutomatonBuilder]: Finished intersection with 223 states and 539 transitions. [2022-03-15 19:17:07,044 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:23,132 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 67 new interpolants: [996735#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 996731#(< |thread2Thread1of1ForFork0_~i~1#1| ~M~0), 996775#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (<= ~N~0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 ~M~0) (<= ~M~0 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= ~N~0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= ~N~0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2)))), 996729#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 2) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996777#(and (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< 0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< 0 ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (= ~A~0.offset 0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< 0 ~M~0))), 996778#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (< 0 ~M~0) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 996756#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2))), 996781#(and (or (not (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread1Thread1of1ForFork2_~j~0#1| 1)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0))), 996773#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|))), 996786#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~j~0#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0))), 996733#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 996771#(and (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= ~N~0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2))) (or (<= 1 ~N~0) (<= ~N~0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2))) (or (<= ~N~0 ~M~0) (<= ~M~0 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2))) (or (= ~A~0.offset 0) (<= ~N~0 ~M~0))), 996750#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 996763#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 996727#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))), 996741#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996764#(and (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 996789#(and (= ~A~0.offset 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 996738#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 996745#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996765#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996723#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0), 996761#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 996785#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= |thread1Thread1of1ForFork2_~j~0#1| 1)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0))), 996748#(or (< 0 ~M~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 996759#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 996784#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread1Thread1of1ForFork2_~j~0#1| 1)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0))), 996744#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 2)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996743#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 996768#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 996726#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 996752#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< 0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< 0 ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996787#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= |thread1Thread1of1ForFork2_~j~0#1| 0)) (or (< 0 ~M~0) (<= 1 ~N~0))), 996747#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 996774#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 996772#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 996734#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 996757#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0) (< 0 ~M~0))), 996776#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 996758#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))), 996788#(and (= ~A~0.offset 0) (<= 1 ~N~0) (<= ~M~0 0)), 996755#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 996770#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 996740#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 2))), 996749#(or (< 0 ~M~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 996754#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 0 ~M~0)), 996730#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 1) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996724#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 996728#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread1Thread1of1ForFork2_~j~0#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))), 996779#(and (or (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= ~N~0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2))) (or (<= 1 ~N~0) (<= ~N~0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 2))) (or (= ~A~0.offset 0) (< 0 ~M~0) (<= ~N~0 ~M~0))), 996751#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< 0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< 0 ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996767#(and (or (< 0 ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< 0 ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (not (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< 0 ~M~0) (<= |thread1Thread1of1ForFork2_~j~0#1| 1))), 996780#(and (or (not (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread1Thread1of1ForFork2_~j~0#1| 1)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996737#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~j~2#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)), 996742#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996760#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 2) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|)))), 996766#(and (or (not (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread1Thread1of1ForFork2_~j~0#1| 1)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996769#(and (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (= ~A~0.offset 0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|))), 996783#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (not (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< 0 ~M~0) (<= |thread1Thread1of1ForFork2_~j~0#1| 1)) (or (< 0 ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= 1 ~N~0))), 996736#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 996746#(< 0 ~M~0), 996739#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 996753#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< 0 ~M~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< 0 ~M~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 996782#(and (or (< 0 ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (not (= 2 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< 0 ~M~0) (<= |thread1Thread1of1ForFork2_~j~0#1| 1))), 996725#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= |thread3Thread1of1ForFork1_~j~2#1| 2)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 996762#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< 0 ~M~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) |thread1Thread1of1ForFork2_~j~0#1|))), 996732#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0))] [2022-03-15 19:17:23,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-15 19:17:23,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-15 19:17:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=10090, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 19:17:23,134 INFO L87 Difference]: Start difference. First operand 13024 states and 51577 transitions. Second operand has 84 states, 84 states have (on average 3.619047619047619) internal successors, (304), 83 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:55,116 INFO L93 Difference]: Finished difference Result 29201 states and 116604 transitions. [2022-03-15 19:17:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 296 states. [2022-03-15 19:17:55,116 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.619047619047619) internal successors, (304), 83 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:17:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:55,238 INFO L225 Difference]: With dead ends: 29201 [2022-03-15 19:17:55,238 INFO L226 Difference]: Without dead ends: 29039 [2022-03-15 19:17:55,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 152 SyntacticMatches, 14 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52107 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=17820, Invalid=136236, Unknown=0, NotChecked=0, Total=154056 [2022-03-15 19:17:55,246 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 1881 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 19328 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 20046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 19328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:55,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1881 Valid, 1076 Invalid, 20046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [718 Valid, 19328 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-03-15 19:17:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29039 states. [2022-03-15 19:17:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29039 to 12880. [2022-03-15 19:17:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12880 states, 12879 states have (on average 3.9616429847037815) internal successors, (51022), 12879 states have internal predecessors, (51022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12880 states to 12880 states and 51022 transitions. [2022-03-15 19:17:55,689 INFO L78 Accepts]: Start accepts. Automaton has 12880 states and 51022 transitions. Word has length 33 [2022-03-15 19:17:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:55,689 INFO L470 AbstractCegarLoop]: Abstraction has 12880 states and 51022 transitions. [2022-03-15 19:17:55,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.619047619047619) internal successors, (304), 83 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:17:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 12880 states and 51022 transitions. [2022-03-15 19:17:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:17:55,714 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:55,714 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:55,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 19:17:55,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 19:17:55,915 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:17:55,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:55,915 INFO L85 PathProgramCache]: Analyzing trace with hash 624725403, now seen corresponding path program 12 times [2022-03-15 19:17:55,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:55,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925544272] [2022-03-15 19:17:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:55,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:17:56,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:56,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925544272] [2022-03-15 19:17:56,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925544272] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:56,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534705345] [2022-03-15 19:17:56,498 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:17:56,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:56,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:56,500 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:17:56,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 19:17:56,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:17:56,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:56,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:17:56,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:56,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:17:57,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:17:57,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:17:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:17:57,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:57,310 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2366 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2366) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 1)) is different from false [2022-03-15 19:17:57,404 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:17:57,404 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 179 treesize of output 171 [2022-03-15 19:17:57,412 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:17:57,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 79 [2022-03-15 19:17:57,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 94 [2022-03-15 19:17:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-03-15 19:17:57,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534705345] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:57,790 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:57,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2022-03-15 19:17:57,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9938445] [2022-03-15 19:17:57,790 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:57,793 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:57,849 INFO L252 McrAutomatonBuilder]: Finished intersection with 176 states and 401 transitions. [2022-03-15 19:17:57,850 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:05,195 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1052565#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 1052569#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 |thread3Thread1of1ForFork1_~j~2#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 1)) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 1052563#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|) (< (+ |thread3Thread1of1ForFork1_~j~2#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 1052572#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (< 2 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 1052564#(or (< (+ 2 |thread3Thread1of1ForFork1_~j~2#1|) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (+ |thread3Thread1of1ForFork1_~j~2#1| 1))), 1052570#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= |thread3Thread1of1ForFork1_~j~2#1| 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2)))), 1052568#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= |thread3Thread1of1ForFork1_~j~2#1| 2))), 1052562#(or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) |thread3Thread1of1ForFork1_~j~2#1|))), 1052571#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)) (or (not (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) 2))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0))), 1052573#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (= (select (select |#memory_int| ~A~0.base) 0) 1) (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0))), 1052567#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 1052566#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)] [2022-03-15 19:18:05,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:18:05,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:05,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:18:05,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2647, Unknown=1, NotChecked=104, Total=2970 [2022-03-15 19:18:05,196 INFO L87 Difference]: Start difference. First operand 12880 states and 51022 transitions. Second operand has 29 states, 29 states have (on average 4.310344827586207) internal successors, (125), 28 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:08,629 INFO L93 Difference]: Finished difference Result 13472 states and 52536 transitions. [2022-03-15 19:18:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:18:08,630 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.310344827586207) internal successors, (125), 28 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:18:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:08,677 INFO L225 Difference]: With dead ends: 13472 [2022-03-15 19:18:08,677 INFO L226 Difference]: Without dead ends: 13336 [2022-03-15 19:18:08,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 121 SyntacticMatches, 45 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=646, Invalid=6163, Unknown=1, NotChecked=162, Total=6972 [2022-03-15 19:18:08,678 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 270 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 3737 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:08,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 484 Invalid, 3805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3737 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:18:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13336 states. [2022-03-15 19:18:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13336 to 12862. [2022-03-15 19:18:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12862 states, 12861 states have (on average 3.962833372210559) internal successors, (50966), 12861 states have internal predecessors, (50966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12862 states to 12862 states and 50966 transitions. [2022-03-15 19:18:08,994 INFO L78 Accepts]: Start accepts. Automaton has 12862 states and 50966 transitions. Word has length 33 [2022-03-15 19:18:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:08,994 INFO L470 AbstractCegarLoop]: Abstraction has 12862 states and 50966 transitions. [2022-03-15 19:18:08,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.310344827586207) internal successors, (125), 28 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 12862 states and 50966 transitions. [2022-03-15 19:18:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:18:09,025 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:09,025 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:09,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:09,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 19:18:09,226 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:18:09,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash 289911194, now seen corresponding path program 3 times [2022-03-15 19:18:09,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:09,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529219020] [2022-03-15 19:18:09,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:09,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 19:18:09,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:09,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529219020] [2022-03-15 19:18:09,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529219020] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:18:09,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:18:09,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 19:18:09,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [454371412] [2022-03-15 19:18:09,287 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:09,290 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:09,568 INFO L252 McrAutomatonBuilder]: Finished intersection with 635 states and 1836 transitions. [2022-03-15 19:18:09,568 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:15,904 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1091835#(< (+ |thread2Thread1of1ForFork0_~j~1#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4)))), 1091837#(or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (< 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4)))) (<= ~size~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))))), 1091834#(< |thread2Thread1of1ForFork0_~j~1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4)))), 1091839#(or (<= ~size~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~size~0 0)), 1091838#(or (< 1 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) 0) (<= ~size~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 1091836#(or (< (+ |thread2Thread1of1ForFork0_~j~1#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4)))) (not (< |thread2Thread1of1ForFork0_~j~1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))))))] [2022-03-15 19:18:15,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:18:15,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:15,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:18:15,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:18:15,905 INFO L87 Difference]: Start difference. First operand 12862 states and 50966 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:16,236 INFO L93 Difference]: Finished difference Result 14165 states and 55722 transitions. [2022-03-15 19:18:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:18:16,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:18:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:16,277 INFO L225 Difference]: With dead ends: 14165 [2022-03-15 19:18:16,277 INFO L226 Difference]: Without dead ends: 13904 [2022-03-15 19:18:16,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 490 SyntacticMatches, 24 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:18:16,278 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 106 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:16,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 51 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:18:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13904 states. [2022-03-15 19:18:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13904 to 13333. [2022-03-15 19:18:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13333 states, 13332 states have (on average 3.952745274527453) internal successors, (52698), 13332 states have internal predecessors, (52698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13333 states to 13333 states and 52698 transitions. [2022-03-15 19:18:16,604 INFO L78 Accepts]: Start accepts. Automaton has 13333 states and 52698 transitions. Word has length 33 [2022-03-15 19:18:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:16,605 INFO L470 AbstractCegarLoop]: Abstraction has 13333 states and 52698 transitions. [2022-03-15 19:18:16,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 13333 states and 52698 transitions. [2022-03-15 19:18:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:18:16,633 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:16,633 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:16,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-15 19:18:16,633 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:18:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1138338242, now seen corresponding path program 4 times [2022-03-15 19:18:16,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:16,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827612532] [2022-03-15 19:18:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 19:18:16,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:16,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827612532] [2022-03-15 19:18:16,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827612532] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:18:16,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:18:16,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 19:18:16,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1726494813] [2022-03-15 19:18:16,715 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:16,718 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:16,778 INFO L252 McrAutomatonBuilder]: Finished intersection with 208 states and 489 transitions. [2022-03-15 19:18:16,779 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:18,353 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1132684#(< |thread2Thread1of1ForFork0_~j~1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4)))), 1132686#(or (< (+ |thread2Thread1of1ForFork0_~j~1#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4)))) (not (< |thread2Thread1of1ForFork0_~j~1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4)))))), 1132685#(< (+ |thread2Thread1of1ForFork0_~j~1#1| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))))] [2022-03-15 19:18:18,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:18:18,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:18,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:18:18,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:18:18,354 INFO L87 Difference]: Start difference. First operand 13333 states and 52698 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:18,609 INFO L93 Difference]: Finished difference Result 13457 states and 53057 transitions. [2022-03-15 19:18:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:18:18,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:18:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:18,655 INFO L225 Difference]: With dead ends: 13457 [2022-03-15 19:18:18,655 INFO L226 Difference]: Without dead ends: 13334 [2022-03-15 19:18:18,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 149 SyntacticMatches, 16 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:18:18,656 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 57 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:18,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:18:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13334 states. [2022-03-15 19:18:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13334 to 12862. [2022-03-15 19:18:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12862 states, 12861 states have (on average 3.9627556177591168) internal successors, (50965), 12861 states have internal predecessors, (50965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12862 states to 12862 states and 50965 transitions. [2022-03-15 19:18:18,957 INFO L78 Accepts]: Start accepts. Automaton has 12862 states and 50965 transitions. Word has length 33 [2022-03-15 19:18:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:18,957 INFO L470 AbstractCegarLoop]: Abstraction has 12862 states and 50965 transitions. [2022-03-15 19:18:18,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 12862 states and 50965 transitions. [2022-03-15 19:18:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:18:18,984 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:18,984 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:18,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-15 19:18:18,984 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:18:18,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:18,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1338022656, now seen corresponding path program 13 times [2022-03-15 19:18:18,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:18,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723969019] [2022-03-15 19:18:18,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:18:19,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:19,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723969019] [2022-03-15 19:18:19,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723969019] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:19,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673066395] [2022-03-15 19:18:19,509 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:18:19,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:19,510 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:19,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 19:18:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:19,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:18:19,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:18:20,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:20,105 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:18:20,105 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 25 treesize of output 25 [2022-03-15 19:18:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:18:20,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673066395] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:20,336 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:20,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 39 [2022-03-15 19:18:20,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1138096242] [2022-03-15 19:18:20,336 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:20,339 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:20,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 419 states and 1146 transitions. [2022-03-15 19:18:20,499 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider Received shutdown request... [2022-03-15 19:18:28,017 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:18:28,018 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:18:28,033 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:18:28,033 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:18:28,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:28,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 19:18:28,219 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 5ms.. [2022-03-15 19:18:28,221 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:18:28,221 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:18:28,221 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:18:28,222 INFO L732 BasicCegarLoop]: Path program histogram: [13, 12, 11, 4, 4, 1, 1, 1, 1, 1] [2022-03-15 19:18:28,224 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:18:28,224 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:18:28,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:18:28 BasicIcfg [2022-03-15 19:18:28,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:18:28,225 INFO L158 Benchmark]: Toolchain (without parser) took 730869.71ms. Allocated memory was 174.1MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 116.5MB in the beginning and 789.9MB in the end (delta: -673.4MB). Peak memory consumption was 734.0MB. Max. memory is 8.0GB. [2022-03-15 19:18:28,225 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory was 133.6MB in the beginning and 133.5MB in the end (delta: 130.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:18:28,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.68ms. Allocated memory was 174.1MB in the beginning and 253.8MB in the end (delta: 79.7MB). Free memory was 116.4MB in the beginning and 224.8MB in the end (delta: -108.4MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2022-03-15 19:18:28,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.91ms. Allocated memory is still 253.8MB. Free memory was 224.8MB in the beginning and 222.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:18:28,225 INFO L158 Benchmark]: Boogie Preprocessor took 27.36ms. Allocated memory is still 253.8MB. Free memory was 222.7MB in the beginning and 220.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:18:28,225 INFO L158 Benchmark]: RCFGBuilder took 595.52ms. Allocated memory is still 253.8MB. Free memory was 220.6MB in the beginning and 187.5MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-03-15 19:18:28,226 INFO L158 Benchmark]: TraceAbstraction took 729909.15ms. Allocated memory was 253.8MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 187.0MB in the beginning and 789.9MB in the end (delta: -602.9MB). Peak memory consumption was 725.1MB. Max. memory is 8.0GB. [2022-03-15 19:18:28,226 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory was 133.6MB in the beginning and 133.5MB in the end (delta: 130.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.68ms. Allocated memory was 174.1MB in the beginning and 253.8MB in the end (delta: 79.7MB). Free memory was 116.4MB in the beginning and 224.8MB in the end (delta: -108.4MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.91ms. Allocated memory is still 253.8MB. Free memory was 224.8MB in the beginning and 222.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.36ms. Allocated memory is still 253.8MB. Free memory was 222.7MB in the beginning and 220.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 595.52ms. Allocated memory is still 253.8MB. Free memory was 220.6MB in the beginning and 187.5MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 729909.15ms. Allocated memory was 253.8MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 187.0MB in the beginning and 789.9MB in the end (delta: -602.9MB). Peak memory consumption was 725.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 242 PlacesBefore, 40 PlacesAfterwards, 257 TransitionsBefore, 38 TransitionsAfterwards, 7560 CoEnabledTransitionPairs, 8 FixpointIterations, 137 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 22 TrivialYvCompositions, 24 ConcurrentYvCompositions, 17 ChoiceCompositions, 274 TotalNumberOfCompositions, 8649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7267, positive: 7186, positive conditional: 0, positive unconditional: 7186, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4327, positive: 4299, positive conditional: 0, positive unconditional: 4299, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7267, positive: 2887, positive conditional: 0, positive unconditional: 2887, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 4327, unknown conditional: 0, unknown unconditional: 4327] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 5ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 5ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 5ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 5ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 314 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 729.8s, OverallIterations: 49, TraceHistogramMax: 4, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.8s, AutomataDifference: 414.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19976 SdHoareTripleChecker+Valid, 87.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19976 mSDsluCounter, 11431 SdHoareTripleChecker+Invalid, 74.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35631 mSDsCounter, 5807 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 175566 IncrementalHoareTripleChecker+Invalid, 181373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5807 mSolverCounterUnsat, 741 mSDtfsCounter, 175566 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15975 GetRequests, 11049 SyntacticMatches, 592 SemanticMatches, 4334 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 938672 ImplicationChecksByTransitivity, 340.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13333occurred in iteration=47, InterpolantAutomatonStates: 3140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.2s AutomataMinimizationTime, 48 MinimizatonAttempts, 161280 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 2638 NumberOfCodeBlocks, 2614 NumberOfCodeBlocksAsserted, 137 NumberOfCheckSat, 3705 ConstructedInterpolants, 86 QuantifiedInterpolants, 37399 SizeOfPredicates, 541 NumberOfNonLiveVariables, 12101 ConjunctsInSsa, 919 ConjunctsInUnsatCore, 126 InterpolantComputations, 11 PerfectInterpolantSequences, 708/1090 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown